國立高雄大學圖資館 |

Language: English

Back

Automated deduction - CADE 2828th In...

(1998 :)

Automated deduction - CADE 2828th International Conference on Automated Deduction, virtual event, July 12-15, 2021 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Automated deduction - CADE 28edited by Andre Platzer, Geoff Sutcliffe.
Reminder of title:	28th International Conference on Automated Deduction, virtual event, July 12-15, 2021 : proceedings /
remainder title:	CADE 28
other author:	Platzer, Andre.
corporate name:
Published:	Cham :Springer International Publishing :2021.
Description:	xiv, 650 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Automatic theorem provingCongresses.
Online resource:	https://doi.org/10.1007/978-3-030-79876-5
ISBN:	9783030798765$q(electronic bk.)

Automated deduction - CADE 2828th 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] :CADE 28edited by Andre Platzer, Geoff Sutcliffe. - Cham :Springer International Publishing :2021. - xiv, 650 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,126990302-9743 ;. - Lecture notes in computer science ;4891..

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$q(electronic bk.)

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

443052
Automatic theorem proving
--Congresses.

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

Dewey Class. No.: 511.36028563

Automated deduction - CADE 2828th International Conference on Automated Deduction, virtual event, July 12-15, 2021 : proceedings /
LDR:04496nmm a2200373 a 4500 001 602083
003 DE-He213
005 20210708133305.0
006 m d
007 cr nn 008maaau
008 211112s2021 sz s 0 eng d
020 $a 9783030798765$q(electronic bk.)
020 $a 9783030798758$q(paper)
024 7 $a 10.1007/978-3-030-79876-5 $2 doi
035 $a 978-3-030-79876-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A96 $b I58 2021
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 2021
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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 Andre Platzer, Geoff Sutcliffe.
246 3 $a CADE 28
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xiv, 650 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12699
490 1 $a Lecture notes in artificial intelligence
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 $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 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 Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Logics and Meanings of Programs. $3 275357
650 2 4 $a Software Engineering. $3 274511
700 1 $a Platzer, Andre. $3 492115
700 1 $a Sutcliffe, Geoff. $3 285413
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-030-79876-5
950 $a Computer Science (SpringerNature-11645)