Access the full text.
Sign up today, get DeepDyve free for 14 days.
Thomas Eiter, G. Gottlob, H. Veith (1997)
Modular Logic Programming and Generalized Quantifiers
Marco Cadoli, Thomas Eiter, G. Gottlob (1992)
An Efficient Method for Eliminating Varying Predicates from a CircumscriptionArtif. Intell., 54
R. Reiter (1986)
A Theory of Diagnosis from First PrinciplesArtif. Intell., 32
Adnan Darwiche, P. Marquis (2002)
A Knowledge Compilation MapJ. Artif. Intell. Res., 17
(2002)
Received July
T. Costello (1997)
Change, Change, Change: Three Approaches
E. Dantsin, Thomas Eiter, G. Gottlob, A. Voronkov (1997)
Complexity and expressive power of logic programmingProceedings of Computational Complexity. Twelfth Annual IEEE Conference
Marco Cadoli, M. Lenzerini (1994)
The Complexity of Propositional Closed World Reasoning and CircumscriptionJ. Comput. Syst. Sci., 48
M. Minoux (1988)
LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer ImplementationInf. Process. Lett., 29
David Johnson (1991)
A Catalog of Complexity Classes
N. Immerman (1986)
Relational Queries Computable in Polynomial TimeInf. Control., 68
J. Kleer, K. Konolige (1989)
Eliminating the Fixed Predicates from a CircumscriptionArtif. Intell., 39
Marco Cadoli, F. Donini, P. Liberatore, M. Schaerf (2002)
Preprocessing of Intractable ProblemsInf. Comput., 176
Chitta Baral, Alfredo Gabaldon, A. Provetti (1996)
Value Minimization in Circumscription
(2005)
ACM Transactions on Computational Logic
J. McCarthy (1987)
Applications of Circumscription to Formalizing Common Sense KnowledgeArtif. Intell., 28
E. Remolina, B. Kuipers (2001)
A Logical Account of Causal and Topological Maps
J. Gustafsson (1996)
An Implementation and Optimization of an Algorithm for Reducing Formulae in Second-Order Logic
Marco Cadoli, F. Donini, P. Liberatore, M. Schaerf (2000)
Space Efficiency of Propositional Knowledge Representation FormalismsArXiv, abs/1106.0233
Joseena Sierra-Santib, A~ Nez (1998)
Declarative Formalization of Strategies for Action Selection
Adnan Darwiche (2001)
Decomposable negation normal formJ. ACM, 48
E. Sandewall (1989)
Filter Preferential Entailment for the Logic of Action in Almost Continuous Worlds
V. Lifschitz (1995)
Nested Abnormality TheoriesArtif. Intell., 74
Thomas Eiter, G. Gottlob (2000)
On the Complexity of Theory Curbing
L. Fortnow, Steven Homer (2018)
Computational Complexity
Chitta Baral, V. Kreinovich, Raul Trejo (1999)
Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness
Thomas Eiter, Wolfgang Faber, N. Leone, G. Pfeifer (2000)
Declarative problem-solving using the DLV system
J. McCarthy (1995)
Circumscription: a form of non-monotonic reasoning
Y. Gurevich, S. Shelah (1985)
Fixed-point extensions of first-order logic26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
J. Rintanen (1999)
Improvements to the Evaluation of Quantified Boolean Formulae
Marco Cadoli, M. Schaerf, A. Giovanardi, Massimo Giovanardi (2002)
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental EvaluationJournal of Automated Reasoning, 28
Thomas Eiter, Wolfgang Faber, Christoph Koch, N. Leone, G. Pfeifer (2000)
DLV - A System for Declarative Problem SolvingArXiv, cs.AI/0003036
E. Giunchiglia, V. Lifschitz (1997)
Representing Action: Indeterminacy and RamificationsArtif. Intell., 95
G. Kartha, V. Lifschitz (1995)
A Simple Formalization of Actions Using Circumscription
Thomas Eiter, G. Gottlob (1993)
Propositional circumscription and extended closed-world reasoning are ΠP2-completeTheoretical Computer Science, 118
S. Abiteboul, V. Vianu (1989)
Fixpoint extensions of first-order logic and datalog-like languages[1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science
V. Lifschitz (1985)
Computing Circumscription
Chitta Baral (2000)
Abductive reasoning through filteringArtif. Intell., 120
Goran Gogic, Henry Kautz, C. Papadimitriou, B. Selman (1995)
The Comparative Linguistics of Knowledge Representation
(1996)
DLV homepage
Note that this method is related to constructing the Horn CNFs ψ(B) and ϕ(B) for a Horn block B without fixed letters in the proof of Theorem 5
Rainer Feldmann, B. Monien, Stefan Schamberger (2000)
A Distributed Algorithm to Evaluate Quantified Boolean Formulae
Marco Cadoli, L. Palopoli (1998)
Circumscribing DATALOG: Expressive Power and ComplexityTheor. Comput. Sci., 193
P. Doherty, W. Lukaszewicz, A. Szałas (1997)
Computing Circumscription Revisited: A Reduction AlgorithmJournal of Automated Reasoning, 18
J. Schlipf (1987)
Decidability and definability with circumscriptionAnn. Pure Appl. Log., 35
Thomas Eiter, G. Gottlob, Y. Gurevich (1993)
Curb Your Theory! A Circumspective Approach for Inclusive Interpretation of Disjunctive Information
B. Selman, Henry Kautz (1996)
Knowledge compilation and theory approximationJ. ACM, 43
Charlotte-V. Pollet, J. Remmel (1997)
Non-Monotonic Reasoning with Quantified Boolean Constraints
Z. Su (1995)
Automating the Computation of Nested Abnormality Theories
K. Wagner (1990)
Bounded Query ClassesSIAM J. Comput., 19
F. Verdenius, M. Someren (1997)
Applications of Inductive Learning Techniques: A Survey in the NetherlandsAI Commun., 10
G. Kartha (2001)
A Circumscriptive Formalization of the Qualification Problem
Thomas Eiter, G. Gottlob (1993)
Propositional Circumscription and Extended Closed-World Reasoning are IIp2-CompleteTheor. Comput. Sci., 114
G. Kartha, V. Lifschitz (1994)
Actions with Indirect Effects (Preliminary Report)
Tran Son, Chitta Baral (2001)
Formalizing sensing actions A transition function based approachArtif. Intell., 125
Marco Cadoli, F. Donini (1997)
A Survey on Knowledge CompilationAI Commun., 10
Chitta Baral, Alfredo Gabaldon, A. Provetti (1996)
Formalizing Narratives Using Nested Circumscription
Circumscription has been recognized as an important principle for knowledge representation and common-sense reasoning. The need for a circumscriptive formalism that allows for simple yet elegant modular problem representation has led Lifschitz (AIJ, 1995) to introduce nested abnormality theories (NATs) as a tool for modular knowledge representation, tailored for applying circumscription to minimize exceptional circumstances. Abstracting from this particular objective, we propose L CIRC , which is an extension of generic propositional circumscription by allowing propositional combinations and nesting of circumscriptive theories. As shown, NATs are naturally embedded into this language, and are in fact of equal expressive capability. We then analyze the complexity of L CIRC and NATs, and in particular the effect of nesting. The latter is found to be a source of complexity, which climbs the Polynomial Hierarchy as the nesting depth increases and reaches PSPACE-completeness in the general case. We also identify meaningful syntactic fragments of NATs which have lower complexity. In particular, we show that the generalization of Horn circumscription in the NAT framework remains coNP-complete, and that Horn NATs without fixed letters can be efficiently transformed into an equivalent Horn CNF, which implies polynomial solvability of principal reasoning tasks. Finally, we also study extensions of NATs and briefly address the complexity in the first-order case. Our results give insight into the “cost” of using L CIRC (respectively, NATs) as a host language for expressing other formalisms such as action theories, narratives, or spatial theories.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Apr 1, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.