Artificial Intelligence
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Introduction to algorithms
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Hard problems for simple default logics
Artificial Intelligence - Special issue on knowledge representation
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Inconsistency in possibilistic knowledge bases: to live with it or not live with it
Fuzzy logic for the management of uncertainty
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Nonmonotonic inference based on expectations
Artificial Intelligence
Incremental recompilation of knowledge (extended abstract)
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Management of Preferences in Assumption-Based Reasoning
IPMU '92 Proceedings of the 4th International Conference on Processing and Management of Uncertainty in Knowledge-Based Systems: Advanced Methods in Artificial Intelligence
The Complexity of Logic-Based Abduction
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Non-monotonic Syntax-Based Entailment: A Classification of Consequence Relations
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Solving Over-Constrained CSPs Using Weighted OBDDs
Over-Constrained Systems
Consistency restoriation and explanations in dynamic CSPs----application to configuration
Artificial Intelligence
New Tractable Cases in Default Reasoning from Conditional Knowledge Bases
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
On Anytime Coherence-Based Reasoning
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Resource-Bounded Paraconsistent Inference
Annals of Mathematics and Artificial Intelligence
Logical Preference Representation and Combinatorial Vote
Annals of Mathematics and Artificial Intelligence
On Stratified Belief Base Compilation
Annals of Mathematics and Artificial Intelligence
Compiling propositional weighted bases
Artificial Intelligence - Special issue on nonmonotonic reasoning
New tractable classes for default reasoning from conditional knowledge bases
Annals of Mathematics and Artificial Intelligence
An unbiased approach to iterated fusion by weakening
Information Fusion
Compiling the Lexicographic Inference Using Boolean Cardinality Constraints
Canadian AI '09 Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence
Complexity and Cautiousness Results for Reasoning from Partially Preordered Belief Bases
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Resource-bounded inference from inconsistent belief bases
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Reasoning under inconsistency: the forgotten connective
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reasoning under inconsistency: A forgetting-based approach
Artificial Intelligence
Updating action domain descriptions
Artificial Intelligence
Solving conflicts in information merging by a flexible interpretation of atomic propositions
Artificial Intelligence
Representing paraconsistent reasoning via quantified propositional logic
Inconsistency Tolerance
On the complexity of paraconsistent inference relations
Inconsistency Tolerance
Hi-index | 0.00 |
The purpose of this paper is to outline various results regarding the computational complexity and the algorithms of nonmonotonic entailment in different coherence‐based approaches. Starting from a (non necessarily consistent) belief base E and a pre‐order on E, we first present different mechanisms for selecting preferred consistent subsets. Then we present different entailment principles in order to manage these multiple subsets. The crossing point of each generation mechanism m and each entailment principle p defines an entailment relation (E,\leq)\mathrel{\mid\!\sim\,}^{p,m}\Phi which we study from the computational complexity point of view. The results are not very encouraging since the complexity of all these nonmonotonic entailment relations is, in most restricted languages, larger than the complexity of monotonic entailment. So, we decided to extend Binary Decision Diagrams technics, which are well suited to the task of solving NP‐hard logic‐based problems. Both theoretical and experimental results are described along this line in the last sections.