Facts do not cease to exist because they are ignored: Relativised uniform equivalence with answer-set projection

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 458-464

  Oetsch, Johannes ^a   Tompits, Hans ^a   Woltran, Stefan ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; PROBLEM SOLVING; SEMANTICS; SET THEORY;

ALPHABETS; MODULAR PROGRAMMING;

LOGIC PROGRAMMING;

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

References (21)

1. Besnard, P.; Schaub, T.; Tompits, H.; and Woltran, S. 2005. Representing Paraconsistent Reasoning via Quantified Propositional Logic. In Inconsistency Tolerance, volume 3300 of LNCS, 84-118. Springer.
2. Chen, Y.; Lin, F.; and Li, L. 2005. SELP - A System for Studying Strong Equivalence Between Logic Programs. In Proc. 8th International Conference on Logic Programming and Nonmonotonic Reasoning [LPNMR 2005), volume 3552 of LNAI, 442-446. Springer.
3. Eiter, T., and Fink, M. 2003. Uniform Equivalence of Logic Programs under the Stable Model Semantics. In Proc: 19th International Conference on Logic Programming (ICLP 2003), volume 2916 of LNCS, 224-238. Springer.
4. Eiter, T., and Gottlob, G. 1995. On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Annals of Mathematics and Artificial Intelligence 15(3/4):289-323.
5. Eiter, T.; Fink, M.; Tompits, H.; and Woltran, S. 2004. Simplifying Logic Programs Under Uniform and Strong Equivalence. In Proc. 7th International Conference on Logic Programming and Nonmonotonic. Reasoning (LPNMR-7), volume 2923 of LNCS, 87-99, Springer.
6. Eiter, T.; Fink, M.; Tompits, H.; and Woltran, S. 2005. Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. In Proc. 20th National Conference on Artificial Intelligence (AAAI 2005), 695-700. AAAI Press.
7. Eiter, T.; Fink, M.; and Woltran, S. 2007. Semantical Characterizations and Complexity of Equivalences in Stable Logic Programming. ACM Transactions on Computational Logic. To appear.
8. Eiter, T.; Tompits, H.; and Woltran, S. 2005. On Solution Correspondences in Answer Set Programming. In Proc. 19th International Joint Conference on Artificial Intelligence (IJCAI2005), 97-102.
9. Gelfond, M., and Lifschitz, V. 1991. Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing 9:365-385.
10. Huxley, A. 1928. Proper Studies. Doubleday Doran.
11. Inoue, K., and Sakama, C. 2004. Equivalence of Logic Programs Under Updates. In Proc. 9th European Conference on Logics in Artificial Intelligence (JELIA 2004), volume 3229 of LNCS, 174-186. Springer.
12. Janhunen, T., and Oikarinen, E. 2007. Automated Verification of Weak Equivalence within the SMODELS System. Theory and Practice of Logic Programming 7(4):1-48.
13. Lifschitz, V.; Pearce, D.; and Valverde, A. 2001. Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic 2(4):526-541.
14. Lin, F., and Chen, Y. 2005. Discovering Classes of Strongly Equivalent Logic Programs. In Proc. 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), 516-521.
15. Oetsch, J.; Seidl, M.; Tompits, H.; and Woltran, S. 2006. ccT: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming. In Proc. 15th International Conference on Computing (CIC 2006), 3-10. IEEE Computer Society Press.
16. Oikarinen, E., and Janhunen, T. 2006. Modular Equivalence for Normal Logic Programs. In Proc. 17th European Conference on Artificial Intelligence (ECAI 2006), 412-416. IOS Press.
17. Pearce, D. 2004. Simplifying Logic Programs under Answer Set Semantics. In Proc. 20th International Conference on Logic Programming (ICLP 2004), volume 3132 of LNCS, 210-224. Springer.
18. Sagiv, Y. 1988. Optimizing Datalog Programs. In Minker, J., ed., Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann. 659-698.
19. Tompits, H., and Woltran, S. 2005. Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. In Proc. 21st International Conference on Logic Programming (ICLP 2005), volume 3668 of LNCS, 189-203. Springer.
20. Turner, H. 2003. Strong Equivalence Made Easy: Nested Expressions and Weight Constraints, Theory and Practice of Logic Programming 3(4-5):602-622.
21. Woltran, S. 2004. Characterizations for Relativized Notions of Equivalence in Answer Set Programming. In Proc. 9th European Conference on Logics in Artificial Intelligence (JELIA 2004), volume 3229 of LNCS, 161-173. Springer.