On properties of update sequences based on causal rejection

Theory and Practice of Logic Programming

Volumn 2, Issue 6, 2002, Pages 711-767

  Eiter, Thomas ^a   Fink, Michael ^a   Sabbatini, Giuliana ^a   Tompits, Hans ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Knowledge based updates; Logic programming; Nonmonotonic reasoning

Indexed keywords

EID: 0347303162     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068401001247     Document Type: Article

References (63)

1. Alchourrón, C. E., Gärdenfors, P. and Makinson, D. (1985) On the logic of theory change: Partial meet functions for contraction and revision. J. Symbolic Logic, 50, 510-530.
2. Alferes, J. J. and Pereira, L. M. (1997) Update-programs can update programs. In: Dix, J., Pereira, L. M. and Przymusinski, T. C. (eds.), Selected Papers from the ICLP'96 Workshop on Nonmonotonic Extensions of Logic Programming (NMELP'96). LNAI 1216, pp. 110-131. Springer.
3. Alferes, J. J. and Pereira, L. M. (2000) Updates plus preferences. In: Aciego, M. O., de Guzmán, I. P., Brewka, G. and Pereira, L. M. (eds.), Proc. Seventh Europ. Workshop on Logic in Artificial Intelligence (JELIA 2000). LNAI 1919, pp. 345-360. Springer.
4. Alferes, J. J., Leite, J. A., Pereira, L. M., Przymusinska, H. and Przymusinski, T. C. (1998) Dynamic logic programming. In: Cohn, A., Schubert, L. and Shapiro, C. (eds.), Proc. Sixth Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'98), pp. 98-111. Morgan Kaufmann.
5. Alferes, J. J., Pereira, L. M., Przymusinska, H. and Przymusinski, T. C. (1999) LUPS - A language for updating logic programs. In: Gelfond, M., Leone, N. and Pfeifer, G. (eds.), Proc. Fifth Int. Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR'99). LNAI 1730, pp. 162-176. Springer.
6. Alferes, J. J., Leite, J. A., Pereira, L. M., Przymusinska, H. and Przymusinski, T. C. (2000) Dynamic updates of non-monotonic knowledge bases. J. Logic Programming, 45(1-3), 43-70.
7. Baral, C. and Gelfond, M. (1994) Logic programming and knowledge representation. J. Logic Programming, 19/20, 73-148.
8. Benferhat, S., Cayrol, C., Dubois, D., Lang, J. and Prade, H. (1993) Inconsistency management and prioritized syntax-based entailment. In: Bajcsy, R. (ed.), Proc. Thirteenth Int. Joint Conf. on Artificial Intelligence (IJCAI'93), pp. 640-645. Morgan Kaufmann.
9. Brewka, G. (1991a) Cumulative default logic: In defense of nonmonotonic inference rules. Artificial Intelligence, 50(2), 183-205.
10. Brewka, G. (1991b) Nonmonotonic Reasoning: Logical Foundations of Commonsense. Cambridge Tracts in Theoretical Computer Science, 12. Cambridge University Press.
11. Brewka, G. (2000) Declarative representation of revision strategies. In: Horn, W. (ed.), Proc. Fourteenth Europ. Conf. on Artificial Intelligence (ECAI 2000), pp. 18-22. IOS Press. (Preliminary version presented at Int. Workshop on Nonmonotonic Reasoning, Breckenridge, 2000. URL: http://arXiv.org/abs/cs.AI/0003036.)
12. Brewka, G. (2000) Declarative representation of revision strategies. In: Horn, W. (ed.), Proc. Fourteenth Europ. Conf. on Artificial Intelligence (ECAI 2000), pp. 18-22. IOS Press. (Preliminary version presented at Int. Workshop on Nonmonotonic Reasoning, Breckenridge, 2000. URL: http://arXiv.org/abs/cs.AI/0003036.)
13. Buccafurri, F., Leone, N. and Rullo, P. (1996) Stable models and their computation for logic programming with inheritance and true negation. J. Logic Programming, 27(1), 5-43.
14. Buccafurri, F., Faber, W. and Leone, N. (1999a) Disjunctive logic programs with inheritance. In: De Schreye, D. (ed.), Proc. Sixteenth Int. Conf. on Logic Programming (ICLP'99), pp. 79-93. MIT Press.
15. Cholewiński, P., Marek, V. W. and Truszczyński, M. (1996) Default reasoning system DeReS. In: Carlucci Aiello, L., Doyle, J. and Shapiro, S. (eds.) Proc. Fifth Int. Conf. on Principles of Knowledge Representation and Reasoning (KR '96), pp. 518-528. Morgan Kaufmann.
16. Dantsin, E., Eiter, T., Gottlob, G. and Voronkov, A. (1997) Complexity and expressive power of logic programming. Proc. 12th IEEE Int. Conf. on Computational Complexity (CCC'97), pp. 82-101. IEEE Computer Society Press. (Full paper ACM Computing Surveys, 33(3), 374-425, 2001.)
17. Dantsin, E., Eiter, T., Gottlob, G. and Voronkov, A. (1997) Complexity and expressive power of logic programming. Proc. 12th IEEE Int. Conf. on Computational Complexity (CCC'97), pp. 82-101. IEEE Computer Society Press. (Full paper ACM Computing Surveys, 33(3), 374-425, 2001.)
18. Darwiche, A. and Pearl, J. (1997) On the logic of iterated belief revision. Artificial Intelligence, 89(1-2), 1-29.
19. Delgrande, J., Schaub, T. and Tompits, H. (2000) Logic programs with compiled preference. In: Horn, W. (ed.), Proc. Fourteenth Europ. Conf. on Artificial Intelligence (ECAI 2000), pp. 392-398. IOS Press.
20. Eiter, T. and Gottlob, G. (1992) On the complexity of propositional knowledge base revision, updates and counterfactuals. Artificial Intelligence, 57(2-3), 227-270.
21. Eiter, T. and Gottlob, G. (1995) On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence, 15(3-4), 289-323.
22. Eiter, T., Leone, N., Mateis, C., Pfeifer, G. and Scarcello, F. (1997a) A deductive system for nonmonotonic reasoning. In: Dix, J., Furbach, U. and Nerode, A. (eds.), Proc. Fourth Int. Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR'97). LNAI 1265, pp. 363-374. Springer.
23. Eiter, T., Gottlob, G. and Leone, N. (1997b) Abduction from logic programs: Semantics and complexity. Theoretical Computer Science, 189(1-2), 129-177.
24. Eiter, T., Gottlob, G. and Mannila, H. (1997c) Disjunctive Datalog. ACM Trans. Database Systems, 22(3), 364-418.
25. Eiter, T., Fink, M., Sabbatini, G. and Tompits, H. (2000a) Considerations on updates of logic programs. In: Aciego, M. O., de Guzmàn, I. P., Brewka, G. and Pereira, L. M. (eds.), Proc. Seventh Europ. Workshop on Logic in Artificial Intelligence (JELIA 2000). LNAI 1919, pp. 2-20. Springer.
26. Eiter, T., Fink, M., Sabbatini, G. and Tompits, H. (2000b) On Updates of Logic Programs: Semantics and Properties. Technical Report INFSYS RR-1843-00-08, Technical University of Vienna, Knowledge-Based Systems Group.
27. Eiter, T., Leone, N., Mateis, C., Pfeifer, G. and Scarcello, F. (1998). The KR System dlv: Progress report, comparisons and benchmarks. In: Cohn, A., Schubert, L. and Shapiro, S. (eds.), Proc. Sixth Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'98), pp. 406-417. Morgan Kaufmann.
28. Gabbay, D. M. (1985) Theoretical foundations for non-monotonic reasoning in expert systems. In: Apt, K. R. (ed.), Logics and Models of Concurrent Systems, pp. 439-457. Springer.
29. Gärdenfors, P. and Makinson, D. (1994) Nonmonotonic inferences based on expectations. Artificial Intelligence, 65(2), 197-245.
30. Gärdenfors, P. and Rott, H. (1995) Belief revision. In: Gabbay, D. M., Hogger, C. J. and Robinson, J. A. (eds.), Handbook of Logic in AI and Logic Programming, Volume IV, pp. 35-132. Oxford Science Publications.
31. Gelfond, M. and Lifschitz, V. (1988) The stable model semantics for logic programming. In: Kowalski, R. and Bowen, K. A. (eds.), Proc. Fifth Int. Conf. and Symposium on Logic Programming, pp. 1070-1080. MIT Press.
32. Gelfond, M. and Lifschitz, V. (1991) Classical negation in logic programs and disjunctive databases. New Generation Computing, 9(3-4), 365-385.
33. Inoue, K. (2000) A simple characterization of extended abduction. In: Lloyd, J. W., Dahl, V., Furbach, U., Kerber, M., Lau, K. K., Palmidessi, C., Pereira, L. M., Sagiv, Y. and Stuckey, P. J. (eds.), Proc. First Int. Conf. on Computational Logic (CL 2000). LNAI 1861, pp. 718-732. Springer.
34. Inoue, K. and Sakama, C. (1995) Abductive framework for nonomonotonic theory change. Proc. Fourteenth Int. Joint Conf. on Artificial Intelligence (IJCAI'95), pp. 204-210. Morgan Kaufmann.
35. Inoue, K. and Sakama, C. (1999) Updating extended logic programs through abduction. In: Gelfond, M., Leone, N. and Pfeifer, G. (eds.), Proc. Fifth Int. Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR'99). LNAI 1730, pp. 147-161. Springer.
36. Johnson, D. S. (1990) A catalog of complexity classes. In: Van Leeuwen, J. (ed.), Handbook of Theoretical Computer Science, vol. A, pp. 67-161. Elsevier.
37. Kakas, A. C. and Mancarella, P. (1990) Database updates through abduction. In: McLeod, D., Sacks-Davis, R. and Schek, H. J. (eds.), Proc. Sixteenth Conf. on Very Large Databases (VLDB'90), pp. 650-661. Morgan Kaufmann.
38. Katsuno, H. and Mendelzon, A. O. (1991) On the difference between updating a knowledge database and revising it. In: Allen, J. F., Fikes, R. and Sandewall, E. (eds.), Proc. Second Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'91), pp. 387-394. Morgan Kaufmann.
39. Kowalski, R. A. and Toni, F. (1996) Abstract argumentation. Artificial Intelligence & Law, 4(3-4), 275-296.
40. Kraus, S., Lehmann, D. and Magidor, M. (1990) Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44(1-2), 167-207.
41. Laenens, E., Saccà, D. and Vermeir, D. (1990) Extending logic programming. In: Garcia-Molina, H. and Jagadish, H. V. (eds.), Proc. Nineteenth ACM SIGMOD Conf. on the Management of Data, pp. 184-193.
42. Lehmann, D. (1995) Belief revision, revised. Proc. Fourteenth Int. Joint Conf. on Artificial Intelligence (IJCAI'95), pp. 1534-1540. Morgan Kaufmann.
43. Lehmann, D. and Magidor, M. (1992) What does a conditional knowledge base entail? Artificial Intelligence, 55, 1-60.
44. Leite, J. A. (1997) Logic Program Updates. MSc Thesis, Universidade Nova de Lisboa.
45. Leite, J. A., Alferes, J. J. and Pereira, L. M. (2000) Multi-dimensional dynamic logic programming. In: Satoh, K. and Sadri, F. (eds.,) Proc. CL-2000 Workshop on Computational Logic in Multi-Agent Systems (CLIMA 2000), pp. 17-26.
46. Leite, J. A. and Pereira, L. M. (1997) Generalizing updates: from models to programs. In: Dix, J., Pereira, L. M. and Przymusinski, T. C. (eds.), Logic Programming and Knowledge Representation, Selected Papers of the Third Int. Workshop (LPKR'97). LNAI 1471, pp. 224-246. Springer.
47. Lifschitz, V. and Turner, H. (1994) Splitting a logic program. In: Van Hentenryck, P. (ed.,) Proc. Eleventh Int. Conf. on Logic Programming (ICLP'94), pp. 23-37. MIT Press.
48. Makinson, D. (1993) General patterns in nonmonotonic reasoning. In: Gabbay, D. M., Hogger, C. J. and Robinson, J. A. (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming. Volume 111, pp. 35-110. Oxford Science Publications.
49. Makinson, D. and Gardenfors, P. (1991) Relations between the logic of theory change and nonmonotonic logic. In: Fuhrmann, A. and Morreau, M. (eds.), The Logic of Theory Change, pp. 185-205. Springer.
50. Marek, V. W. and Truszczyński, M. (1994) Revision specifications by means of programs. In: MacNish, C., Pearce, D. and Pereira, L. M. (eds.), Proc. Europ. Workshop on Logics in Artificial Intelligence (JELIA'94). LNAI 838, pp. 122-136. Springer.
51. Marek, V. W. and Truszczyński, M. (1991) Autoepistemic logic. J. ACM, 38(3), 588-619.
52. Nebel, B. (1991) Belief revision and default reasoning: syntax-based approaches. In: Allen, J. F., Fikes, R. and Sandewall, E. (eds.), Proc. Second Int. Conf. on Principles of Knowledge Representation and Reasoning (KR'91), pp. 417-428. Morgan Kaufmann.
53. Niemelä, I. and Simons, P. (1996) Efficient implementation of the well-founded and stable model semantics. In: Maher, M. J. (ed)., Proc. Thirteenth Joint Int. Conf. and Symposium on Logic Programming, pp. 289-303. MIT Press.
54. Papadimitriou, C. H. (1994) Computational Complexity. Addison Wesley.
55. Rao, P., Sagonas, K. F., Swift, T., Warren, D. S. and Freire, J. (1997) XSB: A system for efficiently computing well-founded semantics. In: Dix, J., Furbach, U. and Nerode, A. (eds.,) Proc. Fourth Int. Conf. on Logic Programming and Non-monotonic Reasoning (LPNMR'97). LNAI 1265, pp. 431-441. Springer.
56. Sadri, F. and Toni, F. (2000) Computational logic and multi-agent systems: A roadmap. Computational Logic, Special Issue on the Future Technological Roadmap of Compulog-Net, pp. .1-31. URL: http://www.compulog.org/net/Forum/Supportdocs.html.
57. Schaub, T. (1991) On commitment and cumulativity in default logics. In: Kruse, R. and Siegel, P. (eds.), Symbolic and Quantitative Approaches for Uncertainty: Proc. of the Europ. Conf. ECSQAU, pp. 305-309. Springer.
58. Schlipf, J. S. (1995) Complexity and undecidability results in logic programming. Annals of Mathematics and Artificial Intelligence, 15(3-4), 257-288.
59. Subrahmanian, V. S., Bonatti, P., Dix, J., Eiter, T., Kraus, S., Ozcan, F. and Ross, R. (2000) Heterogeneous Agent Systems: Theory and Implementation. MIT Press.
60. Van Gelder, A., Ross, K. A. and Schlipf, J. S. (1991) The well-founded semantics for general logic programs. J. ACM, 38(3), 620-650.
61. Winslett, M. (1988) Reasoning about action using a possible models approach. Proc. Seventh Nat. Conf. on Artificial Intelligence (AAAI'88), pp. 89-93. AAAI Press/MIT Press.
62. Zhang, Y. and Foo, N. Y. (1997) Towards generalized rule-based updates. Proc. Fifteenth Int. Joint Conf. on Artificial Intelligence (UCAI'97), 1, pp. 82-88. Morgan Kaufmann.
63. Zhang, Y. and Foo, N. Y. (1998) Updating logic programs. In: Prade, H. (ed.), Proc. Thirteenth Europ. Conf. on Artificial Intelligence (ECAI'98), pp. 403-407. Wiley.