000 05690nam a22006255i 4500
001 978-3-030-51074-9
003 DE-He213
005 20240730172134.0
007 cr nn 008mamaa
008 200629s2020 sz | s |||| 0|eng d
020 _a9783030510749
_9978-3-030-51074-9
024 7 _a10.1007/978-3-030-51074-9
_2doi
050 4 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
245 1 0 _aAutomated Reasoning
_h[electronic resource] :
_b10th International Joint Conference, IJCAR 2020, Paris, France, July 1-4, 2020, Proceedings, Part I /
_cedited by Nicolas Peltier, Viorica Sofronie-Stokkermans.
250 _a1st ed. 2020.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2020.
300 _aXXVII, 537 p. 1161 illus., 9 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v12166
505 0 _aInvited 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 _aThis 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 _aMachine theory.
_9102047
650 0 _aArtificial intelligence.
_93407
650 0 _aComputer science.
_99832
650 0 _aSoftware engineering.
_94138
650 0 _aCompilers (Computer programs).
_93350
650 0 _aComputer programming.
_94169
650 1 4 _aFormal Languages and Automata Theory.
_9102050
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aProgramming Techniques.
_9102052
700 1 _aPeltier, Nicolas.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9102053
700 1 _aSofronie-Stokkermans, Viorica.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9102054
710 2 _aSpringerLink (Online service)
_9102057
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030510732
776 0 8 _iPrinted edition:
_z9783030510756
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v12166
_9102059
856 4 0 _uhttps://doi.org/10.1007/978-3-030-51074-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c88055
_d88055