Logics in Artificial Intelligence: European Conference, JELIA 2002, Cosenza, Italy, September, 23-26, Proceedings: Lecture Notes in Computer Science, cartea 2424
Editat de Sergio Flesca, Giovambattista Iannien Limba Engleză Paperback – 11 sep 2002
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 15% Preț: 580.46 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 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ț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 659.83 lei
Preț vechi: 824.79 lei
-20% Nou
Puncte Express: 990
Preț estimativ în valută:
126.27€ • 130.46$ • 105.03£
126.27€ • 130.46$ • 105.03£
Carte tipărită la comandă
Livrare economică 20 martie-03 aprilie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540441908
ISBN-10: 3540441905
Pagini: 588
Ilustrații: XIII, 567 p.
Dimensiuni: 155 x 235 x 31 mm
Greutate: 0.81 kg
Ediția:2002
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: 3540441905
Pagini: 588
Ilustrații: XIII, 567 p.
Dimensiuni: 155 x 235 x 31 mm
Greutate: 0.81 kg
Ediția:2002
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
Multi-agent Systems.- A Logic Programming Language for Multi-agent Systems.- A Proof-System for the Safe Execution of Tasks in Multi-agent Systems.- An Argumentation Framework for Merging Conflicting Knowledge Bases.- Multi-agent Logics of Dynamic Belief and Knowledge.- Evolution and Changes.- Evolving Logic Programs.- A Compilation of Updates plus Preferences.- Description Logic and Semantic Web.- Towards Service Description Logics.- P- (D): A Probabilistic Extension of (D) for Probabilistic Ontologies in the Semantic Web.- A Temporal Description Logic for Reasoning over Conceptual Schemas and Queries.- Complexity Issues.- Polynomial-Length Planning Spans the Polynomial Hierarchy.- Complexity of Multi-agent Systems Behavior.- Complexity and Algorithms for the Matching of Bag and Set Terms.- Probabilistic Logic.- Non-commutativity and Expressive Deductive Logic Databases.- Using Institutions for the Study of Qualitative and Quantitative Conditional Logics.- Planning.- Theoretical and Empirical Aspects of a Planner in a Multi-agent Environment.- Answer Set Planning under Action Costs.- Modal Logic and Causal Reasoning.- On Fibring Semantics for BDI Logics.- A Modal Formulation of McCain and Turner’s Theory of Causal Reasoning.- Second-Order Quantifier Elimination in Modal Contexts.- Theory.- Interpolation Theorems for Nonmonotonic Reasoning Systems.- Minimal Answer Computation and SOL.- Decidability of Interval Temporal Logics over Split-Frames via Granularity.- Reasoning under Uncertainty.- Uncertainty and Partial Non-uniform Assumptions in Parametric Deductive Databases.- A Qualitative Reasoning with Nuanced Information.- Satisfiability.- Dependent and Independent Variables in Propositional Satisfiability.- A DPLL-Based Calculus for Ground SatisfiabilityModulo Theories.- Paraconsistent Reasoning.- Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems.- Three-Valued Logics for Inconsistency Handling.- Paraconsistent Logic Programs.- Actions and Causation.- Interpolation Properties of Action Logic: Lazy-Formalization to the Frame Problem.- Reasoning about Actions in Prioritized Default Theory.- Towards a Conditional Logic of Actions and Causation.- Logics for Agents.- Axiomatising Nash-Consistent Coalition Logic.- Representing Possibilities in Relation to Constraints and Agents.- An Abductive Logic Programming Architecture for Negotiating Agents.- Semantics.- Preferred Answer Sets for Ordered Logic Programs.- Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs.- An Infinite-Valued Semantics for Logic Programs with Negation.- Optimization Issues in Answer Set Semantics.- More on noMoRe.- Answer Set Programming by Ant Colony Optimization.- Testing the Equivalence of Logic Programs under Stable Model Semantics.- System Session.- Argumentative Reasoning with ABEL.- COBA: A Consistency-Based Belief Revision System.- Constraint Lingo: A Program for Solving Logic Puzzles and Other Tabular Constraint Problems.- : Integrating Data Mining with Intelligent Query Answering.- NoMoRe: Non-monotonic Reasoning with Logic Programs.- Process Miner — A Tool for Mining Process Schemes from Event-Based Data.- SMILES: A Multi-purpose Learning System.- The aspps System.- The DLV System.- The DLVK Planning System: Progress Report.- Z-log: Applying System-Z.- Invited Talks.- Hypergraph Transversal Computation and Related Problems in Logic and AI.- Alternation.- The USA-Advisor: A Case Study in Answer Set Programming.
Caracteristici
Includes supplementary material: sn.pub/extras