On Acyclic and Head-Cycle Free Nested Logic Programs

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

Volumn 3132, Issue , 2004, Pages 225-239

  Linke, Thomas ^a   Tompits, Hans ^b   Woltran, Stefan ^b  

^a UNIVERSITY OF POTSDAM   (Germany)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; POLYNOMIAL APPROXIMATION; RECONFIGURABLE HARDWARE; SEMANTICS;

DISJUNCTIVE LOGIC PROGRAMS; LOGIC PROGRAMS; POLYNOMIAL HIERARCHIES; POLYNOMIAL-TIME; STABLE MODEL SEMANTICS;

LOGIC PROGRAMMING;

EID: 27144473562     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27775-0_16     Document Type: Article

References (29)

1. R. Ben-Eliyahu and R. Dechter. Prepositional Semantics for Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence, 12:53-87, 1994.
2. N. Bidoit and C. Froidevaux. Negation by Default and Unstratifiable Logic Programs. Theoretical Computer Science, 78:85-112, 1991.
3. S. Brass and J. Dix. Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming, 38(3):167-213, 1999.
4. G. Brignoli, S. Costantini, O. D'Antona, and A. Provetti. Characterizing and Computing Stable Models of Logic Programs: The Non-stratified Case. In Proc. of the 2nd International Conference on Information Technology (CIT-99), pp. 197-201, 1999.
5. K. L. Clark. Negation as Failure. In Logic and Databases, pp. 293-322. Plenum, 1978.
6. J. Dix, G. Gottlob, and V. Marek. Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations. Fundamenta Informaticae, XXVIH(1/2):87-100, 1996.
7. T. Eiter, W. Faber, N. Leone, and G. Pfeifer. Declarative Problem-Solving Using the DLV System. In Logic-Based Artificial Intelligence, pp. 79-103. Kluwer, 2000.
8. T. Eiter, M. Fink, H. Tompits, and S. Woltran. On Eliminating Disjunctions in Stable Logic Programming. In Proc. KR-04,2004. To appear.
9. T. Eiter and G. Gottlob. On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Annals of Mathematics and Artificial Intelligence, 15(3-4):289-323, 1995.
10. E. Erdem and V. Lifschitz. Fages' Theorem for Programs with Nested Expressions. In Proc. ICLP-01, LNCS 2237, pp. 242-254, Springer, 2001.
11. E. Erdem and V. Lifschitz. Tight Logic Programs. Theory and Practice of Logic Programming, 3(4-5):499-518, 2003.
12. F. Fages. Consistency of Clark's Completion and Existence of Stable Models. Methods of Logic in Computer Science, 1:51-60, 1994.
13. M. Gelfond, V. Lifschitz, H. Przymusinska, and M. Truszczynski. Disjunctive Defaults. In Proc. KR-91, pp. 230-237. Morgan Kaufmann, 1991.
14. K. Inoue and C. Sakama. Negation as Failure in the Head. Journal of Logic Programming, 35(1):39-78, 1998.
15. T. Janhunen. On the Effect of Default Negation on the Expressiveness of Disjunctive Rules. In Proc. LPNMR-01, LNCS 2173, pp. 93-106, Springer, 2001.
16. K. Konczak, T. Linke, and T. Schaub. Graphs and Colorings for Answer Set Programming: Abridged Report. In Proc. LPNMR-04, LNCS 2923, pp. 127-140. Springer, 2004.
17. J. Lee and V. Lifschitz. Loop Formulas for Disjunctive Logic Programs. In Proc. ICLP-03, LNCS 2916, pp. 451-465, Springer, 2003.
18. V. Lifschitz, L. Tang, and H. Turner. Nested Expressions in Logic Programs. Annals of Mathematics and Artificial Intelligence, 25(3-4):369-389, 1999.
19. F. Lin and Y. Zhao. ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. In Proc. AAAI-02, pp. 112-117, 2002.
20. T. Linke. Graph Theoretical Characterization and Computation of Answer Sets. In Proc. IJCAI-01, pp. 641-645. Morgan Kaufmann, 2001.
21. T. Linke. Suitable Graphs for Answer Set Programming. In Proc. ASP-03, pp. 15-28. CEUR Workshop Proceedings, volume 78, 2003.
22. T. Linke, C. Anger, and K. Konczak. More on noMoRe. In Proc. JELIA-02, LNCS 2424, pp. 468-480, Springer, 2002.
23. J. Lloyd and R. Topor. Making Prolog More Expressive. Journal of Logic Programming, 3:225-240, 1984.
24. W. Marek and M. Truszczynski. Autoepistemic Logic. Journal of the ACM, 38:588-619, 1991.
25. D. Pearce, V. Sarsakov, T. Schaub, H. Tompits, and S. Woltran. A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. In Proc. ICLP-02, LNCS 2401, pp. 405-420. Springer, 2002.
26. D. Pearce, H. Tompits, and S. Woltran. Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. In Proc. EPIA-01, LNCS 2285, pp. 306-320. Springer, 2001.
27. P. Simons, I. Niemelä, and T. Soininen. Extending and Implementing the Stable Model Semantics. Artificial Intelligence, 138:181-234, 2002.
28. R. Tarjan. Depth-first Search and Linear Graph Algorithms. SIAM Journal on Computing, 1:146-160, 1972.
29. J. You, L. Yuan, and M. Zhang. On the Equivalence Between Answer Sets and Models of Completion for Nested Logic Programs. In Proc. IJCAI-03, pp. 859-865, 2003.