LPAR23: Volume Information

LPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning

Papers

Keyphrases

Ad-hoc overloading, AI heuristics, alternating Turing machines, Analysis by simulation, Answer Set Programming, antiprenexing, attractors, automata, automated reasoning, automated theorem proving, axiomatisation, Bioinformatics, Boolean networks, Boolean satisfiability, Boolean Sensitivity, CDCL, CDCL with branch and bound, chromatic number of the plane, clauses, combinators, common knowledge, communication, completeness, complexity², computer mathematics, Concurrent Kleene Algebra, Constraint Programming, constraint solving, Coq, data structures, decidability, decision procedure, Deep Neural Networks, deep neural networks modification, Description Logic, diagnosis, Diophantine equations, distributed knowledge, DRAT proofs, Dynamic Fault Trees, dynamic logic, electronic circuits, epistemic logic, equivalence, explanation, Fault Tree Analysis, functional programming languages, graph coloring, Gromov's subgroup conjecture, guarded fragment, halting problem, higher-order logic, HOL, hypersequent calculi, induction, Induction Models, Infeasibility analysis, information flow security, information sharing, Input/Output Stochastic Automata, interactive theorem proving², intermediate logics, Knowledge Access, Knowledge Hiding, knowledge sharing, lambda calculus, litmus test, Logic Locking, logic programming², machine learning², Mathematical Induction, Maximal satisfiable subsets, MCS, Minimal Correction Subsets, MSS, natural deduction, neural networks verification, neural networks watermarking, nogoods, orderly generation, Partial Function Model, Preprocessing, probabilistic systems, Prolog, Proof-based interpolation, Proof synthesis, proofs, propositional logic², Recurrent Neural Networks, reduction, Reinforcement Learning, Repairable Fault Trees, Runtime Complexity, SAT, SAT solving², SAT/SMT, satisfiability, satisfiability problem, semantic model, separation logic³, shape predicates, solver, synthesis, Tactic Search, termination, transitive relations, tree neural networks, triguarded fragment, two-variable fragment, type theory, undecidability, verification², Weak determinism, weak monadic second-order logic, WSkS.