A theory of forgetting in logic programming

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2005, Pages 682-687

  Wang, Kewen ^a   Sattar, Abdul ^a   Su, Kaile ^a  

^a GRIFFITH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; LOGIC PROGRAMMING; POLYNOMIALS; SEMANTICS;

CLASSICAL LOGICS; LOGIC PROGRAM UPDATES; TIME COMPLEXITY;

ARTIFICIAL INTELLIGENCE;

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

References (14)

1. Alferes, J., Leite, J. Pereira, L., Przymusinska, H., and Przymusinski, T. 1998. Dynamic logic programming. In Proc. of KR'98, pp.98-109.
2. S. Brass, J. Dix, B. Freitag, and U. Zukowski. Transformation-based bottom-up computation of the well-founded model. Theory and Practice of Logic Programming, 1(5):497-538, 2001.
3. F. Brown. Boolean Reasoning: The Logic of Boolean Equations (2nd Edition). Dover Publications. 2003.
4. Buccafurri, F., Faber, W., and Leone, N. 1999. Disjunctive logic programs with inheritance. In Proc. of ICLP'99, pp.79-93.
5. Doherty, P., Lukaszewicz, W., and Madalinska-Bugaj, E. 1998. The pma and relativizing change for action update. In Proc. of KR'08, pp. 258-269.
6. Eiter, T., Fink, M., Sabbatini, G., and Tompits, H. 2002. On properties of update sequences based on causal rejection. Theory and Practice of Logic Programming, 2:711-767.
7. Gelfond, M., and Lifschitz, V. 1990. Logic programs with classical negation. In Proc. of ICLP'90. pp. 579-597.
8. J. Lang, P. Liberatore, and P. Marquis. Prepositional independence: Formula-variable independence and forgetting. Journal of Artificial Intelligence Research, 18:391-443, 2003.
9. V. Lifschitz. Answer set programming and plan generation. Artificial Intelligence, 138:39-54, 2002.
10. F. Lin and Y. Zhao. Assat: Computing answer set of a logic program by sat solvers. Artificial Intelligence, 157:115-137, 2004.
11. F. Lin and R. Reiter. Forget it. In Proc. of AAAI Symp. on Relevance, pp. 154-159. New Orleans (LA), 1994.
12. C. Sakama and K. Inoue. An abductive framework for computing knowledge base updates. Theory and Practice of Logic Programming, 3(6):671-713. 2003.
13. Subhramanian, D., Greiner, R., and Pearl, J. (editors). 1997. Artificial Intelligence: Special Issue on Relevance.
14. Y. Zhang, N. Foo, and K. Wang. Solving logic program conflicts through strong and weak forgettings. In Proc. of IJCAI, 2005 (accepted).