Nonmonotonic reasoning: logical foundations of common sense
Nonmonotonic reasoning: logical foundations of common sense
What the lottery paradox tells us about default reasoning
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Cumulative default logic: in defense of nonmonotonic inference rules
Artificial Intelligence
Rational default logic and disjunctive logic programming
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Cumulative default logic: finite characterization, algorithms, and complexity
Artificial Intelligence
Introduction to Default Logic
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
ACM Computing Surveys (CSUR)
Splitting Finite Default Theories: A Comparison of Two Approaches
Journal of Logic, Language and Information
A tutorial on default reasoning
The Knowledge Engineering Review
The complexity of model checking for propositional default logics
Data & Knowledge Engineering
On the complexity of extension checking in default logic
Information Processing Letters
Where fail-safe default logics fail
ACM Transactions on Computational Logic (TOCL)
Redundancy in logic III: Non-monotonic reasoning
Artificial Intelligence
On the complexity of extension checking in default logic
Information Processing Letters
A comparison of two approaches to splitting default theories
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Sequential thresholds: context sensitive default extensions
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
| Hi-index | 0.00 |
In this paper we consider constrained and rational default logics We provide two characterizations of constrained extensions One of them is used to derive complexity results for decision problems involving constrained extensions In particular, we show that the problem of membership of a formula in at least one (in all) constrained extension(s) of a default theory is Ef-complete (Ilf-complete) We establish the relationship between constrained and rational default logics We prove that rational extensions determine constrained extensions and that for seminormal default theories there is A one-to-one correspondence between these objects We also show that the definition of a constrained extension can be extended to cover the case of default theories which may contain justification-free defaults.