Proceedings of 24th International Conference on Logic for Programming, Artificial Intelligence and Reasoning

27 articles493 pagesPublished: June 3, 2023


Pages 1-10
Pages 11-22
Pages 23-35
Pages 36-47
Pages 48-72
Pages 73-95
Pages 96-111
Pages 112-123
Pages 124-143
Pages 144-163
Pages 164-180
Pages 181-204
Pages 205-223
Pages 224-237
Pages 238-256
Pages 257-269
Pages 270-287
Pages 288-305
Pages 306-316
Pages 317-328
Pages 329-349
Pages 350-368
Pages 369-385
Pages 386-404
Pages 405-456
Pages 457-472
Pages 473-493


abduction, abstraction refinement, algebraic data types, Answer Set Programming, arithmetic2, Automata-based, automated reasoning2, automated theorem provers, automated theorem proving2, benchmark, causality, CEGAR2, Certified implementation, Choreographic Programming, Clause Evaluation, Clause selection, Collaborative Inference, computational complexity, conditioning, conflict analysis, Constrained Horn Clauses, constraints, contract-based reasoning, Coq, counterfactuals, cvc5, decidability, decision diagrams, declarative semantics, deductive verification, Differentiable Logic, distributed protocols, Euclidean Algorithms, Euclidean Domains, experimental evaluation, finite fields, finite satisfiability problem, first-order model building, first-order reasoning, formal verification, Formalization of Algebraic Structures, Fuzzy Logic, Graph Neural Network, Graph Neural Networks, hypercubes, Hyperproperties2, HyperQPTL, induction, inductive invariants, inductive theorem provers, infinite model, interpretations, intuitionistic logic, k-safety, knowledge compilation, Language-parametric, Linear Integer Arithmetic, logic, machine learning3, modal logic, model checking, model theory, mu-calculus, network reliability, neural networks, non-linear arithmetic, non-linear integer arithmetic, non-linear real arithmetic, non-redundant learning, OEIS, polynomial arithmetic, possibility theory, probabilistic logic, Promptness, proof theory, PVS, QPTL, Quaternions, radio colorings, Routing, sampling, SAT2, Satisfiability Modulo Theories, satisfiability problem, saturation-based theorem proving, SCL, smart contracts, SMT, SMT solving2, SMTCoq, SyGuS, symbolic execution, temporal logic, theorem proving2, three-variable logic, TPTP, trace contracts, Triangular Sets, two-variable logic, types, unification, Unification with Abstraction, uniform one-dimensional fragment, verification3, weighted knowledge bases, Weighted Model Counting