Semantic forgetting in answer set programming

Artificial Intelligence

Volumn 172, Issue 14, 2008, Pages 1644-1672

  Eiter, Thomas ^a   Wang, Kewen ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b GRIFFITH UNIVERSITY   (Australia)

Author keywords

Answer set programming; Computational complexity; Forgetting; Knowledge representation; Nonmonotonic logic programs

Indexed keywords

BASIC (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING; FUZZY LOGIC; INFORMATION THEORY; LOGIC PROGRAMMING; SEMANTICS; SET THEORY; XML;

(ALGORITHMIC) COMPLEXITY; (E ,2E) THEORY; ANSWER SET PROGRAMMING (ASP); ANSWER SET SEMANTICS; BASIC IDEA; CLASSICAL LOGICS; CONFLICT RESOLUTIONS; DESIRABLE PROPERTIES; DISJUNCTIVE LOGIC PROGRAMMING (DLP); DISJUNCTIVE LOGIC PROGRAMS; GENERAL FRAMEWORK; KNOWLEDGE BASES (KB); LOGIC PROGRAMS; NON MONOTONIC REASONING; NON-MONOTONIC; PREFERENCE ELICITATION; VARIABLE ELIMINATION;

LEARNING SYSTEMS;

EID: 47749152196     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2008.05.002     Document Type: Article

References (73)

1. Alferes J., Leite J., Pereira L., Przymusinska H., and Przymusinski T. Dynamic logic programming. In: Cohn A., Schubert L., and Shapiro S. (Eds). Proceedings of the Sixth International Conference on the Principles of Knowledge Representation and Reasoning (1998), Morgan Kaufmann Publishers 98-109
2. Alferes J., Leite J., Pereira L., Przymusinska H., and Przymusinski T. Dynamic updates of non-monotonic knowledge bases. Journal of Logic Programming 45 1-3 (2000) 43-70
3. Asparagus homepage, http://asparagus.cs.uni-potsdam.de/, Since 2005
4. Ben-Eliyahu R., and Dechter R. Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence 12 1-2 (1994) 53-87
5. Bledsoe W., and Hines L. Variable elimination and chaining in a resolution-based prover for inequalities. In: Bibel W., and Kowalski R.A. (Eds). Proceedings of 5th Conference on Automated Deduction (CADE 1980). Lecture Notes in Computer Science vol. 87 (1980), Springer 70-87
6. Boole G. The Mathematical Analysis of Logic (1847), G. Bell, London reprinted by
7. Boole G. The Mathematical Analysis of Logic (1948), Philosophy Library, New York
8. Brass S., and Dix J. Characterizations of the disjunctive stable semantics by partial evaluation. Journal of Logic Programming 32 3 (1997) 207-228
9. Brass S., and Dix J. Semantics of disjunctive logic programs based on partial evaluation. Journal of Logic Programming 38 3 (1999) 167-312
10. Brown F. Boolean Reasoning: The Logic of Boolean Equations. second ed. (2003), Dover Publications
11. Buccafurri F., Faber W., and Leone N. Disjunctive logic programs with inheritance. In: De Schreye D. (Ed). Proceedings of the International Conference on Logic Programming (ICLP'99) (1999), The MIT Press 79-93
12. Buccafurri F., Faber W., and Leone N. Disjunctive logic programs with inheritance. Theory and Practice of Logic Programming 2 3 (2002) 293-321
13. Cadoli M., Donini F., Liberatore P., and Schaerf M. Space efficiency of propositional knowledge representation formalisms. Journal of Artificial Intelligence Research 13 (2000) 1-31
14. Cadoli M., Donini F.M., Liberatore P., and Schaerf M. Preprocessing of intractable problems. Information and Computation 176 2 (2002) 89-120
15. Clark K. Negation as failure. In: Gallaire H., and Minker J. (Eds). Logic and Data Bases (1978), Plenum Press 293-322
16. Dantsin E., Eiter T., Gottlob G., and Voronkov A. Complexity and expressive power of logic programming. ACM Computing Surveys 33 3 (2001) 374-425
17. de Waal A., and Gallagher J. Logic program specialisation with deletion of useless clauses. In: Miller D. (Ed). Proceedings of the 1993 International Symposium on Logic Programming (ILPS 1993) (1993), MIT Press 632
18. Eiter T., and Fink M. Uniform equivalence of logic programs under the stable model semantics. In: Palamidessi C. (Ed). Proceedings 19th International Conference on Logic Programming (ICLP 2003). Lecture Notes in Computer Science vol. 2916 (2003), Springer 224-238
19. Eiter T., Fink M., Sabbatini G., and Tompits H. Considerations on updates of logic programs. In: Ojeda-Aciego M., de Guzmán I.P., Brewka G., and Pereira L.M. (Eds). Proceedings of the Seventh European Workshop on Logics in Artificial Intelligence (JELIA'2000). Lecture Notes in Artificial Intelligence vol. 1919 (2000), Springer-Verlag 2-20
20. Eiter T., Fink M., Sabbatini G., and Tompits H. On properties of update sequences based on causal rejection. Theory and Practice of Logic Programming 2 6 (2002) 711-767
21. Eiter T., Fink M., and Woltran S. Semantical characterizations and complexity of equivalences in answer set programming. ACM Transactions on Computational Logic 8 3 (Aug. 2007)
22. Eiter T., and Gottlob G. The complexity of logic-based abduction. Journal of the ACM 42 (1995) 3-42
23. Eiter T., and Gottlob G. On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence 15 3-4 (1995) 289-323
24. Eiter T., Ianni G., Schindlauer R., and Tompits H. A uniform integration of higher-order reasoning and external evaluations in answer set programming. In: Kaelbling L.P., and Saffiotti A. (Eds). Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05) (2005), Professional Book Center 90-96
25. Eiter T., Ianni G., Schindlauer R., Tompits H., and Wang K. Forgetting in managing rules and ontologies. Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006). Hongkong, December 2006 (2006), IEEE Computer Society 411-419 Preliminary version at ALPSWS 2006
26. T. Eiter, K. Makino, G. Gottlob, Computational aspects of monotone dualization: A brief survey, Discrete Applied Mathematics (2007), doi:10.1016/j.dam.2007.04.017. Preliminary version available as Tech. Rep. INFSYS RR-1843-06-01, Institute of Information Systems, TU Vienna
27. Erdem E., and Lifschitz V. Tight logic programs. Theory and Practice of Logic Programming 3 (2003) 499-518
28. Gelfond M., and Lifschitz V. Compiling circumscriptive theories into logic programs. Proceedings of the 7th National Conference on Artificial Intelligence (AAAI 1988) (1988), AAAI Press/The MIT Press 455-449
29. Gelfond M., and Lifschitz V. The stable model semantics for logic programming. In: Kowalski R.A., and Bowen K.A. (Eds). Proceedings of the Fifth International Conference and Symposium on Logic Programming (ICLP/SLP 1988) (1988), The MIT Press 1070-1080
30. Gelfond M., and Lifschitz V. Logic programs with classical negation. In: Warren D.H.D., and Szeredi P. (Eds). Proceedings of the Seventh International Conference on Logic Programming (ICLP 1990) (1990), The MIT Press 579-597
31. Gelfond M., and Lifschitz V. Classical negation in logic programs and deductive databases. New Generation Computing 9 (1991) 365-385
32. Grant J., Horty J., Lobo J., and Minker J. View updates in stratified disjunctive databases. Journal of Automated Reasoning 11 2 (1993) 249-267
33. Inoue K., and Sakama C. Negation as failure in the head. Journal of Logic Programming 35 1 (1998) 39-78
34. Janhunen T., Niemelä I., Simons P., and You J.-H. Partiality and disjunctions in stable model semantics. In: Cohn A.G., Giunchiglia F., and Selman B. (Eds). Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2000). April 12-15, Breckenridge, Colorado, USA (2000), Morgan Kaufmann Publishers, Inc. 411-419
35. Lang J., Liberatore P., and Marquis P. Propositional independence: Formula-variable independence and forgetting. Journal of Artificial Intelligence Research 18 (2003) 391-443
36. Lang J., and Marquis P. Resolving inconsistencies by variable forgetting. In: Fensel D., Giunchiglia F., McGuinness D.L., and Williams M.-A. (Eds). Proceedings of the Eighth International Conference on the Principles of Knowledge Representation and Reasoning (2002), Morgan Kaufmann 239-250
37. Larrosa J. Boosting search with variable elimination. In: Dechter R. (Ed). Proceedings 6th International Conference on Principles and Practice of Constraint Programming (CP 2000). Lecture Notes in Computer Science vol. 1894 (2000), Springer 291-305
38. Larrosa J., Morancho E., and Niso D. On the practical use of variable elimination in constraint optimization problems: 'still-life' as a case study. Journal of Artificial Intelligence Research 23 (2005) 421-440
39. Lassez C., McAloon K., and Port G.S. Stratification and knowledge based management. In: Lassez J.-L. (Ed). Proceedings of the Fourth International Conference on Logic Programming (ICLP 87) (1987), MIT Press 136-151
40. Lee J., and Lifschitz V. Loop formulas for disjunctive logic programs. In: Palamidessi C. (Ed). Proceedings of the Nineteenth International Conference on Logic Programming (ICLP-03). Lecture Notes in Computer Science vol. 2916 (2003), Springer 451-465
41. Leone N., Pfeifer G., Faber W., Eiter T., Gottlob G., Perri S., and Scarcello F. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7 3 (2006) 499-562
42. Lewis C.I. A Survey of Symbolic Logic (1918), University of California Press reprinted by
43. Lewis C.I. A Survey of Symbolic Logic (1960), Dover Pub's., Inc., New York (Chapter II, "The Classic, or Boole-Schroder Algebra of Logic")
44. Lifschitz V. Computing circumscription. In: Joshi A.K. (Ed). Proceedings 9th International Joint Conference on Artificial Intelligence (IJCAI-85) (1985), Morgan Kaufmann 121-127
45. Lifschitz V. Circumscription. In: Gabbay D., Hogger C., and Robinson J. (Eds). Handbook of Logic in Artificial Intelligence and Logic Programming vol. III (1994), Clarendon Press, Oxford 297-352
46. Lifschitz V. Answer set programming and plan generation. Artificial Intelligence 138 (2002) 39-54
47. Lifschitz V., Pearce D., and Valverde A. Strongly equivalent logic programs. ACM Transactions on Computational Logic 2 4 (2001) 426-541
48. Lifschitz V., Tang L., and Turner H. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25 (1999) 369-389
49. Lifschitz V., and Turner H. Splitting a logic program. In: Van Hentenryck P. (Ed). Proceedings of the 11th International Conference on Logic Programming (ICLP 1994) (1994), MIT Press 23-37
50. Lin F. On strongest necessary and weakest sufficient conditions. Artificial Intelligence 128 1-2 (2001) 143-159
51. Lin F., and Reiter R. Forget it. In: Greiner R., and Subramanian D. (Eds). Proceedings of the AAAI Fall Symposium on Relevance (1994), The AAAI Press 154-159 Technical Report FS-94-02
52. Lin F., and Zhao Y. ASSAT: computing answer sets of a logic program by SAT solvers. Proceedings of the AAAI National Conference on Artificial Intelligence (2002), The AAAI Press 112-117
53. Lin F., and Zhao Y. ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157 (2004) 115-137
54. Marek W., and Truszczyński M. Autoepistemic logic. Journal of the ACM 38 3 (1991) 588-619
55. Marek W., and Truszczyński M. Revision programming. Theoretical Computer Science 190 (1998) 241-277
56. McCarthy J. Circumscription-a form of nonmonotonic reasoning. Artificial Intelligence 13 1-2 (1980) 27-39
57. Middeldorp A., Okui S., and Ida T. Lazy narrowing: Strong completeness and eager variable elimination. Theoretical Computer Science 167 1&2 (1996) 95-130
58. Moinard Y. Forgetting literals with varying propositional symbols. Journal of Logic and Computation 17 5 (2007) 955-982
59. Moore R. Semantical considerations on nonmonotonic logics. Artificial Intelligence 25 (1985) 75-94
60. Noy N.F., and Stuckenschmidt H. Ontology alignment: An annotated bibliography. Semantic Interoperability and Integration. Dagstuhl Seminar Proceedings vol. 04391 (2005), IBFI, Schloss Dagstuhl, Germany
61. Pearce D., Tompits H., and Woltran S. Encodings for equilibrium logic and logic programs with nested expressions. In: Brazdil P., and Jorge A. (Eds). 10th Portuguese Conference on Artificial Intelligence (EPIA 2001). Lecture Notes in Computer Science vol. 2258 (2001), Springer 306-320
62. Reiter R. A logic for default reasoning. Artificial Intelligence 13 (1980) 81-132
63. Sacca D., and Zaniolo C. Partial models and three-valued stable models in logic programs with negation. In: Nerode A., Marek W., and Subrahmanian V.S. (Eds). Proceedings of the Workshop on Nonmonotonic Reasoning and Logic Programming (1991), MIT Press 87-101
64. Sakama C., and Inoue K. An abductive framework for computing knowledge base updates. Theory and Practice of Logic Programming 3 6 (2003) 671-713
65. In: Subramanian D., Greiner R., and Pearl J. (Eds). Artificial Intelligence Journal: Special Issue on Relevance 97 1-2 (1997)
66. Tessier C., Chaudron L., and Müller H. Conflicting Agents-Conflict Management in Multi-Agent Systems (2001), Kluwer Academic Publishers, Cambridge
67. Wang K., Sattar A., and Su K. A theory of forgetting in logic programming. Proceedings of the 20th National Conference on Artificial Intelligence (2005), AAAI Press 682-687
68. Wang K., and Zhou L. Comparisons and computation of well-founded semantics for disjunctive logic programs. ACM Transactions on Computational Logic 6 2 (2005) 295-327
69. Weber A. Updating propositional formulas. In: Kerschberg L. (Ed). Proceedings of the First Conference on Expert Database Systems (EDS 1986) (1987), Benjamin Cummings 487-500
70. Zhang Y. Logic program-based updates. ACM Transactions on Computational Logic 7 3 (2006) 421-472
71. Zhang Y., and Foo N. Towards generalized rule-based updates. Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI '97) (1997), Morgan Kaufmann 82-87
72. Zhang Y., and Foo N. Solving logic program conflict through strong and weak forgettings. Artificial Intelligence 170 8-9 (2006) 739-778
73. Zhang Y., Foo N., and Wang K. Solving logic program conflicts through strong and weak forgettings. In: Kaelbling L.P., and Saffiotti A. (Eds). Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2005) (2005), AAAI Press 627-632