Saturation, nonmonotonic reasoning and the closed-world assumption
Artificial Intelligence
Minimal representation of directed hypergraphs
SIAM Journal on Computing
A logical framework for default reasoning
Artificial Intelligence
The complexity of facets resolved
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Eliminating the fixed predicates from a circumscription
Artificial Intelligence
General theory of cumulative inference
Proceedings of the 2nd international workshop on Non-monotonic reasoning
On constrained default theories
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Removing redundancy from a clause
Artificial Intelligence
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
Optimal compression of propositional Horn knowledge bases: complexity and approximation
Artificial Intelligence
Artificial Intelligence
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Alternative approaches to default logic
Artificial Intelligence
Translating default logic into standard autoepistemic logic
Journal of the ACM (JACM)
Minimum Covers in Relational Database Model
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Introduction to Default Logic
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
Theoretical Computer Science
A Framework for Default Logics
JELIA '92 Proceedings of the European Workshop on Logics in AI
Model Checking for Nonmonotonic Logics: Algorithms and Complexity
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Evaluating the effect of semi-normality on the expressiveness of defaults
Artificial Intelligence
The Minimization Problem for Boolean Formulas
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The Minimum Equivalent DNF Problem and Shortest Implicants
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Approximating minimal unsatisfiable subformulae by means of adaptive core search
Discrete Applied Mathematics - The renesse issue on satisfiability
An Algebraic Approach to the Complexity of Propositional Circumscription
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Extension and Equivalence Problems for Clause Minimal Formulae
Annals of Mathematics and Artificial Intelligence
On the complexity of extension checking in default logic
Information Processing Letters
Expressing Default Logic Variants in Default Logic
Journal of Logic and Computation
Redundancy in logic I: CNF propositional formulae
Artificial Intelligence
Where fail-safe default logics fail
ACM Transactions on Computational Logic (TOCL)
Strong and uniform equivalence of nonmonotonic theories: an algebraic approach
Annals of Mathematics and Artificial Intelligence
Redundancy in logic II: 2CNF and Horn propositional formulae
Artificial Intelligence
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Constrained and rational default logics
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Detecting redundant production rules
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Removing Redundancy from Answer Set Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
| Hi-index | 0.01 |
Results about the redundancy of certain versions of circumscription and default logic are presented. In particular, propositional circumscription where all variables are minimized and skeptical default logics are considered. This restricted version of circumscription is shown to have the unitary redundancy property: a CNF formula is redundant (it is equivalent to one of its proper subsets) if and only if it contains a redundant clause (it is equivalent to itself minus one clause); default logic does not have this property in general. We also give the complexity of checking redundancy in the considered formalisms.