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

abstract interpretation, action model, arithmetic, automated inductive reasoning, automated reasoning³, automated software verification, automated theorem proving⁵, bags, belief change, blockchain protocols, Blocked-clause Addition, bounded tree-width, btor2mlir, bv, call-by-name, call-by-value, certification², 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 logic², 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 verification², proof certificate, proof checking, Proof Schema, proof search, proof theory, proof transformation, proof translation², proof-net, Proof-Search Procedures, proofs, propositional dynamic logic, protocol verification, quantifier elimination, quantitative models, Reasoning, recursive programs, relations, Resolution Calculus, resource logic, reuse, rewriting², SAT solving, satisfiability, Satisfiability Modulo Theories, saturation, Saturation-based proving, Security, sequent calculus, sequent system, sets, simulation, Skolemization, SMT², sorting algorithms, sorting networks, SQL, static analysis², 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