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

28 articles516 pagesPublished: May 27, 2020


Pages 1-11
Pages 12-31
Pages 32-67
Pages 68-89
Pages 90-119
Pages 120-137
Pages 138-150
Pages 151-168
Pages 169-190
Pages 191-211
Pages 212-229
Pages 230-248
Pages 249-259
Pages 260-278
Pages 279-297
Pages 298-316
Pages 317-333
Pages 334-353
Pages 354-372
Pages 373-389
Pages 390-408
Pages 409-422
Pages 423-448
Pages 449-464
Pages 465-482
Pages 483-497
Pages 498-515
Page 516


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, complexity2, 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 proving2, intermediate logics, Knowledge Access, Knowledge Hiding, knowledge sharing, lambda calculus, litmus test, Logic Locking, logic programming2, machine learning2, 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 synthesis, Proof-based interpolation, proofs, propositional logic2, Recurrent Neural Networks, reduction, Reinforcement Learning, Repairable Fault Trees, Runtime Complexity, SAT, SAT solving2, SAT/SMT, satisfiability, satisfiability problem, semantic model, separation logic3, shape predicates, solver, synthesis, Tactic Search, termination, transitive relations, tree neural networks, triguarded fragment, two-variable fragment, type theory, undecidability, verification2, Weak determinism, weak monadic second-order logic, WSkS