Complexity of propositional nested circumscription and nested abnormality theories

Full Text:

Pdf

Buy this Article

Authors:	Marco Cadoli	Università di Roma “La Sapienza”, Roma, Italy
	Thomas Eiter	Technische Universität Wien, Wien, Austria
	Georg Gottlob	Technische Universität Wien, Wien, Austria

Published in:

· Journal

ACM Transactions on Computational Logic (TOCL) TOCL Homepage archive

Volume 6 Issue 2, April 2005
ACM New York, NY, USA
table of contents doi>10.1145/1055686.1055688

	2005 Article
Bibliometrics
· Downloads (6 Weeks): 0 · Downloads (12 Months): 15 · Citation Count: 1

Tools and Resources

Tags: algorithms circumscription computational complexity computational logic horn theories knowledge representation and reasoning languages nested abnormality theories nonmonotonic reasoning nonmonotonic reasoning and belief revision nonnumerical algorithms and problems theory