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

31 articles502 pagesPublished: May 26, 2024


Pages 1-18
Pages 19-35
Pages 36-50
Pages 51-69
Pages 70-87
Pages 88-105
Pages 106-115
Pages 116-126
Pages 127-135
Pages 136-146
Pages 147-164
Pages 165-180
Pages 181-197
Pages 198-221
Pages 222-231
Pages 232-245
Pages 246-263
Pages 264-277
Pages 278-294
Pages 295-310
Pages 311-320
Pages 321-340
Pages 341-359
Pages 360-369
Pages 370-389
Pages 390-407
Pages 408-425
Pages 426-444
Pages 445-463
Pages 464-483
Pages 484-502


abstract interpretation, action model, arithmetic, automated inductive reasoning, automated reasoning3, automated software verification, automated theorem proving5, bags, belief change, blockchain protocols, Blocked-clause Addition, bounded tree-width, btor2mlir, bv, call-by-name, call-by-value, certification2, choice, CNF formulas, concept alignment, confluence, Constrained Horn Clauses, constraint solving, CTL, cut elimination, Datalog, decision lists, decision procedure, deep inference, dependent HOL, dependent type theory, eBPF, epistemic logic, epistemic process, epsilon calculus, evaluation strategies, first-order logic, first-order theorem proving, formal methods, Free-Variable Tableaux, Fuzzy Logic, game semantics, Game-theoretic security, Games semantics, graph grammars, Herbrand sequents, higher-order logic, Hilbert's epsilon formalism, hypergraphs, incentive compatibility, Incremental SAT, induction, Inductive proofs, intersection types, knowledge representation, lambda calculus, large language models, linear logic2, LIRA, logic programming, logical frameworks, machine learning, MLL, modal logic, model checking, monadic second-order logic, natural language, non-linear integer arithmetic, nondeterminism, NP-hardness, parallel reduction, Portfolio of Strategies, Preprocessing, program optimization, program verification2, proof certificate, proof checking, Proof Schema, proof search, proof theory, proof transformation, proof translation2, proof-net, Proof-Search Procedures, proofs, propositional dynamic logic, protocol verification, quantifier elimination, quantitative models, Reasoning, recursive programs, relations, Resolution Calculus, resource logic, reuse, rewriting2, SAT solving, satisfiability, Satisfiability Modulo Theories, saturation, Saturation-based proving, Security, sequent calculus, sequent system, sets, simulation, Skolemization, SMT2, sorting algorithms, sorting networks, SQL, static analysis2, Steamroller Problems, strategy invention, Strategy Scheduling, superposition, superposition calculus, symbolic abstraction, symbolic execution, synthesis, system description, tables, theorem proving, theory combination, Theory Politeness, Trust, Tuple-generating dependencies, verification, virtual substitution, weakest liberal precondition