000 | 04797nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-642-38574-2 | ||
003 | DE-He213 | ||
005 | 20240423125936.0 | ||
007 | cr nn 008mamaa | ||
008 | 130605s2013 gw | s |||| 0|eng d | ||
020 |
_a9783642385742 _9978-3-642-38574-2 |
||
024 | 7 |
_a10.1007/978-3-642-38574-2 _2doi |
|
050 | 4 | _aQ334-342 | |
050 | 4 | _aTA347.A78 | |
072 | 7 |
_aUYQ _2bicssc |
|
072 | 7 |
_aCOM004000 _2bisacsh |
|
072 | 7 |
_aUYQ _2thema |
|
082 | 0 | 4 |
_a006.3 _223 |
245 | 1 | 0 |
_aAutomated Deduction -- CADE-24 _h[electronic resource] : _b24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013, Proceedings / _cedited by Maria Paola Bonacina. |
250 | _a1st ed. 2013. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2013. |
|
300 |
_aXVI, 466 p. 95 illus. _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 ; _v7898 |
|
505 | 0 | _aOne Logic to Use Them All -- The Tree Width of Separation Logic with Recursive Definitions -- Hierarchic Superposition with Weak Abstraction -- Completeness and Decidability Results for First-Order Clauses with Indices -- A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies -- Tractable Inference Systems: An Extension with a Deducibility Predicate -- Computing Tiny Clause Normal Forms -- System Description: E-KRHyper 1.4 Extensions for Unique Names and Description Logic -- Analysing Vote Counting Algorithms via Logic: And Its Application to the CADE Election Scheme -- Automated Reasoning, Fast and Slow -- Foundational Proof Certificates in First-Order Logic -- Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals -- A Symbiosis of Interval Constraint Propagation and Cylindrical Algebraic Decomposition -- dReal: An SMT Solver for Nonlinear Theories over the Reals -- Solving Difference Constraints over Modular Arithmetic -- Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis -- Hierarchical Combination -- PRocH: Proof Reconstruction for HOL Light -- An Improved BDD Method for Intuitionistic Propositional Logic: BDDIntKt System Description -- Towards Modularly Comparing Programs Using Automated Theorem Provers -- Reuse in Software Verification by Abstract Method Calls -- Dynamic Logic with Trace Semantics -- Temporalizing Ontology-Based Data Access -- Verifying Refutations with Extended Resolution -- Hierarchical Reasoning and Model Generation for the Verification of Parametric Hybrid Systems -- Quantifier Instantiation Techniques for Finite Model Finding in SMT -- Automating Inductive Proofs Using Theory Exploration -- E-MaLeS 1.1 -- TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism -- Propositional Temporal Proving with Reductions to a SAT Problem -- InKreSAT: Modal Reasoning via Incremental Reduction to SAT -- bv2epr: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into EPR -- The 481 Ways to Split a Clause and Deal with Propositional Variables. | |
520 | _aThis book constitutes the proceedings of the 24th International Conference on Automated Deduction, CADE-24, held in Lake Placid, NY, USA, in June 2013. The 31 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 71 initial submissions. CADE is the major forum for the presentation of research in all aspects of automated deduction, ranging from theoretical and methodological issues to the presentation of new theorem provers, solvers and systems. | ||
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aAlgorithms. | |
650 | 1 | 4 | _aArtificial Intelligence. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aAlgorithms. |
700 | 1 |
_aBonacina, Maria Paola. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642385735 |
776 | 0 | 8 |
_iPrinted edition: _z9783642385759 |
830 | 0 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v7898 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-38574-2 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c183342 _d183342 |