000 04652nam a22005895i 4500
001 978-3-540-32275-7
003 DE-He213
005 20240730192203.0
007 cr nn 008mamaa
008 101221s2005 gw | s |||| 0|eng d
020 _a9783540322757
_9978-3-540-32275-7
024 7 _a10.1007/b106931
_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] :
_b11th International Workshop, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings /
_cedited by Franz Baader, Andrei Voronkov.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aXII, 560 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 ;
_v3452
505 0 _aCERES in Many-Valued Logics -- A Decomposition Rule for Decision Procedures by Resolution-Based Calculi -- Abstract DPLL and Abstract DPLL Modulo Theories -- Combining Lists with Non-stably Infinite Theories -- Abstract Model Generation for Preprocessing Clause Sets -- Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying -- Applications of General Exact Satisfiability in Propositional Logic Modelling -- BCiC: A System for Code Authentication and Verification -- Ordered Resolution with Selection for -- On a Semantic Subsumption Test -- Suitable Graphs for Answer Set Programming -- Weighted Answer Sets and Applications in Intelligence Analysis -- How to Fix It: Using Fixpoints in Different Contexts -- Reasoning About Systems with Transition Fairness -- Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games -- How the Location of * Influences Complexity in Kleene Algebra with Tests -- The Equational Theory of ??, 0, 1,?+?, ×, ?? Is Decidable, but Not Finitely Axiomatisable -- A Trichotomy in the Complexity of Propositional Circumscription -- Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems -- Evaluating QBFs via Symbolic Skolemization -- The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs -- Automated Termination Analysis for Incompletely Defined Programs -- Automatic Certification of Heap Consumption -- A Formalization of Off-Line Guessing for Security Protocol Analysis -- Abstraction-Carrying Code -- A Verification Environment for Sequential Imperative Programs in Isabelle/HOL -- Can a Higher-Order and a First-Order Theorem Prover Cooperate? -- A Generic Framework for Interprocedural Analyses of NumericalProperties -- Second-Order Matching via Explicit Substitutions -- Knowledge-Based Synthesis of Distributed Systems Using Event Structures -- The Inverse Method for the Logic of Bunched Implications -- Cut-Elimination: Experiments with CERES -- Uniform Rules and Dialogue Games for Fuzzy Logics -- Nonmonotonic Description Logic Programs: Implementation and Experiments -- Implementing Efficient Resource Management for Linear Logic Programming -- Layered Clausal Resolution in the Multi-modal Logic of Beliefs and Goals.
650 0 _aSoftware engineering.
_94138
650 0 _aArtificial intelligence.
_93407
650 0 _aMachine theory.
_9148926
650 0 _aComputer science.
_99832
650 0 _aComputer programming.
_94169
650 1 4 _aSoftware Engineering.
_94138
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aFormal Languages and Automata Theory.
_9148927
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aProgramming Techniques.
_9148928
700 1 _aBaader, Franz.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9148929
700 1 _aVoronkov, Andrei.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9148930
710 2 _aSpringerLink (Online service)
_9148931
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540252368
776 0 8 _iPrinted edition:
_z9783540808701
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v3452
_9148932
856 4 0 _uhttps://doi.org/10.1007/b106931
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c94116
_d94116