| Description |
1 online resource (xxv, 592 pages) : illustrations (some color). |
| Series |
Lecture notes in artificial intelligence |
|
Lecture notes in computer science ; 14132 |
|
LNCS sublibrary, SL 7, Artificial intelligence |
|
Lecture notes in computer science. Lecture notes in artificial intelligence.
|
|
Lecture notes in computer science ; 14132.
|
|
LNCS sublibrary. SL 7, Artificial intelligence.
|
| Contents |
Certified 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). |
| Note |
Includes author index. |
| Access |
Open access. GW5XE |
| Summary |
This 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. |
| Note |
Online resource; title from PDF title page (SpringerLink, viewed September 5, 2023). |
| Local Note |
Springer Nature Springer Nature - SpringerLink eBooks - Fully Open Access |
| Subject |
Automatic theorem proving -- Congresses.
|
|
Logic, Symbolic and mathematical -- Congresses.
|
| Genre/Form |
Electronic books.
|
|
proceedings (reports)
|
|
Conference papers and proceedings.
|
| Added Author |
Pientka, Brigitte, editor. https://orcid.org/0000-0002-2549-4276
|
|
Tinelli, C. (Cesare), editor. https://orcid.org/0000-0002-6726-775X
|
| Added Title |
CADE 29 |
| ISBN |
9783031384998 (electronic bk.) |
|
3031384997 (electronic bk.) |
|
9783031384981 |
| Standard No. |
10.1007/978-3-031-38499-8 doi |
|
