000 06187nam a22006375i 4500
001 978-3-319-08587-6
003 DE-He213
005 20240730172038.0
007 cr nn 008mamaa
008 140701s2014 sz | s |||| 0|eng d
020 _a9783319085876
_9978-3-319-08587-6
024 7 _a10.1007/978-3-319-08587-6
_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] :
_b7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, Vienna, Austria, July 19-22, 2014, Proceedings /
_cedited by Stéphane Demri, Deepak Kapur, Christoph Weidenbach.
250 _a1st ed. 2014.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2014.
300 _aXXVIII, 528 p. 101 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 ;
_v8562
505 0 _aFrom Reachability to Temporal Specifications in Cost-Sharing Games -- Electronic Voting: How Logic Can Help -- And-Or Tableaux for Fix point Logics with Converse: LTL, CTL, PDL and CPDL -- Unified Classical Logic Completeness: A Coinductive Pearl -- A Focused Sequent Calculus for Higher-Order Logic -- SAT-Based Decision Procedure for Analytic Pure Sequent Calculi -- A Unified Proof System for QBF Pre processing -- The Fractal Dimension of SAT Formulas -- A Gentle Non-disjoint Combination of Satisfiability Procedures -- A Rewriting Strategy to Generate Prime Implicates in Equational Logic -- Finite Quantification in Hierarchic Theorem Proving -- Computing All Implied Equalities via SMT-Based Partition Refinement -- Proving Termination of Programs Automatically with A Pro VE -- Locality Transfer: From Constrained Axiomatizations to Reachability Predicates -- Proving Termination and Memory Safety for Programs with Pointer Arithmetic -- QBF Encoding of Temporal Properties and QBF-Based Verification -- Introducing Quantified Cuts in Logic with Equality -- Quati: An Automated Tool for Proving Permutation Lemmas -- A History-Based Theorem Prover for Intuitionistic Propositional Logic Using Global Caching: IntHistGC System Description -- M lean CoP: A Connection Prover for First-Order Modal Logic -- Optimal Tableaux-Based Decision Procedure for Testing Satisfiability in the Alternating-Time Temporal Logic ATL+ -- dTL2: Differential Temporal Dynamic Logic with Nested Temporalities for Hybrid Systems -- Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications -- Clausal Resolution for Modal Logics of Confluence -- Implementing Tableau Calculi Using BDDs: BDDTab System Description -- Approximations for Model Construction -- A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic -- StarExec: A Cross-Community Infrastructure for Logic -- Skeptik: A Proof Compression System -- Terminating Minimal Model Generation Procedures for PropositionalModal Logics -- Cool - A Generic Reasoner for Coalgebraic Hybrid Logics (System Description) -- The Complexity of Theorem Proving in Circumscription and Minimal Entailment -- Visibly Linear Temporal Logic -- Count and Forget: Uniform Interpolation of SHQ- Ontologies -- Coupling Tableau Algorithms for Expressive Description Logics with Completion-Based Saturation Procedures -- EL-ifying Ontologies -- The Bayesian Description Logic BEL -- OTTER Proofs in Tarskian Geometry -- NESCOND: An Implementation of Nested Sequent Calculi for Conditional Logics -- Knowledge Engineering for Large Ontologies with Sigma KEE 3.0.
520 _aThis book constitutes the refereed proceedings of the 7th International Joint Conference on Automated Reasoning, IJCAR 2014, held as part of the Vienna Summer of Logic, VSL 2014, in Vienna, Austria, in July 2014. IJCAR 2014 was a merger of three leading events in automated reasoning, namely CADE (International Conference on Automated Deduction), FroCoS (International Symposium on Frontiers of Combining Systems) and TABLEAUX (International Conference on Automated Reasoning with Analytic Tableaux and Related Methods). The 26 revised full research papers and 11 system descriptions presented together with 3 invited talks were carefully reviewed and selected from 83 submissions. The papers have been organized in topical sections on HOL, SAT and QBF, SMT, equational reasoning, verification, proof theory, modal and temporal reasoning, SMT and SAT, modal logic, complexity, description logics and knowledge representation and reasoning.
650 0 _aMachine theory.
_9101477
650 0 _aComputer science.
_99832
650 0 _aArtificial intelligence.
_93407
650 0 _aSoftware engineering.
_94138
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aNumerical analysis.
_94603
650 1 4 _aFormal Languages and Automata Theory.
_9101481
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aMathematics of Computing.
_931875
650 2 4 _aNumerical Analysis.
_94603
700 1 _aDemri, Stéphane.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9101484
700 1 _aKapur, Deepak.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9101485
700 1 _aWeidenbach, Christoph.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9101486
710 2 _aSpringerLink (Online service)
_9101487
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319085869
776 0 8 _iPrinted edition:
_z9783319085883
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v8562
_9101488
856 4 0 _uhttps://doi.org/10.1007/978-3-319-08587-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c87968
_d87968