|
|
|
|
LEADER |
03757nmm a2200397 u 4500 |
001 |
EB000375393 |
003 |
EBX01000000000000000228445 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
130626 ||| eng |
020 |
|
|
|a 9783540322757
|
100 |
1 |
|
|a Baader, Franz
|e [editor]
|
245 |
0 |
0 |
|a Logic for Programming, Artificial Intelligence, and Reasoning
|h Elektronische Ressource
|b 11th International Workshop, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings
|c edited by Franz Baader, Andrei Voronkov
|
250 |
|
|
|a 1st ed. 2005
|
260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2005, 2005
|
300 |
|
|
|a XII, 560 p
|b online resource
|
505 |
0 |
|
|a 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 --
|
505 |
0 |
|
|a CERES 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 --
|
505 |
0 |
|
|a 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
|
653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
653 |
|
|
|a Software engineering
|
653 |
|
|
|a Programming Techniques
|
653 |
|
|
|a Computer science
|
653 |
|
|
|a Computer programming
|
653 |
|
|
|a Artificial Intelligence
|
653 |
|
|
|a Software Engineering
|
653 |
|
|
|a Formal Languages and Automata Theory
|
653 |
|
|
|a Machine theory
|
653 |
|
|
|a Artificial intelligence
|
700 |
1 |
|
|a Voronkov, Andrei
|e [editor]
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
490 |
0 |
|
|a Lecture Notes in Artificial Intelligence
|
028 |
5 |
0 |
|a 10.1007/b106931
|
856 |
4 |
0 |
|u https://doi.org/10.1007/b106931?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 005.1
|