國立虎尾科技大學 |

Automated Reasoning = 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Automated Reasoning/ edited by Nicolas Peltier, Viorica Sofronie-Stokkermans.
其他題名:	10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I /
其他作者:	Peltier, Nicolas.
面頁冊數:	XXVII, 537 p. 1161 illus., 9 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematical logic. -
電子資源:	https://doi.org/10.1007/978-3-030-51074-9
ISBN:	9783030510749

Automated Reasoning = 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I /
Automated Reasoning10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I /[electronic resource] :edited by Nicolas Peltier, Viorica Sofronie-Stokkermans. - 1st ed. 2020. - XXVII, 537 p. 1161 illus., 9 illus. in color.online resource. - Lecture Notes in Artificial Intelligence ;12166. - Lecture Notes in Artificial Intelligence ;9285.

Invited Paper -- Efficient Automated Reasoning about Sets and Multisets with Cardinality Constraints -- SAT; SMT and QBF -- An SMT Theory of Fixed-Point Arithmetic -- Covered Clauses Are Not Propagation Redundant -- The Resolution of Keller’s Conjecture -- How QBF Expansion Makes Strategy Extraction Hard -- Removing Algebraic Data Types from Constrained Horn Clauses Using Difference Predicates -- Solving bit-vectors with MCSAT: explanations from bits and pieces -- Monadic Decomposition in Integer Linear Arithmetic -- Scalable Algorithms for Abduction via Enumerative Syntax-Guided Synthesis -- Decision Procedures and Combination of Theories -- Deciding the Word Problem for Ground Identities with Commutative and Extensional Symbols -- Combined Covers and Beth Definability -- Deciding Simple Infinity Axiom Sets with one Binary Relation by Means of Superpostulates -- A Decision Procedure for String to Code Point Conversion -- Politeness for The Theory of Algebraic Datatypes -- Superposition -- A Knuth-Bendix-Like Ordering for Orienting Combinator Equations -- A Combinator-Based Superposition Calculus for Higher-Order Logic -- Subsumption Demodulation in First-Order Theorem Proving -- A Comprehensive Framework for Saturation Theorem Proving -- Proof Procedures -- Possible Models Computation and Revision - A Practical Approach -- SGGS Decision Procedures -- Integrating Induction and Coinduction via Closure Operators and Proof Cycles -- Logic-Independent Proof Search in Logical Frameworks (short paper) -- Layered Clause Selection for Theory Reasoning (short paper) -- Non Classical Logics -- Description Logics with Concrete Domains and General Concept Inclusions Revisited -- A Formally Verified, Optimized Monitor for Metric First-Order Dynamic Logic -- Constructive Hybrid Games -- Formalizing a Seligman-Style Tableau System for Hybrid Logic (short paper) -- NP Reasoning in the Monotone µ-Calculus -- Soft subexponentials and multiplexing -- Mechanised Modal Model Theory.

This two-volume set LNAI 12166 and 12167 constitutes the refereed proceedings of the 10th International Joint Conference on Automated Reasoning, IJCAR 2020, held in Paris, France, in July 2020.* In 2020, IJCAR was a merger of the following leading events, namely CADE (International Conference on Automated Deduction), FroCoS (International Symposium on Frontiers of Combining Systems), ITP (International Conference on Interactive Theorem Proving), and TABLEAUX (International Conference on Analytic Tableaux and Related Methods). The 46 full research papers, 5 short papers, and 11 system descriptions presented together with two invited talks were carefully reviewed and selected from 150 submissions. The papers focus on the following topics: Part I: SAT; SMT and QBF; decision procedures and combination of theories; superposition; proof procedures; non classical logics Part II: interactive theorem proving/ HOL; formalizations; verification; reasoning systems and tools *The conference was held virtually due to the COVID-19 pandemic. Chapter ‘Constructive Hybrid Games’ is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

ISBN: 9783030510749

Standard No.: 10.1007/978-3-030-51074-9doiSubjects--Topical Terms:

810627
Mathematical logic.

LC Class. No.: QA8.9-10.3

Dewey Class. No.: 005.131

