Nonmonotonic reasoning: From complexity to algorithms
From MaRDI portal
Publication:1267768
DOI10.1023/A:1018939502485zbMath0905.68142MaRDI QIDQ1267768
Marie-Christine Lagasquie-Schiex, Thomas Schiex, Claudette Cayrol
Publication date: 11 January 1999
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Logic in artificial intelligence (68T27)
Related Items (17)
Using OBDDs to handle dynamic constraints ⋮ Updating action domain descriptions ⋮ Nonmonotonic reasoning, conditional objects and possibility theory ⋮ Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases ⋮ Solving conflicts in information merging by a flexible interpretation of atomic propositions ⋮ Reasoning with Uncertain and Inconsistent OWL Ontologies ⋮ Twenty-Five Years of Preferred Subtheories ⋮ New tractable classes for default reasoning from conditional knowledge bases ⋮ Reasoning under inconsistency: a forgetting-based approach ⋮ Consistency restoration and explanations in dynamic CSPs---Application to configuration ⋮ MCS Extraction with Sublinear Oracle Queries ⋮ Approximate coherence-based reasoning ⋮ Complexity and Cautiousness Results for Reasoning from Partially Preordered Belief Bases ⋮ On the complexity of inconsistency measurement ⋮ Exact Multiple Sequence Alignment by Synchronized Decision Diagrams ⋮ Default reasoning from conditional knowledge bases: Complexity and tractable cases ⋮ Compiling propositional weighted bases
This page was built for publication: Nonmonotonic reasoning: From complexity to algorithms
