LEADER 05539nam 22006735 450 001 9910491025703321 005 20251225173426.0 010 $a3-030-79876-3 024 7 $a10.1007/978-3-030-79876-5 035 $a(CKB)5590000000532393 035 $aEBL6676599 035 $a(AU-PeEL)EBL6676599 035 $a(oapen)https://directory.doabooks.org/handle/20.500.12854/71322 035 $a(MiAaPQ)EBC6676599 035 $a(PPN)258303573 035 $a(DE-He213)978-3-030-79876-5 035 $a(EXLCZ)995590000000532393 100 $a20210707d2021 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAutomated Deduction ? CADE 28 $e28th International Conference on Automated Deduction, Virtual Event, July 12?15, 2021, Proceedings /$fedited by André Platzer, Geoff Sutcliffe 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (655 p.) 225 1 $aLecture Notes in Artificial Intelligence,$x2945-9141 ;$v12699 300 $aDescription based upon print version of record. 311 08$a3-030-79875-5 327 $aInvited Talks -- Non-well-founded Deduction for Induction and Coinduction -- Towards the Automatic Mathematician -- Logical Foundations -- Tableau-based decision procedure for non-Fregean logic of sentential identity -- Learning from Lukasiewicz and Meredith: Investigations into Proof Structures -- Efficient Local Reductions to Basic Modal Logic -- Isabelle's Metalogic: Formalization and Proof Checker -- Theory and Principles -- The ksmt calculus is a delta-complete decision procedure for non-linear constraints -- Universal Invariant Checking of Parametric Systems with Quantifier-Free SMT Reasoning -- Politeness and Stable Infiniteness: Stronger Together -- Equational Theorem Proving Modulo -- Unifying Decidable Entailments in Separation Logic with Inductive Definitions -- Subformula Linking for Intuitionistic Logic with Application to Type Theory -- Efficient SAT-based Proof Search in Intuitionistic Propositional Logic -- Proof Search and Certificates for Evidential Transactions -- Non-Clausal Redundancy Properties -- Multi-Dimensional Interpretation Methods for Termination of Term Rewriting -- Finding Good Proofs for Description Logic Entailments Using Recursive Quality Measures -- Computing Optimal Repairs of Quantified ABoxes w.r.t. Static EL Tboxes -- Generalized Completeness for SOS Resolution and its Application to a New Notion of Relevance -- A Unifying Splitting Framework -- Integer Induction in Saturation -- Superposition with First-Class Booleans and Inprocessing Clausification -- Superposition for Full Higher-Order Logic -- Implementation and Application -- Making Higher-Order Superposition Work -- Dual Proof Generation for Quantified Boolean Formulas with a BDD-Based Solver -- Reliable Reconstruction of Fine-Grained Proofs in a Proof Assistant -- An Automated Approach to the Collatz Conjecture -- Verified Interactive Computation of Definite Integrals -- ATP and AI -- Confidences for Commonsense Reasoning -- Neural Precedence Recommender -- Improving ENIGMA-Style Clause Selection While Learning From History -- System Descriptions -- A Normative Supervisor for Reinforcement Learning Agents (System Description) -- Automatically Building Diagrams for Olympiad Geometry Problems (System Description) -- The Fusemate Logic Programming System (System Description) -- Twee: An Equational Theorem Prover (System Description) -- The Isabelle/Naproche Natural Language Proof Assistant (System Description) -- The Lean 4 Theorem Prover and Programming Language (System Description) -- Harpoon: Mechanizing Metatheory Interactively (System Description). 330 $aThis open access book constitutes the proceeding of the 28th International Conference on Automated Deduction, CADE 28, held virtually in July 2021. The 29 full papers and 7 system descriptions presented together with 2 invited papers were carefully reviewed and selected from 76 submissions. CADE is the major forum for the presentation of research in all aspects of automated deduction, including foundations, applications, implementations, and practical experience. The papers are organized in the following topics: Logical foundations; theory and principles; implementation and application; ATP and AI; and system descriptions. 410 0$aLecture Notes in Artificial Intelligence,$x2945-9141 ;$v12699 606 $aArtificial intelligence 606 $aMachine theory 606 $aComputer science 606 $aSoftware engineering 606 $aArtificial Intelligence 606 $aFormal Languages and Automata Theory 606 $aComputer Science Logic and Foundations of Programming 606 $aSoftware Engineering 615 0$aArtificial intelligence. 615 0$aMachine theory. 615 0$aComputer science. 615 0$aSoftware engineering. 615 14$aArtificial Intelligence. 615 24$aFormal Languages and Automata Theory. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aSoftware Engineering. 676 $a006.3 700 $aPlatzer$b André$0998008 701 $aSutcliffe$b Geoff$01235917 801 0$bAU-PeEL 801 1$bAU-PeEL 801 2$bAU-PeEL 906 $aBOOK 912 $a9910491025703321 996 $aAutomated Deduction - CADE 28$92870259 997 $aUNINA