Discovering classes of strongly equivalent logic programs

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 516-521

  Lin, Fangzhen ^a   Chen, Yin ^b  

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

^b SUN YAT SEN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET SEMANTICS; COMPUTER-AIDED; LOGIC PROGRAMS; ONE-RULE; PROGRAM SIMPLIFICATION;

ARTIFICIAL INTELLIGENCE; LOGIC PROGRAMMING; SEMANTICS;

EQUIVALENCE CLASSES;

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

References (13)

1. S. Brass and J. Dix. Semantics of (disjunctive) logic programs based on partial evaluation. J.Log. Program. 40(1), pages 1-46, 1999.
2. T. Eiter, M. Fink, H. Tompits, and S. Woltran. Simplifying logic programs under uniform and strong equivalence. In LPNMR, pages 87-99, 2004.
3. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
4. D. B. Lenat. On automated scientific theory formation: A case study using the AM program. MachineIntelligence 9, pages 251-283, 1979. Jean Hayes, Donald Michie, and L. I. Mikulich, eds.
5. V. Lifschitz, D. Pearce, and A. Valverde. Strongly equivalent logic programs. ACMTransactions on Computational Logic, 2(4):526-541, 2001.
6. F. Lin. Reducing strong equivalence of logic programs to entailment in classical propositional logic. In Proc. KR'02, pages 170-176, 2002.
7. F. Lin. Discovering state invariants. In Proc.KR'04, pages 536-544, 2004.
8. V. W. Marek and M. Truszczynski. Stable logic programming - an alternative logic programming paradigm. In The LogicProgramming Paradigm: A 25-Year Perspective. K.R. Apt, V.W. Marek, M. Truszczynski, D.S. Warren, eds, Springer-Verlag, 1999.
9. I. Niemelä, P. Simons, and T. Syrjänen. Smodels: a system for answer set programming. In Proc NMR-2000. (CoRR: arXiv:cs.AI/0003033) http://www.tcs.hut.fi/Software/smodels/.
10. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. and AI, 25(3-4):241-273, 1999.
11. M. Osorio, J. A. Navarro, and J. Arrazola. Equivalence in answer set programming. In LOPSTR2001, pages 57-75, 2001.
12. M. Petkovsek, H. S. Wilf, and D. Zeilberger. A = B. Wellesley, Mass. : A K Peters, 1996.
13. K. Wang and L. Zhou. Comparisions and computation of well-founded semantics for disjunctive logic programs. ACM Transactions on ComputationalLogic, 2005. To appear.