Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming

Principles of Knowledge Representation and Reasoning: Proceedings of the 9th International Conference, KR 2004

Volumn , Issue , 2004, Pages 377-387

  Eiter, Thomas ^a   Faber, Wolfgang ^a   Fink, Michael ^a   Pfeifer, Gerald ^b   Woltran, Stefan ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b SUSE LINUX AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; MODEL CHECKING;

ANSWER SET; ANSWER SET PROGRAMMING; COMPLEXITY RESULTS; COMPUTATION TASKS; KNOWLEDGE-REPRESENTATION; KR LANGUAGES; LOGIC PROGRAMS; MODELS CHECKING; PROGRAMMING SYSTEM; REASONING TASKS;

KNOWLEDGE REPRESENTATION;

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

References (30)

1. Abiteboul, S.; Hull, R.; and Vianu, V. 1995. Foundations of Databases. Addison-Wesley.
2. Anger, C.; Konczak, K.; and Linke, T. 2001. NoMoRe: A System for Non-Monotonic Reasoning. In Eiter, T.; Faber, W.; and Truszczyński, M., eds., Logic Programming and Nonmonotonic Reasoning - 6th International Conference, LPNMR'01, Vienna, Austria, September 2001, Proceedings, number 2173 in Lecture Notes in AI (LNAI), 406-410. Springer Verlag.
3. Apt, K. R.; Blair, H. A.; and Walker, A. 1988. Towards a Theory of Declarative Knowledge. In Minker, J., ed., Foundations of Deductive Databases and Logic Programming. Washington DC: Morgan Kaufmann Publishers, Inc. 89-148.
4. Ben-Eliyahu, R., and Dechter, R. 1994. Propositional Semantics for Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence 12:53-87.
5. Ben-Eliyahu-Zohary, R., and Palopoli, L. 1997. Reasoning with Minimal Models: Efficient Algorithms and Applications. Artificial Intelligence 96:421-449.
6. Bonatti, P. A. 2001. Resolution for Skeptical Stable Model Semantics. Journal of Automated Reasoning 27(4):391-421.
7. Buccafurri, F.; Leone, N.; and Rullo, P. 2000. Enhancing Disjunctive Datalog by Constraints. IEEE Transactions on Knowledge and Data Engineering 12(5):845-860.
8. Dantsin, E.; Eiter, T.; Gottlob, G.; and Voronkov, A. 2001. Complexity and Expressive Power of Logic Programming. ACM Computing Surveys 33(3):374-425.
9. 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.
10. Eiter, T.; Gottlob, G.; and Mannila, H. 1997. Disjunctive Datalog. ACM Transactions on Database Systems 22(3):364-418.
11. Eiter, T.; Leone, N.; and Saccà, D. 1998. Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases. Theoretical Computer Science 206(1-2):181-218.
12. Gelfond, M., and Lifschitz, V. 1991. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9:365-385.
13. Gottlob, G.; Leone, N.; and Veith, H. 1999. Succinctness as a Source of Expression Complexity. Annals of Pure and Applied Logic 97(1-3):231-260.
14. Greco, S. 1999. Optimization of Disjunction Queries. In Schreye, D. D., ed., Proceedings of the 16th International Conference on Logic Programming (ICLP'99), 441-455. Las Cruces, New Mexico, USA: The MIT Press.
15. Greco, S. 2003. Binding Propagation Techniques for the Optimization of Bound Disjunctive Queries. IEEE Transactions on Knowledge and Data Engineering 15(2):368-385. Extended Abstract appeared as (Greco 1999).
16. Janhunen, T.; Niemelä, I.; Simons, P.; and You, J.-H. 2000. Partiality and Disjunctions in Stable Model Semantics. In Cohn, A. G.; Giunchiglia, F.; and Selman, B., eds., Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2000), April 12-15, Breckenridge, Colorado, USA, 411-419. Morgan Kaufmann Publishers, Inc.
17. Johnson, D. S. 1990. A Catalog of Complexity Classes. In van Leeuwen, J., ed., Handbook of Theoretical Computer Science, volume A. Elsevier Science Pub. chapter 2.
18. Johnson, C. A. 2003. Computing only minimal answers in disjunctive deductive databases. Technical Report cs.LO/0305007, arXiv.org.
19. Leone, N.; Pfeifer, G.; Faber, W.; Eiter, T.; Gottlob, G.; Perri, S.; and Scarcello, F. 2002. The DLV System for Knowledge Representation and Reasoning. Technical Report cs.AI/0211004, arXiv.org. To appear in ACM TOCL.
20. Lierler, Y., and Maratea, M. 2004. Cmodels-2: Sat-based answer set solver enhanced to non-tight programs. In Lifschitz, V., and Niemelä, I., eds., Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-7), number 2923 in Lecture Notes in Computer Science, 346-350. Fort Lauderdale, Florida, USA: Springer.
21. Lin, F., and Zhao, Y. 2002. ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-2002), 112-117. Edmonton, Alberta, Canada: AAAI Press/MIT Press.
22. Marek, V. W., and Truszczyński, M. 1991. Autoepistemic Logic. Journal of the ACM 38(3):588-619.
23. Nicolas, P.; Saubion, F.; and Stéphan, I. 2002. Answer Set Programming by Ant Colony Optimization. In Flesca, S.; Greco, S.; Ianni, G.; and Leone, N., eds., Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA 2002), number 2424 in Lecture Notes in Computer Science, 481-492. Cosenza, Italy: Springer.
24. Papadimitriou, C. H. 1994. Computational Complexity. Addison-Wesley.
25. Provetti, A., and Son, T. C., eds. 2001. Proceedings AAAI 2001 Spring Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning. Stanford, CA: AAAI Press.
26. Przymusinski, T. C. 1988. On the Declarative Semantics of Deductive Databases and Logic Programs. In Minker, J., ed., Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann Publishers, Inc. 193-216.
27. Simons, P.; Niemelä, I.; and Soininen, T. 2002. Extending and Implementing the Stable Model Semantics. Artificial Intelligence 138:181-234.
28. Swift, T. 2004. Deduction in Ontologies via ASP. In Lifschitz, V., and Niemelä, I., eds., Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-7), number 2923 in Lecture Notes in Computer Science, 275-288. Fort Lauderdale, Florida, USA: Springer.
29. Vardi, M. 1995. On the Complexity of Bounded-Variable Queries. In Proceedings PODS-95, 266-276.
30. Yahya, A. H. 2002. Duality for Goal-Driven Query Processing in Disjunctive Deductive Databases. Journal of Automated Reasoning 28(1):1-34.