Cantitate/Preț
Produs

Logics in Artificial Intelligence: 12th European Conference, JELIA 2010, Helsinki, Finland, September 13-15, 2010, Proceedings: Lecture Notes in Computer Science, cartea 6341

Editat de Tomi Janhunen, Ilkka Niemelä
en Limba Engleză Paperback – sep 2010

Din seria Lecture Notes in Computer Science

Preț: 33816 lei

Preț vechi: 42270 lei
-20% Nou

Puncte Express: 507

Preț estimativ în valută:
6472 6732$ 5424£

Carte disponibilă

Livrare economică 20 februarie-06 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642156748
ISBN-10: 3642156746
Pagini: 374
Ilustrații: XIV, 374 p. 48 illus.
Greutate: 0.58 kg
Ediția:2010
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

Invited Talks.- Nonmonotonic Tools for Argumentation.- Relax, Compensate and Then Recover: A Theory of Anytime, Approximate Inference.- Counter Systems for Data Logics.- Regular Papers.- Similarity-Based Inconsistency-Tolerant Logics.- Decomposition of Distributed Nonmonotonic Multi-Context Systems.- Bridging Possibilistic Conditional Knowledge Bases and Partially Ordered Bases.- A Decidable Constructive Description Logic.- A Normal Form for Linear Temporal Equilibrium Logic.- Rational Closure for Defeasible Description Logics.- Extensional Higher-Order Logic Programming.- dl2asp: Implementing Default Logic via Answer Set Programming.- Sets of Boolean Connectives That Make Argumentation Easier.- Retroactive Subsumption-Based Tabled Evaluation of Logic Programs.- Preference-Based Inconsistency Assessment in Multi-Context Systems.- A Logical Semantics for Description Logic Programs.- An Incremental Answer Set Programming Based System for Finite ModelComputation.- Parametrized Logic Programming.- Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription.- : A Context Description Logic.- Stable Belief Sets Revisited.- Efficient Inferencing for OWL EL.- Translating First-Order Causal Theories into Answer Set Programming.- Preprocessing Boolean Formulae for BDDs in a Probabilistic Context.- Minimal Knowledge and Belief via Minimal Topology.- A Logical Account of Lying.- Tabling with Answer Subsumption: Implementation, Applications and Performance.- Embracing Events in Causal Modelling: Interventions and Counterfactuals in CP-Logic.- An Approximative Inference Method for Solving ???SO Satisfiability Problems.- Horn Contraction via Epistemic Entrenchment.- System Descriptions.- The DMCS Solver for Distributed Nonmonotonic Multi-ContextSystems.- The mcs-ie System for Explaining Inconsistency in Multi-Context Systems.- Coala: A Compiler from Action Languages to ASP.- DLV MC : Enhanced Model Checking in DLV.- A Dynamic-Programming Based ASP-Solver.