Skip to main content
SpringerLink
Log in

On Acyclic and Head-Cycle Free Nested Logic Programs

  • Conference paper
Logic Programming (ICLP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3132))

Included in the following conference series:

Abstract

We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive logic programs. We then extend several results known for acyclic and head-cycle free disjunctive programs under the stable-model semantics to the nested case. Most notably, we provide a propositional semantics for the program classes under consideration. This generalises different extensions of Fages’ theorem, including a recent result by Erdem and Lifschitz for tight logic programs. We further show that, based on a shifting method, head-cycle free nested programs can be rewritten into normal programs in polynomial time and space, extending a similar technique for head-cycle free disjunctive programs. All this shows that head-cycle free nested programs constitute a subclass of nested programs possessing a lower computational complexity than arbitrary nested programs, providing the polynomial hierarchy does not collapse.

This work was partially supported by the Austrian Science Fund (FWF) under projects Z29-N04 and P15068-INF, by the German Science Foundation (DFG) under grants FOR 375/1 and SCHA 550/6, TP C, as well as by the European Commission under projects FET-2001-37004 WASP and IST-2001-33570 INFOMIX.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ben-Eliyahu, R., Dechter, R.: Propositional Semantics for Disjunctive Logic Programs. Annals of Mathematics and Artificial Intelligence 12, 53–87 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bidoit, N., Froidevaux, C.: Negation by Default and Unstratifiable Logic Programs. Theoretical Computer Science 78, 85–112 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brass, S., Dix, J.: Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming 38(3), 167–213 (1999)

    Google Scholar 

  4. Brignoli, G., Costantini, S., D’Antona, O., Provetti, A.: Characterizing and Computing Stable Models of Logic Programs: The Non-stratified Case. In: Proc. of the 2nd International Conference on Information Technology (CIT 1999), pp. 197–201 (1999)

    Google Scholar 

  5. Clark, K.L.: Negation as Failure. In Logic and Databases, pp. 293–322. Plenum, New York (1978)

    Google Scholar 

  6. Dix, J., Gottlob, G., Marek, V.: Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations. Fundamenta Informaticae XXVIII(1/2), 87–100 (1996)

    MathSciNet  Google Scholar 

  7. Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Declarative Problem-Solving Using the DLV System. In: Logic-Based Artificial Intelligence, pp. 79–103. Kluwer, Dordrecht (2000)

    Google Scholar 

  8. Eiter, T., Fink, M., Tompits, H., Woltran, S.: On Eliminating Disjunctions in Stable Logic Programming. In: Proc. KR 2004 (2004) (to appear)

    Google Scholar 

  9. Eiter, T., Gottlob, G.: On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Annals of Mathematics and Artificial Intelligence 15(3-4), 289–323 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  10. Erdem, E., Lifschitz, V.: Fages’ Theorem for Programs with Nested Expressions. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, pp. 242–254. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Erdem, E., Lifschitz, V.: Tight Logic Programs. Theory and Practice of Logic Programming 3(4-5), 499–518 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Fages, F.: Consistency of Clark’s Completion and Existence of Stable Models. Methods of Logic in Computer Science 1, 51–60 (1994)

    Google Scholar 

  13. Gelfond, M., Lifschitz, V., Przymusinska, H., Truszczyński, M.: Disjunctive Defaults. In: Proc. KR 1991, pp. 230–237. Morgan Kaufmann, San Francisco (1991)

    Google Scholar 

  14. Inoue, K., Sakama, C.: Negation as Failure in the Head. Journal of Logic Programming 35(1), 39–78 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. Janhunen, T.: On the Effect of Default Negation on the Expressiveness of Disjunctive Rules. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 93–106. Springer, Heidelberg (2001)

    Google Scholar 

  16. Konczak, K., Linke, T., Schaub, T.: Graphs and Colorings for Answer Set Programming: Abridged Report. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 127–140. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  17. Lee, J., Lifschitz, V.: Loop Formulas for Disjunctive Logic Programs. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 451–465. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Lifschitz, V., Tang, L., Turner, H.: Nested Expressions in Logic Programs. Annals ofMathematics and Artificial Intelligence 25(3-4), 369–389 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  19. Lin, F., Zhao, Y.: ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. In: Proc. AAAI 2002, pp. 112–117 (2002)

    Google Scholar 

  20. Linke, T.: Graph Theoretical Characterization and Computation of Answer Sets. In: Proc. IJCAI 2001, pp. 641–645. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  21. Linke, T.: Suitable Graphs for Answer Set Programming. In: Proc. ASP 2003. CEUR Workshop Proceedings, vol. 78, pp. 15–28 (2003)

    Google Scholar 

  22. Linke, T., Anger, C., Konczak, K.: More on noMoRe. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 468–480. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  23. Lloyd, J., Topor, R.: Making Prolog More Expressive. Journal of Logic Programming 3, 225–240 (1984)

    Article  MathSciNet  Google Scholar 

  24. Marek, W., Truszczyński, M.: Autoepistemic Logic. Journal of the ACM 38, 588–619 (1991)

    Article  MATH  Google Scholar 

  25. Pearce, D., Sarsakov, V., Schaub, T., Tompits, H., Woltran, S.: A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 405–420. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  26. Pearce, D., Tompits, H., Woltran, S.: Encodings for EquilibriumLogic and Logic Programs with Nested Expressions. In: Proc. EPIA 2001. LNCS, vol. 2285, pp. 306–320. Springer, Heidelberg (2001)

    Google Scholar 

  27. Simons, P., Niemelä, I., Soininen, T.: Extending and Implementing the Stable Model Semantics. Artificial Intelligence 138, 181–234 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  28. Tarjan, R.: Depth-first Search and Linear Graph Algorithms. SIAM Journal on Computing 1, 146–160 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  29. You, J., Yuan, L., Zhang, M.: On the Equivalence Between Answer Sets and Models of Completion for Nested Logic Programs. In: Proc. IJCAI 2003, pp. 859–865 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Potsdam, Postfach 90 03 27, D-14439, Potsdam, Germany

    Thomas Linke

  2. Institut für Informationssysteme 184/3, Technische Universität Wien, Favoritenstraße 9–11, A-1040, Vienna, Austria

    Hans Tompits & Stefan Woltran

Authors
  1. Thomas Linke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans Tompits
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefan Woltran
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Katholieke Universiteit Leuven, Belgium

    Bart Demoen

  2. Department of Computer Sciences, University of Texas at Austin, USA

    Vladimir Lifschitz

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Linke, T., Tompits, H., Woltran, S. (2004). On Acyclic and Head-Cycle Free Nested Logic Programs. In: Demoen, B., Lifschitz, V. (eds) Logic Programming. ICLP 2004. Lecture Notes in Computer Science, vol 3132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27775-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27775-0_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22671-0

  • Online ISBN: 978-3-540-27775-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation