The size of a revised knowledge base

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The size of a revised knowledge base

Full text

Pdf (1.15 MB)

Source

Symposium on Principles of Database Systems archive
Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents

San Jose, California, United States

Pages: 151 - 162

Year of Publication: 1995

ISBN:0-89791-730-8

Authors

Marco Cadoli	Dipartimento di Informatica e Sistemistica, Università di Roma 'La Sapienza', via Salaria 113, I-00198, Roma, Italy
Francesco M. Donini	Dipartimento di Informatica e Sistemistica, Università di Roma 'La Sapienza', via Salaria 113, I-00198, Roma, Italy
Paolo Liberatore	Dipartimento di Informatica e Sistemistica, Università di Roma 'La Sapienza', via Salaria 113, I-00198, Roma, Italy
Marco Schaerf	Dipartimento di Informatica e Sistemistica, Università di Roma 'La Sapienza', via Salaria 113, I-00198, Roma, Italy

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 18, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/212433.220205 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Bor85	Alexander Borgida, Language features for flexible handling of exceptions in information systems, ACM Transactions on Database Systems (TODS), v.10 n.4, p.565-603, Dec. 1985 [doi>10.1145/4879.4995]
	Dal88	M. Dalai. Investigations into a theory of knowledge base revision: Preliminary report. In Proc. of the 7th Nat. Con}. on Artificial Intelligence (AAAI- 88), pages 475-4?9, 1988.
	EG92	Thomas Eiter , Georg Gottlob, On the complexity of propositional knowledge base revision, updates, and counterfactuals, Artificial Intelligence, v.57 n.2-3, p.227-270, Oct. 1992 [doi>10.1016/0004-3702(92)90018-S]
	FHV83	Ronald Fagin , Jeffrey D. Ullman , Moshe Y. Vardi, On the semantics of updates in databases, Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems, March 21-23, 1983, Atlanta, Georgia [doi>10.1145/588058.588100]
	For89	K.D. Forbus. introducing actions into qualitative simulation. In Proc. o.f the 11th Int. Joint Conf. on Artificial Intelligence (IJCAI-89), pages 1273- 1278, 1989.
	Gin86	M I Ginsberg , M L Ginsberg, Counterfactuals, Artificial Intelligence, v.30 n.1, p.35-80, Oct. 1986 [doi>10.1016/0004-3702(86)90067-6]
	Joh90	David S. Johnson, A catalog of complexity classes, Handbook of theoretical computer science (vol. A): algorithms and complexity, MIT Press, Cambridge, MA, 1991
	KL80	Richard M. Karp , Richard J. Lipton, Some connections between nonuniform and uniform complexity classes, Proceedings of the twelfth annual ACM symposium on Theory of computing, p.302-309, April 28-30, 1980, Los Angeles, California, United States [doi>10.1145/800141.804678]
	KM91	H. Katsuno and A. Mendelzon. On the difference between updating a knowledge base and revising it. In Proc. of the #nd Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR. 91}, pages 387-394, 1991.
	Neb91	B. Nebel. Belief revision and default reasorfing: Syntax-based approaches. In Proc. of the $nd Int. Conf. on the Principles o.f Knowledge Representation and Reasoning (KR-91), pages 417-428, 1991.
	Neb94	B. Nebel. Base revision operations and schemes: Semantics, representation and complexity. In Proc. of the 11th European Conf. on Artificial Intelligence (ECAI-9#), pages 341-345, 1994.
	Sat88	K. Satoh. Nonmonotonic reasoning by minimal belief revision, in Proc. of the Int. Conf. on Fifth Generation Computer Systems (FGCS-88}, pages 455-462, 1988.
	Web86	A. Weber. Updating propositional formulas. In Proc. of First Conf. on Ezpert Database Systems, pages 487-500, 1986.
	Win90	Marianne Winslett, Updating logical databases, Cambridge University Press, New York, NY, 1991
	Yap83	C.K. Yap. Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science, 26:287-300, 1983.

CITED BY 5

	Paolo Liberatore, Monotonic reductions, representative equivalence, and compilation of intractable problems, Journal of the ACM (JACM), v.48 n.6, p.1091-1125, November 2001
	Jürgen Dix , Ulrich Furbach , Ilkka Niemelä, Nonmonotonic reasoning: towards efficient calculi and implementations, Handbook of automated reasoning, Elsevier Science Publishers B. V., Amsterdam, The Netherlands, 2001
	Marco Cadoli , Francesco M. Donini, A survey on knowledge compilation, AI Communications, v.10 n.3,4, p.137-150, December 1997
	James Delgrande , Yi Jin , Francis Jeffry Pelletier, Compositional belief update, Journal of Artificial Intelligence Research, v.32 n.1, p.757-791, May 2008
	Paolo Liberatore , Marco Schaerf, Relating belief revision and circumscription, Proceedings of the 14th international joint conference on Artificial intelligence, p.1557-1563, August 20-25, 1995, Montreal, Quebec, Canada