Discovering classes of strongly equivalent logic programs

Journal of Artificial Intelligence Research

Volumn 28, Issue , 2007, Pages 431-451

  Lin, Fangzhen ^a   Chen, Yin ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b SOUTH CHINA NORMAL UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; COMPUTER SOFTWARE; FORMAL LOGIC; THEOREM PROVING;

PROGRAM SIMPLIFICATION; SET SEMANTICS;

SEMANTICS;

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

References (25)

1. Brass, S., & Dix, J. (1999). Semantics of (disjunctive) logic programs based on partial evaluation. Journal of Logic Programming, 40(1), 1-46.
2. Chen, Y., Lin, F., & Li, L. (2005). SELP - a system for studying strong equivalence between logic programs. In Proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning(LPNMR 2005), pp. 442-446.
3. 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 (LPNMR 2004), pp. 87-99.
4. Erdem, E., Lifschitz, V., Nakhleh, L., & Ringe, D. (2003). Reconstructing the evolutionary history of indo-european languages using answer set programming. In Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages(PADL 2003), pp. 160-176.
5. Gelfond, M., & Lifschitz, V. (1988). The stable model semantics for logic programming. In Proceedings of the 5th International Conference and Symposium on Logic Programming (ICLP/SLP), pp. 1070-1080.
6. Gelfond, M., & Lifschitz, V. (1991). Classical negation in logic programs and disjunctive databases. New Generation Computing, 9(3/4), 365-386.
7. Inoue, K., & Sakama, C. (2004). Equivalence of logic programs under updates. In Proceedings of the 9th European Conference on Logics in Artificial Intelligence(JELIA), pp. 174-186.
8. Lenat, D. B. (1979). On automated scientific theory formation: A case study using the AM program. In Machine Intelligence 9, pp. 251-283. Jean Hayes, Donald Michie, and L. I. Mikulich, eds. Ellis Horwood.
9. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., & Scarcello, F. (2006). The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic, 7(3).
10. Lierler, Y., & Maratea, M. (2004). Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning(LPNMR 2004), pp. 346-350.
11. Lifschitz, V. (1999). Action languages, answer sets and planning. In The Logic Programming Paradigm: A 25-Year Perspective. K.R. Apt, V.W. Marek, M. Truszczynski, D.S. Warren, eds, Springer-Verlag.
12. Lifschitz, V., Pearce, D., & Valverde, A. (2001). Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2(4), 526-541.
13. 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(KR2002), pp. 170-176.
14. Lin, F. (2004). Discovering state invariants. In Proceedings of the 9th International Conference on Principles of Knowledge Representation and Reasoning(KR2004), pp. 536-544.
15. Lin, F., & Zhao, Y. (2004). ASSAT: computing answer sets of a logic program by sat solvers. Artificial Intelligence, 157(1-2), 115-137.
16. Marek, V. W., & Truszczynski, M. (1999). Stable logic programming - an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25- Year Perspective. K.R. Apt, V.W. Marek, M. Truszczynski, D.S. Warren, eds, Springer-Verlag.
17. Niemelä, I., Simons, P., & Syrjänen, T. (2000). Smodels: a system for answer set programming. In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning. Breckenridge, Colorado, USA. (CoRR: arXiv:cs.AI/0003033) http://www.tcs.hut.fi/Software/smodels/.
18. Niemelä, I. (1999). Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3-4), 241-273.
19. Nogueira, M., Balduccini, M., Gelfond, M., Watson, R., & Barry, M. (2001). An A-Prolog decision support system for the space shuttle. In Proceedings of the 3rd International Symposium on Practical Aspects of Declarative Languages(PADL 2001), pp. 169-183.
20. Osorio, M., Navarro, J. A., & Arrazola, J. (2001). Equivalence in answer set programming. In Selected Papers of the 11th International Workshop on Logic Based Program Synthesis and Transformation(LOPSTR 2001), pp. 57-75.
21. Pearce, D., Tompits, H., & Woltran, S. (2001). Encodings for equilibrium logic and logic programs with nested expressions. In Proceedings of 10th Portuguese Conference on Artificial Intelligence(EPIA 2001), pp. 306-320.
22. Petkovsek, M., Wilf, H. S., & Zeilberger, D. (1996). A = B. Wellesley, Mass. : A K Peters.
23. Turner, H. (2001). Strong equivalence for logic programs and default theories (made easy). In Proceedings of the 6th International Conference on Logic Programming and Non-monotonic Reasoning(LPNMR 2001), pp. 81-92.
24. Turner, H. (2003). Strong equivalence made easy: nested expressions and weight constraints. Theory and Practice of Logic Programming, 3(4-5), 609-622.
25. 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.