On the complexity of theory curbing

Authors:
Thomas Eiter;Georg Gottlob
Affiliations:
Institut für Informationssysteme, TU Wien, Wien, Austria;Institut für Informationssysteme, TU Wien, Wien, Austria
Venue:
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Year:
2000

Citing 15
Cited 2

Inferring negative information from disjunctive databases

Journal of Automated Reasoning
The complexity of model checking for circumscriptive formulae

Information Processing Letters
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete

Theoretical Computer Science
Negation in disjunctive logic programs

ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Circumscription

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Resolution for quantified Boolean formulas

Information and Computation
How many minimal upper bounds of minimal upper bounds

Computing
An algorithm to evaluate quantified Boolean formulae

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
The complexity of belief update

Artificial Intelligence
A Possible World Semantics for Disjunctive Databases

IEEE Transactions on Knowledge and Data Engineering
The Complexity of Iterated Belief Revision

ICDT '97 Proceedings of the 6th International Conference on Database Theory
A Distributed Algorithm to Evaluate Quantified Boolean Formulae

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Curb your theory !: a circumscriptive approach for inclusive interpretation of disjunctive information

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Improvements to the evaluation of quantified boolean formulae

IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Computing circumscription

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1

Reasoning under minimal upper bounds in propositional logic

Theoretical Computer Science
Complexity of nested circumscription and abnormality theories

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality but unlike circumscription treats disjunction inclusively. In an earlier paper, theory curbing was shown to be feasible in PSPACE, but the precise complexity was left open. In the present paper we prove it to be PSPACE-complete. In particular, we show that both the model checking and the inferencing problem under curbed theories are PSPACE complete. We also study relevant cases where the complexity of theory curbing is located - just as for plain propositional circumscription - at the second level of the polynomial hierarchy and is thus presumably easier than PSPACE.