Skip to main content
SpringerLink
Log in

On the Relations between Acceptable Programs and Stratifiable Classes

  • Conference paper
Advances in Artificial Intelligence (SBIA 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1515))

Included in the following conference series:

  • 280 Accesses

Abstract

Acceptable programs [4] play an important role when studying termination of logic programs, in the sense that this class matches the class of non-floundering left terminating programs. Moreover, various ways of defining semantics coincide for acceptable programs. In this paper, we study inclusion relations between this class and stratifiable classes, e.g. locally stratified [19,15], weakly stratified [14], effectively stratified [6], and support-stratified programs [9]. In particular, we show that every acceptable program is weakly stratified.

This work is part of the project LOGIA / ProTeM - CC / CNPq. The authors are partially financially supported by CNPq.

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.

References

  1. Apt, K.R., Bol, R.: Logic programming and negation: a survey. Journal of Logic Programming 19–20, 9–71 (1994)

    MathSciNet  Google Scholar 

  2. Apt, K.R., Blair, H., Walker, A.: Towards a theory of declarative knowledge. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 89–142. Morgan Kaufmann, Los Altos (1988)

    Google Scholar 

  3. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)

    MATH  Google Scholar 

  4. Apt, K.R., Pedresci, D.: Reasoning about termination of pure prolog programs. Information and Computation 106, 109–157 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bezem, M.: Characterizing termination of logic programs with level mappings. In: Lusk, E.L., Overbeek, R.A. (eds.) Proceedings of the North American Conference on Logic Programming. MIT Press, Cambridge (1989)

    Google Scholar 

  6. Bidoit, N., Froidevaux, C.: Negation by default and unstratifiable logic programs. Theoretical Computer Science 78, 85–112 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cavedon, L.: Continuity, consistency, and completeness properties for logic programs. In: Levi, G., Martelli, M. (eds.) Proceedings of the Sixth International Conference on Logic Programming, pp. 571–584. MIT Press, Cambridge (1989)

    Google Scholar 

  8. Dimopoulos, Y., Magirou, V., Papadimitriou, C.H.: On kernels, defaults and even graphs. Technical Report MPI-I-93-264, Max-Planck-Institut für Informatik, Germany

    Google Scholar 

  9. Dimopoulos, Y., Torres, A.: Graph theoretical structures in logic programs and default theories. Theoretical Computer Science 170, 209–244 (1996)

    MATH  MathSciNet  Google Scholar 

  10. Etherington, D.W.: Formalizing nonmonotonic reasoning systems. Artificial Intelligence 31, 41–85 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  11. Garcez, A., Zaverucha, G., Silva, V.: Applying the Connectionist Inductive Learning and Logic Programming System to Power System Diagnosis. In: Proceedings of the IEEE / INNS International Conference on Neural Networks (ICNN 1997), Houston, Texas, USA, June 9-12, vol. 1, pp. 121–126 (1997)

    Google Scholar 

  12. Holldobler, S., Kalinke, Y.: Toward a new massively parallel computational model for logic programming. In: Workshop on Combining Symbolic and Connectionist Processing (ECAI 1994), pp. 1–14 (1994)

    Google Scholar 

  13. Kunen, K.: Signed data dependencies in logic programming. J. Logic Programming 7, 231–245 (1989)

    Article  MathSciNet  Google Scholar 

  14. Przymusinska, H., Przymusinski, T.C.: Weakly perfect model semantics for logic programs. In: Proc. Logic Programming Conf. Seattle, pp. 1106–1120 (1988)

    Google Scholar 

  15. Przymusinski, T.: On the declarative semantics of logic programs with negation. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 193–216. Morgan Kaufmann, Los Altos (1988)

    Google Scholar 

  16. Papadimitriou, C.H., Sideri, M.: Default theories that always have extensions. Artificial Intelligence 69, 347–357 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  17. Sato, T.: Completed logic programs and their consistency. J. Logic Programming 9, 33–44 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  18. Sterling, L., Shapiro: The Art of Prolog. MIT Press, Cambridge (1986)

    MATH  Google Scholar 

  19. Van Gelder, A.: Negation as failure using tight derivations for general logic programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 149–176. Morgan Kaufmann, Los Altos (1988)

    Google Scholar 

  20. Van Gelder, A., Roth, R., Schlipf, J.S.: Unfounded sets and well founded semantics for general logic programs. In: Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, pp. 221–230 (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. COPPE – PESC, Universidade Federal do Rio de Janeiro,  

    F. Protti & G. Zaverucha

Authors
  1. F. Protti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Zaverucha
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Instituto de Informática - PUCRS, Av. Ipiranga 6681, prédio 30, bloc 4, 90619-900, Porto Alegre, RS, Brazil

    Flávio Moreira de Oliveira

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Protti, F., Zaverucha, G. (1998). On the Relations between Acceptable Programs and Stratifiable Classes. In: de Oliveira, F.M. (eds) Advances in Artificial Intelligence. SBIA 1998. Lecture Notes in Computer Science(), vol 1515. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10692710_15

Download citation

  • DOI: https://doi.org/10.1007/10692710_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65190-1

  • Online ISBN: 978-3-540-49523-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation