LPAR23: Volume InformationLPAR23. LPAR23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning28 articles•516 pages•Published: May 27, 2020 PapersRobert Nieuwenhuis, Adrià Lozano, Albert Oliveras and Enric RodríguezCarbonell 111  Erika Abraham, Ezio Bartocci, Borzoo Bonakdarpour and Oyendrila Dobe 1231  Christian Alrabbaa, Franz Baader, Stefan Borgwardt, Patrick Koopmann and Alisa Kovtunova 3267  Federico Aschieri, Agata Ciabattoni and Francesco Antonio Genco 6889  Alexandru Baltag and Sonja Smets 90119  Jaroslav Bendík and Ivana Cerna 120137  Lasse Blaauwbroek, Josef Urban and Herman Geuvers 138150  Jan H. Boockmann and Gerald Luettgen 151168  A. Dileep, Kuldeep S. Meel and Ammar F. Sabili 169190  Mnacho Echenim, Radu Iosif and Nicolas Peltier 191211  Mathias Fleury and Christoph Weidenbach 212229  Thibault Gauthier 230248  Gael Glorian, JeanMarie Lagniez and Christophe Lecoutre 249259  Ben Goldberger, Guy Katz, Yossi Adi and Joseph Keshet 260278  Marcel Hark, Florian Frohn and Jürgen Giesl 279297  Vojtěch Havlena, Lukáš Holík, Ondrej Lengal, Ondrej Vales and Tomas Vojnar 298316  Tarek Khaled and Belaid Benhamou 317333  Emanuel Kieronski and Adam Malinowski 334353  Raúl E. Monti, Carlos E. Budde and Pedro R. D'Argenio 354372  Peter Oostema, Ruben Martins and Marijn Heule 373389  Jens Pagel and Florian Zuleger 390408  Bartosz Piotrowski and Josef Urban 409422  Adrian Rebola Pardo and Georg Weissenbacher 423448  Yakoub Salhi 449464  Jarkko Savela, Emilia Oikarinen and Matti Järvisalo 465482  Joseph Sweeney, Marijn J. H. Heule and Lawrence Pileggi 483497  Johannes Åman Pohjola and Arve Gengelbach 498515  Alexandra Silva 516 
KeyphrasesAdhoc 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^{2}, 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, higherorder logic, HOL, hypersequent calculi, induction, Induction Models, Infeasibility analysis, information flow security, information sharing, Input/Output Stochastic Automata, interactive theorem proving^{2}, intermediate logics, Knowledge Access, Knowledge Hiding, knowledge sharing, lambda calculus, litmus test, Logic Locking, logic programming^{2}, machine learning^{2}, 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, Proofbased interpolation, Proof synthesis, proofs, propositional logic^{2}, Recurrent Neural Networks, reduction, Reinforcement Learning, Repairable Fault Trees, Runtime Complexity, SAT, SAT solving^{2}, SAT/SMT, satisfiability, satisfiability problem, semantic model, separation logic^{3}, shape predicates, solver, synthesis, Tactic Search, termination, transitive relations, tree neural networks, triguarded fragment, twovariable fragment, type theory, undecidability, verification^{2}, Weak determinism, weak monadic secondorder logic, WSkS. 
