國立虎尾科技大學 |

Automated Deduction – CADE 28 = 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Automated Deduction – CADE 28/ edited by André Platzer, Geoff Sutcliffe.
其他題名:	28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings /
其他作者:	Platzer, André.
面頁冊數:	XIV, 650 p. 194 illus., 2 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Artificial intelligence. -
電子資源:	https://doi.org/10.1007/978-3-030-79876-5
ISBN:	9783030798765

Automated Deduction – CADE 28 = 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings /
Automated Deduction – CADE 2828th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings /[electronic resource] :edited by André Platzer, Geoff Sutcliffe. - 1st ed. 2021. - XIV, 650 p. 194 illus., 2 illus. in color.online resource. - Lecture Notes in Artificial Intelligence ;12699. - Lecture Notes in Artificial Intelligence ;9285.

Invited 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).

Open Access

This 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.

ISBN: 9783030798765

Standard No.: 10.1007/978-3-030-79876-5doiSubjects--Topical Terms:

559380
Artificial intelligence.

LC Class. No.: Q334-342

Dewey Class. No.: 006.3

Automated Deduction – CADE 28 = 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings /
LDR:04765nam a22004335i 4500 001 1046990
003 DE-He213
005 20211014213009.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030798765 $9 978-3-030-79876-5
024 7 $a 10.1007/978-3-030-79876-5 $2 doi
035 $a 978-3-030-79876-5
050 4 $a Q334-342
072 7 $a UYQ $2 bicssc
072 7 $a COM004000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 006.3 $2 23
245 1 0 $a Automated Deduction – CADE 28 $h [electronic resource] : $b 28th International Conference on Automated Deduction, Virtual Event, July 12–15, 2021, Proceedings / $c edited by André Platzer, Geoff Sutcliffe.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XIV, 650 p. 194 illus., 2 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Lecture Notes in Artificial Intelligence ; $v 12699
505 0 $a Invited 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).
506 0 $a Open Access
520 $a This 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.
650 0 $a Artificial intelligence. $3 559380
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Computer logic. $3 786340
650 0 $a Software engineering. $3 562952
650 1 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Software Engineering. $3 669632
700 1 $a Platzer, André. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1255381
700 1 $a Sutcliffe, Geoff. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 675972
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030798758
776 0 8 $i Printed edition: $z 9783030798772
830 0 $a Lecture Notes in Artificial Intelligence ; $v 9285 $3 1253845
856 4 0 $u https://doi.org/10.1007/978-3-030-79876-5
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
912 $a ZDB-2-SOB
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)