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 Voronkoven Limba Engleză Paperback – 7 mar 2005
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 341.95 lei
- 20% Preț: 369.12 lei
- 20% Preț: 645.28 lei
- 20% Preț: 591.51 lei
- 15% Preț: 580.46 lei
- Preț: 410.88 lei
- 20% Preț: 504.57 lei
- Preț: 381.21 lei
- 20% Preț: 340.32 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 538.29 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 238.01 lei
- 17% Preț: 360.19 lei
- 20% Preț: 438.69 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 596.46 lei
- 15% Preț: 438.59 lei
- 20% Preț: 655.02 lei
- 20% Preț: 649.49 lei
- 20% Preț: 309.90 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 310.26 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 326.98 lei
- 20% Preț: 825.93 lei
- 17% Preț: 427.22 lei
- 20% Preț: 763.23 lei
- 20% Preț: 350.21 lei
- 20% Preț: 307.71 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 20% Preț: 343.62 lei
- 20% Preț: 583.40 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 353.50 lei
- 20% Preț: 607.39 lei
Preț: 620.75 lei
Preț vechi: 775.94 lei
-20% Nou
Puncte Express: 931
Preț estimativ în valută:
118.81€ • 123.57$ • 99.56£
118.81€ • 123.57$ • 99.56£
Carte tipărită la comandă
Livrare economică 10-15 martie
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
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ă
ResearchCuprins
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