Computing stable models: Worst-case performance estimates

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2401 LNCS, Issue , 2002, Pages 347-362

  Lonc, Zbigniew ^a   Truszczyński, Miroslaw ^b  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF KENTUCKY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; LOGIC PROGRAMMING; ALGORITHMS; COMPUTATION THEORY; RECONFIGURABLE HARDWARE;

INPUT PROGRAMS; LITERALS; PROPOSITIONAL LOGIC; STABLE MODEL; WORST-CASE PERFORMANCE;

COMPUTER CIRCUITS;

EID: 84888217420     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45619-8_24     Document Type: Conference Paper

References (14)

1. [Apt90] K. Apt. Logic programming. In J. van Leeuven, editor, Handbook of theoretical computer science, pages 493-574. Elsevier, Amsterdam, 1990.
2. [BE96] P. A. Bonatti and T. Eiter. Querying Disjunctive Databases Through Nonmonotonic Logics. Theoretical Computer Science, 160:321-363, 1996.
3. [CT99] P. Cholewinski and M. Truszczynski. Extremal problems in logic programming and stable model computation. Journal of Logic Programming, 38:219- 242, 1999.
4. [Dix95] J. Dix. A classification theory of semantics of normal logic programs: Ii, weak properties. Fundamenta Informaticae, 22(3):257 - 288, 1995.
5. [EFLP00] T. Eiter, W. Faber, N. Leone, and G. Pfeifer. Declarative problem-solving in DLV. In Jack Minker, editor, Logic-Based Artificial Intelligence, pages 79-103. Kluwer Academic Publishers, Dordrecht, 2000.
6. [GL88] M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, Proceedings of the 5th International Conference on Logic Programming, pages 1070-1080. MIT Press, 1988.
7. [Knu98] D. E. Knuth. The Art of Computer Programming, volume 3. Addison Wesley, 1998. Second edition.
8. [Kul99] O. Kullmann. New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science, pages 1-72, 1999.
9. [MM65] J. W. Moon and L. Moser. On cliques in graphs. Israel J. Math, pages 23-28, 1965.
10. [MNR94] W. Marek, A. Nerode, and J. B. Remmel. The stable models of predicate logic programs. Journal of Logic Programming, 21(3):129-154, 1994.
11. [MS85] B. Monien and E. Speckenmeyer. Solving satisfiability in less than 2n steps. Discrete Applied Mathematics, pages 287-295, 1985.
12. [MT93] W. Marek and M. Truszczynski. Nonmonotonic logics; context-dependent reasoning. Springer-Verlag, Berlin, 1993.
13. [NS00] I. Niemela and P. Simons. Extending the smodels system with cardinality and weight constraints. In J. Minker, editor, Logic-Based Artificial Intelligence, pages 491-521. Kluwer Academic Publishers, 2000.
14. [SNV95] V. S. Subrahmanian, D. Nau, and C. Vago. WFS + branch bound = stable models. IEEE Transactions on Knowledge and Data Engineering, 7:362- 377, 1995.