Sound and complete inference rules for SE-consequence

Journal of Artificial Intelligence Research

Volumn 31, Issue , 2008, Pages 205-216

  Wong, Ka Shu ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; INFERENCE ENGINES; SEMANTICS;

DISJUNCTIVE LOGIC PROGRAMS; INFERENCE RULES; LOGIC PROGRAM RULES;

LOGIC PROGRAMMING;

EID: 44449128188     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2472     Document Type: Article

References (13)

1. Boyer, R. (1971). Locking: A Restriction of Resolution. Ph.D. thesis, University of Texas, Austin.
2. Brass, S., & Dix, J. (1999). Semantics of (disjunctive) logic programs based on partial evaluation. Journal of Logic Programming, 38(3), 167-213.
3. Cabalar, P. (2002). A three-valued characterization for strong equivalence of logic programs. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-2002), pp. 106-111.
4. Eiter, T., Fink, M., Tompits, H., & Woltran, S. (2004). Simplifying logic programs under uniform and strong equivalence. In Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 87-99.
5. Gelfond, M., & Lifschitz, V. (1988). The stable model semantics for logic programming. In Proceedings of the 5th International Conference on Logic Programming, pp. 1070-1080.
6. Lifschitz, V., Pearce, D., & Valverde, A. (2001). Strongly equivalent logic programs. Computational Logic, 2(4), 526-541.
7. Lin, F. (2002). Reducing strong equivalence of logic programs to entailment in classical propositional logic. In Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning, pp. 170-176.
8. Lin, F., & Chen, Y. (2007). Discovering classes of strongly equivalent logic programs. Journal of Artificial Intelligence Research, 28, 431-451.
9. Osorio, M., Navarro, J. A., & Arrazola, J. (2001). Equivalence in answer set programming. In Proceedings of the 11th International Workshop on Logic Based Program Synthesis and Transformation, pp.57-75.
10. Sakama, C., & Seki, H. (1997). Partial deduction in disjunctive logic programming. Journal of Logic Programming, 32(3), 229-245.
11. Turner, H. (2001). Strong equivalence for logic programs and default theories (made easy). In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 81-92.
12. Turner, H. (2003). Strong equivalence made easy: nested expressions and weight constraints. Theory and Practice of Logic Programming, 3(4-5), 609-622.
13. Wang, K., & Zhou, L. (2005). Comparisons and computation of well-founded semantics for disjunctive logic programs. ACM Transactions on Computational Logic, 6(2), 295-327.