LPAR23: LPAR-23: 23RD INTERNATIONAL CONFERENCE ON LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE AND REASONING

This page contains an index consisting of author-provided keywords.

A
Ad-hoc overloading	A Mechanised Semantics for HOL with Ad-hoc Overloading
AI Heuristics	Decision levels are stable: towards better SAT heuristics
Alternating Turing machines	Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard
Answer Set Programming	An ASP-based Approach for Boolean Networks Representation and Attractor Detection
Attractors	An ASP-based Approach for Boolean Networks Representation and Attractor Detection
Automated Reasoning	Decision levels are stable: towards better SAT heuristics Counterexample Driven Quantifier Instantiations with Applications to Distributed Protocols
Axiomatisation	Models of Concurrent Kleene Algebra
B
Bioinformatics	An ASP-based Approach for Boolean Networks Representation and Attractor Detection
Boolean Networks	An ASP-based Approach for Boolean Networks Representation and Attractor Detection
Boolean satisfiability	Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation
Boolean Sensitivity	Sensitivity Analysis of Locked Circuits
C
CDCL	A Verified SAT Solver Framework including Optimization and Partial Valuations
CDCL with branch and bound	A Verified SAT Solver Framework including Optimization and Partial Valuations
chromatic number of the plane	Coloring Unit-Distance Strips using SAT
combinators	Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic
Common Knowledge	Learning What Others Know
Communication	Learning What Others Know
Completeness	Models of Concurrent Kleene Algebra
Complexity	Finding Small Proofs for Description Logic Entailments -- Theory and Practice Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard
computer mathematics	Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation
Concurrent Kleene Algebra	Models of Concurrent Kleene Algebra
Constraint Solving	Decision levels are stable: towards better SAT heuristics
Coq	Tactic Learning for the Coq Proof Assistant (Short Paper)
D
data structures	Learning Data Structure Shapes from Memory Graphs
decidability	Polynomial Loops: Beyond Termination
Deep neural networks	Minimal Modifications of Deep Neural Networks using Verification
deep neural networks modification	Minimal Modifications of Deep Neural Networks using Verification
Description Logic	Finding Small Proofs for Description Logic Entailments -- Theory and Practice
Diophantine equations	Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic
Distributed Knowledge	Learning What Others Know
DRAT proofs	RAT Elimination
Dynamic Logic	Learning What Others Know
E
Electronic Circuits	Sensitivity Analysis of Locked Circuits
Epistemic Logic	Learning What Others Know
Equivalence	Induction Models on N
Explanation	Finding Small Proofs for Description Logic Entailments -- Theory and Practice
F
formal methods	Counterexample Driven Quantifier Instantiations with Applications to Distributed Protocols
G
graph coloring	Coloring Unit-Distance Strips using SAT
Gromov's subgroup conjecture	Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation
guarded fragment	The Triguarded Fragment with Transitivity
H
halting problem	Polynomial Loops: Beyond Termination
Higher-order logic	A Mechanised Semantics for HOL with Ad-hoc Overloading
HOL	Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic
I
Induction	Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard
Induction Models	Induction Models on N
Information Sharing	Learning What Others Know
Information-flow security	Parameter Synthesis for Probabilistic Hyperproperties
Interactive theorem proving	Tactic Learning for the Coq Proof Assistant (Short Paper) A Mechanised Semantics for HOL with Ad-hoc Overloading
L
Litmus Test	Models of Concurrent Kleene Algebra
Logic Locking	Sensitivity Analysis of Locked Circuits
Logic Programming	An ASP-based Approach for Boolean Networks Representation and Attractor Detection Decision levels are stable: towards better SAT heuristics
LPAR	LPAR-23 Welcome
M
Machine Learning	Tactic Learning for the Coq Proof Assistant (Short Paper)
Mathematical Induction	Induction Models on N
N
neural networks verification	Minimal Modifications of Deep Neural Networks using Verification
neural networks watermarking	Minimal Modifications of Deep Neural Networks using Verification
O
orderly generation	Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation
P
Partial Function Model	Models of Concurrent Kleene Algebra
Probabilistic systems	Parameter Synthesis for Probabilistic Hyperproperties
Prolog	Learning Data Structure Shapes from Memory Graphs
Proof-based interpolation	RAT Elimination
Proofs	Finding Small Proofs for Description Logic Entailments -- Theory and Practice
Propositional logic	RAT Elimination
R
Reduction	Induction Models on N
reinforcement learning	Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic
reviewing	LPAR-23 Welcome
runtime complexity	Polynomial Loops: Beyond Termination
S
SAT solving	RAT Elimination Coloring Unit-Distance Strips using SAT
SAT/SMT	Decision levels are stable: towards better SAT heuristics
Satisfiability	Sensitivity Analysis of Locked Circuits
satisfiability problem	The Triguarded Fragment with Transitivity
separation logic	Learning Data Structure Shapes from Memory Graphs Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard
shape predicates	Learning Data Structure Shapes from Memory Graphs
smart contracts	Counterexample Driven Quantifier Instantiations with Applications to Distributed Protocols
statistics	LPAR-23 Welcome
Synthesis	Parameter Synthesis for Probabilistic Hyperproperties
T
Tactic Search	Tactic Learning for the Coq Proof Assistant (Short Paper)
termination	Polynomial Loops: Beyond Termination
transitive relations	The Triguarded Fragment with Transitivity
tree neural networks	Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic
triguarded fragment	The Triguarded Fragment with Transitivity
two-variable fragment	The Triguarded Fragment with Transitivity
V
verification	Minimal Modifications of Deep Neural Networks using Verification A Verified SAT Solver Framework including Optimization and Partial Valuations Counterexample Driven Quantifier Instantiations with Applications to Distributed Protocols

Disclaimer | Powered by EasyChair Smart Program