Automated Reasoning = 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I /
LDR:04691nam a22004095i 4500 001 1024696
003 DE-He213
005 20200701042719.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030510749 $9 978-3-030-51074-9
024 7 $a 10.1007/978-3-030-51074-9 $2 doi
035 $a 978-3-030-51074-9
050 4 $a QA8.9-10.3
072 7 $a UYA $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.131 $2 23
245 1 0 $a Automated Reasoning $h [electronic resource] : $b 10th International Joint Conference, IJCAR 2020, Paris, France, July 1–4, 2020, Proceedings, Part I / $c edited by Nicolas Peltier, Viorica Sofronie-Stokkermans.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XXVII, 537 p. 1161 illus., 9 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 12166
505 0 $a Invited Paper -- Efficient Automated Reasoning about Sets and Multisets with Cardinality Constraints -- SAT; SMT and QBF -- An SMT Theory of Fixed-Point Arithmetic -- Covered Clauses Are Not Propagation Redundant -- The Resolution of Keller’s Conjecture -- How QBF Expansion Makes Strategy Extraction Hard -- Removing Algebraic Data Types from Constrained Horn Clauses Using Difference Predicates -- Solving bit-vectors with MCSAT: explanations from bits and pieces -- Monadic Decomposition in Integer Linear Arithmetic -- Scalable Algorithms for Abduction via Enumerative Syntax-Guided Synthesis -- Decision Procedures and Combination of Theories -- Deciding the Word Problem for Ground Identities with Commutative and Extensional Symbols -- Combined Covers and Beth Definability -- Deciding Simple Infinity Axiom Sets with one Binary Relation by Means of Superpostulates -- A Decision Procedure for String to Code Point Conversion -- Politeness for The Theory of Algebraic Datatypes -- Superposition -- A Knuth-Bendix-Like Ordering for Orienting Combinator Equations -- A Combinator-Based Superposition Calculus for Higher-Order Logic -- Subsumption Demodulation in First-Order Theorem Proving -- A Comprehensive Framework for Saturation Theorem Proving -- Proof Procedures -- Possible Models Computation and Revision - A Practical Approach -- SGGS Decision Procedures -- Integrating Induction and Coinduction via Closure Operators and Proof Cycles -- Logic-Independent Proof Search in Logical Frameworks (short paper) -- Layered Clause Selection for Theory Reasoning (short paper) -- Non Classical Logics -- Description Logics with Concrete Domains and General Concept Inclusions Revisited -- A Formally Verified, Optimized Monitor for Metric First-Order Dynamic Logic -- Constructive Hybrid Games -- Formalizing a Seligman-Style Tableau System for Hybrid Logic (short paper) -- NP Reasoning in the Monotone µ-Calculus -- Soft subexponentials and multiplexing -- Mechanised Modal Model Theory.
520 $a This two-volume set LNAI 12166 and 12167 constitutes the refereed proceedings of the 10th International Joint Conference on Automated Reasoning, IJCAR 2020, held in Paris, France, in July 2020.* In 2020, IJCAR was a merger of the following leading events, namely CADE (International Conference on Automated Deduction), FroCoS (International Symposium on Frontiers of Combining Systems), ITP (International Conference on Interactive Theorem Proving), and TABLEAUX (International Conference on Analytic Tableaux and Related Methods). The 46 full research papers, 5 short papers, and 11 system descriptions presented together with two invited talks were carefully reviewed and selected from 150 submissions. The papers focus on the following topics: Part I: SAT; SMT and QBF; decision procedures and combination of theories; superposition; proof procedures; non classical logics Part II: interactive theorem proving/ HOL; formalizations; verification; reasoning systems and tools *The conference was held virtually due to the COVID-19 pandemic. Chapter ‘Constructive Hybrid Games’ is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Artificial intelligence. $3 559380
650 0 $a Computer logic. $3 786340
650 0 $a Software engineering. $3 562952
650 0 $a Programming languages (Electronic computers). $3 1127615
650 0 $a Computer programming. $3 527822
650 1 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Software Engineering. $3 669632
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 669782
650 2 4 $a Programming Techniques. $3 669781
700 1 $a Peltier, Nicolas. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1320641
700 1 $a Sofronie-Stokkermans, Viorica. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 786296
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030510732
776 0 8 $i Printed edition: $z 9783030510756
830 0 $a Lecture Notes in Artificial Intelligence ; $v 9285 $3 1253845
856 4 0 $u https://doi.org/10.1007/978-3-030-51074-9
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)