國立高雄大學圖資館 |

Automated deduction - CADE 2929th International Conference on Automated Deduction, Rome, Italy, July 1-4, 2023 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Automated deduction - CADE 29edited by Brigitte Pientka, Cesare Tinelli.
其他題名:	29th International Conference on Automated Deduction, Rome, Italy, July 1-4, 2023 : proceedings /
其他題名:	CADE 29
其他作者:	Pientka, Brigitte.
團體作者:
出版者:	Cham :Springer Nature Switzerland :2023.
面頁冊數:	xxv, 592 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Automatic theorem provingCongresses.
電子資源:	https://doi.org/10.1007/978-3-031-38499-8
ISBN:	9783031384998$q(electronic bk.)

Automated deduction - CADE 2929th International Conference on Automated Deduction, Rome, Italy, July 1-4, 2023 : proceedings /
Automated deduction - CADE 2929th International Conference on Automated Deduction, Rome, Italy, July 1-4, 2023 : proceedings /[electronic resource] :CADE 29edited by Brigitte Pientka, Cesare Tinelli. - Cham :Springer Nature Switzerland :2023. - xxv, 592 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,141320302-9743 ;. - Lecture notes in computer science ;4891..

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)

Open access.

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.

ISBN: 9783031384998$q(electronic bk.)

Standard No.: 10.1007/978-3-031-38499-8doiSubjects--Topical Terms:

443052
Automatic theorem proving
--Congresses.

LC Class. No.: QA76.9.A96 / I58 2023

Dewey Class. No.: 511.36028563

Automated deduction - CADE 2929th International Conference on Automated Deduction, Rome, Italy, July 1-4, 2023 : proceedings /
LDR:03663nmm a2200373 a 4500 001 647520
003 DE-He213
005 20230902001458.0
006 m d
007 cr nn 008maaau
008 240116s2023 sz s 0 eng d
020 $a 9783031384998$q(electronic bk.)
020 $a 9783031384981$q(paper)
024 7 $a 10.1007/978-3-031-38499-8 $2 doi
035 $a 978-3-031-38499-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A96 $b I58 2023
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 511.36028563 $2 23
090 $a QA76.9.A96 $b I61 2023
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Automated deduction - CADE 29 $h [electronic resource] : $b 29th International Conference on Automated Deduction, Rome, Italy, July 1-4, 2023 : proceedings / $c edited by Brigitte Pientka, Cesare Tinelli.
246 3 $a CADE 29
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2023.
300 $a xxv, 592 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 14132
490 1 $a Lecture notes in artificial intelligence
505 0 $a 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)
506 $a Open access.
520 $a 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.
650 0 $a Automatic theorem proving $v Congresses. $3 443052
650 0 $a Logic, Symbolic and mathematical $3 254195
650 1 4 $a Artificial Intelligence. $3 212515
650 2 4 $a Formal Languages and Automata Theory. $3 914922
650 2 4 $a Computer Science Logic and Foundations of Programming. $3 913141
650 2 4 $a Software Engineering. $3 274511
700 1 $a Pientka, Brigitte. $3 956868
700 1 $a Tinelli, C. $3 956869
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Lecture notes in artificial intelligence. $3 822012
856 4 0 $u https://doi.org/10.1007/978-3-031-38499-8
950 $a Computer Science (SpringerNature-11645)