LEADER 04666nam 22006375 450 001 996550559603316 005 20230902001458.0 010 $a3-031-38499-7 024 7 $a10.1007/978-3-031-38499-8 035 $a(MiAaPQ)EBC30733646 035 $a(Au-PeEL)EBL30733646 035 $a(DE-He213)978-3-031-38499-8 035 $a(PPN)272733997 035 $a(OCoLC)1396164550 035 $a(EXLCZ)9928173261300041 100 $a20230902d2023 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAutomated Deduction ? CADE 29$b[electronic resource] $e29th International Conference on Automated Deduction, Rome, Italy, July 1?4, 2023, Proceedings /$fedited by Brigitte Pientka, Cesare Tinelli 205 $a1st ed. 2023. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2023. 215 $a1 online resource (614 pages) 225 1 $aLecture Notes in Artificial Intelligence,$x2945-9141 ;$v14132 311 08$aPrint version: Pientka, Brigitte Automated Deduction - CADE 29 Cham : Springer International Publishing AG,c2023 9783031384981 327 $aCertified Core-Guided MaxSAT Solving -- Superposition with Delayed Unification -- On Incremental Pre-processing for SMT -- Verified Given Clause Procedures -- QSMA: A New Algorithm for Quantified Satisfiability Modulo Theory and Assignment -- Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs -- An Isabelle/HOL Formalization of the SCL(FOL) Calculus -- SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning -- Formal Reasoning about Influence in Natural Sciences Experiments -- A Theory of Cartesian Arrays (with Applications in Quantum Circuit Verification) -- SAT-Based Subsumption Resolution -- A more Pragmatic CDCL for IsaSAT and targetting LLVM (Short Paper) -- Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper) -- COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (System Description) -- Choose your Colour: Tree Interpolation for Quantified Formulas in SMT -- Proving Termination of C Programs with Lists -- Reasoning about Regular Properties: A Comparative Study -- Program Synthesis in Saturation -- A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus -- Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs -- Verification of NP-hardness Reduction Functions for Exact Lattice Problems -- Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic -- Left-Linear Completion with AC Axioms -- On P -interpolation in local theory extensions and applications to the study of interpolation in the description logics EL, EL+ -- Theorem Proving in Dependently-Typed Higher-Order Logic -- Towards Fast Nominal Anti-Unification of Letrec-Expressions -- Confluence Criteria for Logically Constrained Rewrite Systems -- Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory -- An Experimental Pipeline for Automated Reasoning in Natural Language (Short paper) -- Combining Combination Properties: An Analysis of Stable-infiniteness, Convexity, and Politeness -- Decidability of difference logic over the reals with uninterpreted unary predicates -- Incremental Rewriting Modulo SMT -- Iscalc: an Interactive Symbolic Computation Framework (System Description). 330 $aThis open access book constitutes the proceedings of the 29th International Conference on Automated Deduction, CADE 29, which took place in Rome, Italy, during July 2023. . 410 0$aLecture Notes in Artificial Intelligence,$x2945-9141 ;$v14132 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 $aPientka$b Brigitte$01427157 701 $aTinelli$b Cesare$01427158 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996550559603316 996 $aAutomated Deduction - CADE 29$93560005 997 $aUNISA