Size of a revised knowledge base

Artificial Intelligence

Volumn 115, Issue 1, 1999, Pages 25-64

  Cadoli, Marco ^a   Donini, Francesco M ^a   Liberatore, Paolo ^a   Schaerf, Marco ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; EQUIVALENCE CLASSES; POLYNOMIALS;

BELIEF REVISION;

KNOWLEDGE BASED SYSTEMS;

EID: 0033324326     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00074-0     Document Type: Article

References (29)

1. Alchourrón C.E., Gärdenfors P., Makinson D. On the logic of theory change: Partial meet contraction and revision functions. J. Symbolic Logic. 50:1985;510-530.
2. Bancilhon F., Spyratos N. Update semantics of relational views. ACM Trans. Database Systems. 6:(4):1981;557-575.
3. Boppana R., Sipser M. The complexity of finite functions. van Leeuwen J. Handbook of Theoretical Computer Science, Vol. A. 1990;Elsevier Science (North-Holland), Amsterdam. Chapter 14.
4. Borgida A. Language features for flexible handling of exceptions in information systems. ACM Trans. Database Systems. 10:1985;563-603.
5. Cadoli M., Donini F.M., Liberatore P., Schaerf M. The size of a revised knowledge base. Proc. 14th ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS-95). 1995;151-162. Extended version available as Technical Report DIS 34-96, Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", 1996.
6. Cadoli M., Donini F.M., Schaerf M., Silvestri R. On compact representations of propositional circumscription. Theoret. Comput. Sci. 182:1997;183-202.
7. Dalal M. Investigations into a theory of knowledge base revision: Preliminary report. Proc. AAAI-88, St. Paul, MN. 1988;475-479.
8. Eiter T., Gottlob G. On the complexity of propositional knowledge base revision, updates and counterfactuals. Artificial Intelligence. 57:1992;227-270.
9. Eiter T., Gottlob G. The complexity of nested counterfactuals and iterated knowledge base revisions. J. Computer and System Sci. 53:(3):1996;497-512.
10. Fagin R., Ullman J.D., Vardi M.Y. On the semantics of updates in databases. Proc. Second ACM SIGACT SIGMOD Symposium on Principles of Database Systems (PODS-83). 1983;352-365.
11. Forbus K.D. Introducing actions into qualitative simulation. Proc. IJCAI-89, Detroit, MI. 1989;1273-1278.
12. Gärdenfors P. Knowledge in Flux: Modeling the Dynamics of Epistemic States. 1988;Bradford Books, MIT Press, Cambridge, MA.
13. Gärdenfors P., Rott H. Belief revision. Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 4. 1995;35-132 Oxford University Press, Oxford.
14. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco, CA.
15. Ginsberg M.L. Conterfactuals. Artificial Intelligence. 30:1986;35-79.
16. Gogic G., Papadimitriou C., Sideri M. Incremental recompilation of knowledge. J. Artificial Intelligence Res. 8:1998;23-37.
17. Johnson D.S. A catalog of complexity classes. van Leeuwen J. Handbook of Theoretical Computer Science, Vol. A. 1990;Elsevier Science (North-Holland), Amsterdam. Chapter 2.
18. Karp R.M., Lipton R.J. Some connections between non-uniform and uniform complexity classes. Proc. 12th ACM Symposium on Theory of Computing (STOC-80). 1980;302-309.
19. Katsuno H., Mendelzon A.O. On the difference between updating a knowledge base and revising it. Proc. Second International Conference on the Principles of Knowledge Representation and Reasoning (KR-91), Cambridge, MA. 1991;387-394.
20. Kautz H.A., Selman B. Forming concepts for fast inference. Proc. AAAI-92, San Jose, CA. 1992;786-793.
21. Kyburg H.E. Jr. Uncertainty logics. Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3. 1994;397-438 Oxford University Press, Oxford.
22. Liberatore P., Schaerf M. The complexity of model checking for belief revision and update. Proc. AAAI-96, Portland, OR. 1996;556-561.
23. Nebel B. Belief revision and default reasoning: Syntax-based approaches. Proc. Second International Conference on the Principles of Knowledge Representation and Reasoning (KR-91), Cambridge, MA. 1991;417-428.
24. Nebel B. Base revision operations and schemes: Semantics, representation and complexity. Proc. 11th European Conference on Artificial Intelligence (ECAI-94), Amsterdam. 1994;341-345.
25. Satoh K. Nonmonotonic reasoning by minimal belief revision. Proc. International Conference on Fifth Generation Computer Systems (FGCS-88). 1988;455-462.
26. Weber A. Updating propositional formulas. Proc. First Conference on Expert Database Systems. 1986;487-500.
27. Winslett M. Updating Logical Databases. 1990;Cambridge University Press, Cambridge.
28. Winslett M. Epistemic aspects of databases. Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 4. 1995;133-174 Oxford University Press, Oxford.
29. Yap C.K. Some consequences of non-uniform conditions on uniform classes. Theoret. Comput. Sci. 26:1983;287-300.