Cantitate/Preț
Produs

Logic for Programming, Artificial Intelligence, and Reasoning: 11th International Workshop, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings: Lecture Notes in Computer Science, cartea 3452

Editat de Franz Baader, Andrei Voronkov
en Limba Engleză Paperback – 7 mar 2005

Din seria Lecture Notes in Computer Science

Preț: 62075 lei

Preț vechi: 77594 lei
-20% Nou

Puncte Express: 931

Preț estimativ în valută:
11880 12340$ 9868£

Carte tipărită la comandă

Livrare economică 29 ianuarie-04 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540252368
ISBN-10: 3540252363
Pagini: 580
Ilustrații: XII, 560 p.
Dimensiuni: 155 x 235 x 35 mm
Greutate: 0.8 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.- 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.

Caracteristici

Includes supplementary material: sn.pub/extras