000 05357nam a22005895i 4500
001 978-3-540-31650-3
003 DE-He213
005 20240730193414.0
007 cr nn 008mamaa
008 100409s2005 gw | s |||| 0|eng d
020 _a9783540316503
_9978-3-540-31650-3
024 7 _a10.1007/11591191
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aLogic for Programming, Artificial Intelligence, and Reasoning
_h[electronic resource] :
_b12th International Conference, LPAR 2005, Montego Bay, Jamaica, December 2-6, 2005, Proceedings /
_cedited by Geoff Sutcliffe, Andrei Voronkov.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aXIV, 744 p.
_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 ;
_v3835
505 0 _aIndependently Checkable Proofs from Decision Procedures: Issues and Progress -- Zap: Automated Theorem Proving for Software Analysis -- Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools -- Scaling Up: Computers vs. Common Sense -- A New Constraint Solver for 3D Lattices and Its Application to the Protein Folding Problem -- Disjunctive Constraint Lambda Calculi -- Computational Issues in Exploiting Dependent And-Parallelism in Logic Programming: Leftness Detection in Dynamic Search Trees -- The nomore?+?+ Approach to Answer Set Solving -- Optimizing the Runtime Processing of Types in Polymorphic Logic Programming Languages -- The Four Sons of Penrose -- An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures -- Second-Order Principles in Specification Languages for Object-Oriented Programs -- Strong Normalization of the Dual Classical Sequent Calculus -- Termination of Fair Computations in Term Rewriting -- On Confluence of Infinitary Combinatory Reduction Systems -- Matching with Regular Constraints -- Recursive Path Orderings Can Also Be Incremental -- Automating Coherent Logic -- The Theorema Environment for Interactive Proof Development -- A First Order Extension of Stålmarck's Method -- Regular Derivations in Basic Superposition-Based Calculi -- On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity -- Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination -- Monotone AC-Tree Automata -- On the Specification of Sequent Systems -- Verifying and Reflecting Quantifier Elimination for Presburger Arithmetic -- Integration of a Software Model Checker into Isabelle -- Experimental Evaluation of Classical Automata Constructions -- Automatic Validation of Transformation Rules for JavaVerification Against a Rewriting Semantics -- Reasoning About Incompletely Defined Programs -- Model Checking Abstract State Machines with Answer Set Programming -- Characterizing Provability in BI's Pointer Logic Through Resource Graphs -- A Unified Memory Model for Pointers -- Treewidth in Verification: Local vs. Global -- Pushdown Module Checking -- Functional Correctness Proofs of Encryption Algorithms -- Towards Automated Proof Support for Probabilistic Distributed Systems -- Algebraic Intruder Deductions -- Satisfiability Checking for PC(ID) -- Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning -- Another Complete Local Search Method for SAT -- Inference from Controversial Arguments -- Programming Cognitive Agents in Defeasible Logic -- The Relationship Between Reasoning About Privacy and Default Logics -- Comparative Similarity, Tree Automata, and Diophantine Equations -- Analytic Tableaux for KLM Preferential and Cumulative Logics -- Bounding Resource Consumption with Gödel-Dummett Logics -- On Interpolation in Existence Logics -- Incremental Integrity Checking: Limitations and Possibilities -- Concepts of Automata Construction from LTL.
650 0 _aSoftware engineering.
_94138
650 0 _aArtificial intelligence.
_93407
650 0 _aComputer programming.
_94169
650 0 _aComputer science.
_99832
650 0 _aMachine theory.
_9153512
650 1 4 _aSoftware Engineering.
_94138
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aProgramming Techniques.
_9153513
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aFormal Languages and Automata Theory.
_9153514
700 1 _aSutcliffe, Geoff.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9153515
700 1 _aVoronkov, Andrei.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9153516
710 2 _aSpringerLink (Online service)
_9153517
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540305538
776 0 8 _iPrinted edition:
_z9783540818182
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v3835
_9153518
856 4 0 _uhttps://doi.org/10.1007/11591191
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94736
_d94736