Negation by default and unstratifiable logic programs
Selected papers of the workshop on Deductive database theory
Extended logic programs as autoepistemic theories
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Minimal knowledge problem: a new approach
Artificial Intelligence
Minimal belief and negation as failure
Artificial Intelligence
Nonmonotonic Logic II: Nonmonotonic Modal Theories
Journal of the ACM (JACM)
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
The Logic of Objective Knowledge and Rational Belief
JELIA '90 Proceedings of the European Workshop on Logics in AI
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Strong equivalence made easy: nested expressions and weight constraints
Theory and Practice of Logic Programming
Epistemic semantics for fixed-points non-monotonic logics
TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
Semantical characterizations and complexity of equivalences in answer set programming
ACM Transactions on Computational Logic (TOCL)
From answer set logic programming to circumscription via logic of GK
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Logic programming for knowledge representation
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Annals of Mathematics and Artificial Intelligence
Minimal knowledge and belief via minimal topology
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
| Hi-index | 0.00 |
The modal logic S4F provides an account for the default logic of Reiter, and several modal nonmonotonic logics of knowledge and belief. In this paper we focus on a fragment of the logic S4F concerned with modal formulas called modal defaults, and on sets of modal defaults -- modal default theories. We present characterizations of S4F-expansions of modal default theories, and show that strong and uniform equivalence of modal default theories can be expressed in terms of the logical equivalence in the logic S4F. We argue that the logic S4F can be viewed as the general default logic of nested defaults. We also study special modal default theories called modal programs, and show that this fragment of the logic S4F generalizes the logic here-and-there.