Forgetting and conflict resolving in disjunctive logic programming

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 238-243

  Eiter, Thomas ^a   Wang, Kewen ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b GRIFFITH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; KNOWLEDGE REPRESENTATION; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

CLASSICAL FORGETTING; CONFLICT RESOLUTION; DISJUNCTIVE LOGIC PROGRAMS;

LOGIC PROGRAMMING;

EID: 33750701795     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Baral, C. 2002. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
2. Ben-Eliyahu, R., and Dechter, R. 1994. Propositional semantics for disjunctive logic programs. Ann. Math. and AI 12(1-2):53-87.
3. Brass, S., and Dix, J. 1999. Semantics of disjunctive logic programs based on partial evaluation. J. Logic Programming 38(3):167-312.
4. Eiter, T., and Fink, M. 2003. Uniform equivalence of logic programs under the stable model semantics. In Proc. 19th ICLP, 224-238.
5. Dantsin, E.; Eiter, T.; Gottlob, G.; and Voronkov, A. 2001. Complexity and expressive power of logic programming. ACM Computing Surveys 33(3):374-425.
6. Eiter, T., and Gottlob, G. 1995. On the computational cost of disjunctive logic programming: Propositional case. Ann. Math. and AI 15(3-4):289-323.
7. Gelfond, M., and Lifschitz, V. 1990. Logic programs with classical negation. In Proc. ICLP, 579-597.
8. Janhunen, T.; Niemelä, I.; Simons, P.; and You, J.-H. 2000. Partiality and Disjunctions in Stable Model Semantics. In Proc. KR 2000, 411-419.
9. Lang, J., and Marquis, P. 2002. Resolving inconsistencies by variable forgetting. In Proc. 8th KR, 239-250.
10. Lang, J.; Liberatore, P.; and Marquis, P. 2003. Propositional independence: Formula-variable independence and forgetting. J. Artif. Intell. Res. 18:391-443.
11. Lee, J., and Lifschitz, V. 2003. Loop formulas for disjunctive logic programs. In Proc. ICLP, 451-465.
12. Leone, N.; Pfeifer, G.; Faber, W.; Eiter, T.; Gottlob, G.; Perri, S.; and Scarcello, F. 2004. The DLV System for Knowledge Representation and Reasoning. ACM TOCL (to appear).
13. Lifschitz, V.; Tang, L.; and Turner, H. 1999. Nested expressions in logic programs. Ann. Math. and AI 25:369-389.
14. Lin, F., and Reiter, R. 1994. Forget it. In Proc. AAAI Symp. on Relevance, 154-159.
15. Lin, F., and Zhao, Y. 2004. ASSAT: Computing answer set of a logic program by sat solvers. Artif. Intell. 157(1-2): 115-137.
16. Wang, K., and Zhou, L. 2005. Comparisons and computation of well-founded semantics for disjunctive logic programs. ACM TOCL 6(2):295-327.
17. Wang, K.; Sattar, A.; and Su, K. 2005. A theory of forgetting in logic programming. In Proc. 20th AAAI, 682-687. AAAI Press.
18. Zhang, Y.; Foo, N.; and Wang, K. 2005. Solving logic program conflicts through strong and weak forgettings. In Proc. IJCAI, 627-632.