Extended ASP Tableaux and rule redundancy in normal logic programs

Theory and Practice of Logic Programming

Volumn 8, Issue 5-6, 2008, Pages 691-716

  Järvisalo, Matti ^a   Oikarinen, Emilia ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Answer set programming; Extension rule; Problem structure; Proof complexity; Tableau method

Indexed keywords

BIOMINERALIZATION; COMPUTER PROGRAMMING; COMPUTER SCIENCE; DIFFERENTIATION (CALCULUS); LOGIC PROGRAMMING;

ANSWER SET PROGRAMMING; EXTENSION RULE; PROBLEM STRUCTURE; PROOF COMPLEXITY; TABLEAU METHOD;

SEMANTIC WEB;

EID: 56749097746     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068408003578     Document Type: Article

References (43)

1. ANGER, C., GEBSER, M., JANHUNEN, T. AND SCHAUB, T. 2006. What's a head without a body? In Proceedings of the 17th European Conference on Artificial Intelligence (ECAI 2006), G. Brewka, S. Coradeschi, A. Perini and P. Traverso, Eds. IOS Press, Amsterdam, the Netherlands, 769-770.
2. ANGER, C., GEBSER, M., LINKE, T., NEUMANN, A. AND SCHAUB, T. 2005. The nomore++ approach to answer set solving. In Proceedings of the 12th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2005), G. Sutcliffe and A. Voronkov, Eds. Lecture Notes in Computer Science, vol. 3835. Springer, Heidelberg, Germany, 95-109.
3. BARAL, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge, UK.
4. BEAME, P., KAUTZ, H. AND SABHARWAL, A. 2004. Towards understanding and harnessing the potential of clause learning. Journal of Artificial Intelligence Research 22, 319-351.
5. BEAME, P. AND PITASSI, T. 1998. Propositional proof complexity: Past, present, and future. Bulletin of the EATCS 65, 66-89.
6. BEN-ELIYAHU, R. AND DECHTER, R. 1994. Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence 12(1-2), 53-87.
7. BEN-SASSON, E., IMPAGLIAZZO, R. AND WIGDERSON, A. 2004. Near optimal separation of tree-like and general resolution. Combinatorica 24 (4), 585-603.
8. BRASS, S. AND DIX, J. 1995. Characterizations of the stable semantics by partial evaluation. In Proceedings of the 3rd International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 1995), V. W. Marek and A. Nerode, Eds. Lecture Notes in Computer Science, vol. 928. Springer, Heidelberg, Germany, 85-98.
9. BROOKS, D. R., ERDEM, E., ERDOGAN, S. T., MINETT, J. W. AND RINGE, D. 2007. Inferring phylogenetic trees using answer set programming. Journal of Automated Reasoning 39(4), 471-511.
10. CLARK, K. L. 1978. Negation as failure. In Logic and Data Bases, H. Gallaire and J. Minker, Eds. Plenum Press, New York, USA, 293-322.
11. COOK, S. A. 1976. A short proof of the pigeon hole principle using extended resolution. SIGACT News 8(4), 28-32.
12. COOK, S. A. AND RECKHOW, R. A. 1979. The relative efficiency of propositional proof systems. Journal of Symbolic Logic 44(1), 36-50.
13. DAVIS, M., LOGEMANN, G. AND LOVELAND, D. 1962. A machine program for theorem proving. Communications of the ACM 5(7), 394-397.
14. DAVIS, M. AND PUTNAM, H. 1960. A computing procedure for quantification theory. Journal of the ACM 7(3), 201-215.
15. EITER, T., FINK, M., TOMPITS, H. AND 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), V. Lifschitz and I. Niemelä, Eds. Lecture Notes in Computer Science, vol. 2923. Springer, Heidelberg, Germany, 87-99.
16. ERDEM, E., LIFSCHITZ, V. AND RINGE, D. 2006. Temporal phylogenetic networks and logic programming. Theory and Practice of Logic Programming 6(5), 539-558.
17. FAGES, F. 1994. Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science 1, 51-60.
18. GEBSER, M., KAUFMANN, B., NEUMANN, A. AND SCHAUB, T. 2007. Conflict-driven answer set solving. In Proceedings of the 20th International Joint Conference on Articifial Intelligence (IJCAI 2007), M. M. Veloso, Ed., AAAI Press, California, USA, 286-392.
19. GEBSER, M. AND SCHAUB, T. 2006a. Characterizing ASP inferences by unit propagation. In ICLP Workshop on Search and Logic: Answer Set Programming and SAT, E. Giunchiglia, V. Marek, D. Mitchell and E. Ternovska, Eds., AAAI Press, California, USA, 41-56.
20. GEBSER, M. AND SCHAUB, T. 2006b. Tableau calculi for answer set programming. In Proceedings of the 22nd International Conference on Logic Programming (ICLP 2006), S. Etalle and M. Truszczynski, Eds. Lecture Notes in Computer Science, vol. 4079. Springer, Heidelberg, Germany, 11-25.
21. GEBSER, M. AND SCHAUB, T. 2007. Generic tableaux for answer set programming. In Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007), V. Dahl and I. Niemelä, Eds. Lecture Notes in Computer Science, vol. 4670. Springer, Heidelberg, Germany, 119-133.
22. GELFOND, M. AND LEONE, N. 2002. Logic programming and knowledge representation - The A-Prolog perspective. Artificial Intelligence 138(1-2), 3-38.
23. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In Proceedings of the 5th International Conference and Symposium on Logic Programming (ICLP/SLP 1988), R. A. Kowalski and K. A. Bowen, Eds. MIT Press, Cambridge, Massachusetts, USA, 1070-1080.
24. GIUNCHIGLIA, E., LIERLER, Y. AND MARATEA, M. 2006. Answer set programming based on propositional satisfiability. Journal of Automated Reasoning 36(4), 345-377.
25. GIUNCHIGLIA, E. AND MARATEA, M. 2005. On the relation between answer set and SAT procedures (or, between CMODELS and SMODELS). In Proceedings of the 21st International Conference on Logic Programming (ICLP 2005), M. Gabbrielli and G. Gupta, Eds. Lecture Notes in Computer Science, vol. 3668. Springer, Heidelberg, Germany, 37-51.
26. HAI, L., JIGUI, S. AND YIMIN, Z. 2003. Theorem proving based on the extension rule. Journal of Automated Reasononing 31 (1), 11-21.
27. HAKEN, A. 1985. The intractability of resolution. Theoretical Computer Science 39 (2-3), 297-308.
28. JANHUNEN, T. 2006. Some (in)translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics 16(1-2), 35-86.
29. JÄRVISALO, M. AND JUNTTILA, T. in press. Limitations of restricted branching in clause learning. Constraints.
30. JARVISALO, M. AND OIKARINEN, E. 2007. Extended ASP tableaux and rule redundancy in normal logic programs. In Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007), V. Dahl and I. Niemelä, Eds. Lecture Notes in Computer Science, vol. 4670. Springer, Heidelberg, Germany, 134-148.
31. LEONE, N., PFEIFER, G., FABER, W., EITER, T., GOTTLOB, G., PERRI, S. AND SCARCELLO, F. 2006. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7(3), 499-562.
32. LIFSCHITZ, V. 2002. Answer set programming and plan generation. Artificial Intelligence 138 (1-2), 39-54.
33. LIFSCHITZ, V. AND RAZBOROV, A. 2006. Why are there so many loop formulas? ACM Transactions on Computational Logic 7(2), 261-268.
34. LIFSCHITZ, V. AND TURNER, H. 1994. Splitting a logic program. In Proceedings of the 11th International Conference on Logic Programming, P. V. Hentenryck, Ed. MIT Press, Cambridge, Massachusetts, USA, 23-37.
35. LIN, F. AND ZHAO, J. 2003. On tight logic programs and yet another translation from normal logic programs to propositional logic. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), G. Gottlob and T. Walsh, Eds. Morgan Kaufmann, San Francisco, California, USA, 853-858.
36. LIN, F. AND ZHAO, Y. 2004. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157(1-2), 115-137.
37. MAREK, V. W. AND TRUSZCZYŃSKI, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-Year Perspective, K. R. Apt, V. W. Marek, M. Truszczyński, and D. S. Warren, Eds. Springer, Heidelberg, Germany, 375-398.
38. MOSKEWICZ, M. W., MADIGAN, C. F., ZHAO, Y., ZHANG, L. AND MALIK, S. 2001. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC 2001). IEEE, USA, 530-535.
39. 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.
40. NOGUEIRA, M., BALDUCCINI, M., GELFOND, M., WATSON, R. AND 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), I. V. Ramakrishnan, Ed. Lecture Notes in Computer Science, vol. 1990. Springer, Heidelberg, Germany, 169-183.
41. SIMONS, P., NIEMELÄ, I. AND SOININEN, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181-234.
42. SOININEN, T., NIEMELÄ, I., TIIHONEN, J. AND SULONEN, R. 2001. Representing configuration knowledge with weight constraint rules. In Proceedings of the 1st International Workshop on Answer Set Programming: Towards Efficient and Scalable Knowledge (ASP 2001), A. Provetti and T. C. Son, Eds.
43. TSEITIN, G. S. 1969. On the complexity of derivation in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic, Part II, A. Slisenko, Ed. Seminars in Mathematics, V.A. Steklov Mathematical Institute, Leningrad, vol. 8. Consultants Bureau, 115-125. English translation appears in Automation of Reasoning 2: Classical Papers on Computational Logic 1967-1970 J. Siekmann and G. Wrightson, Eds. Springer (1983), 466-483.