Skip to main content
SpringerLink
Log in

Partial evaluation and relevance for approximations of the stable semantics

  • Communications
  • Conference paper
  • First Online:
Methodologies for Intelligent Systems (ISMIS 1994)

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

Included in the following conference series:

Abstract

There is no doubt that STABLE and WFS are among the dominant semantics for logic programs. While WFS has many nice structural properties, it is very weak. STABLE allows to derive more atoms, but may become inconsistent and it is not relevant, i.e. the truth value of an atom does not only depend on the call-graph below it. In this paper we consider the problem of defining approximations of STABLE that are both relevant and satisfy a general partial deduction property.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. J. Alferes, C. V. Damasio, and L. M. Pereira. Top-down Query Evaluation for Well-founded Semantics with Explicit Negation. Proc. ECAI. 1994.

    Google Scholar 

  2. S. Brass and J. Dix. A Disjunctive Semantics based on Bottom-Up Evaluation and Unfolding. 13th World Computer Congress IFIP, GI-Workshop W2 (Disjunctive Logic Programming and Disjunctive Databases), 1994.

    Google Scholar 

  3. W. Chen and D. S. Warren. Computation of Stable Models and its Integration with Logical Query Processing. Technical report, SUNY at Stony Brook, 1993.

    Google Scholar 

  4. N. Bidoit and C. Froidevaux. General logical Databases and Programs: Default Logic Semantics and Stratification. Information and Computation, 91:15–54, 1991.

    Google Scholar 

  5. J. Dix. Classifying Semantics of Logic Programs. Logic Programming and Non-Monotonic Reasoning, Proc. 1st Int. Workshop, pp. 166–180. 1991.

    Google Scholar 

  6. J. Dix. A Framework for Representing and Characterizing Semantics of Logic Programs. Principles of Knowledge Representation and Reasoning: Proc. 3rd Int. Conf. (KR '92), pp. 591–602. 1992.

    Google Scholar 

  7. J. Dix. A Classification-Theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundamenta Informaticae, forthcoming, 1994.

    Google Scholar 

  8. J. Dix and M. Müller. The Stable Semantics and its Variants: A Comparison of Recent Approaches. Proc. 18th German Annual Conf. on Artificial Intelligence (KI '94). Springer, LNAI, to appear, 1994.

    Google Scholar 

  9. M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. 5th Int. Conf. on Logic Programming, pp. 1070–1080, 1988.

    Google Scholar 

  10. T. Przymusinski. Well-founded Semantics Coincides With Three-Valued Stable Semantics. Fundamenta Informaticae, XIII:445–463, 1990.

    Google Scholar 

  11. D. Sacca. The Expressive Power of Stable Models For DATALOG Queries with Negation. Proc. Workshop on Logic Programming with Incomplete Information after ILPS' 93, pp. 150–162, 1993.

    Google Scholar 

  12. J. S. Schlipf. Formalizing a Logic for Logic Programming. Annals of Mathematics and Artificial Intelligence, 5:279–302, 1992.

    Google Scholar 

  13. V.S. Subrahmanian, Nau, and Vago. WFS + Branch and Bound = Stable Models. Technical Report CS-TR-2935, Univ. of Maryland, July 1992. To be published with IEEE Transactions on Knowledge and Data Engineering

    Google Scholar 

  14. C. Sakama and H. Seki. Partial Deduction of Disjunctive Logic Programs: A Declarative Approach. Proc. 4th Int. Workshop on Logic Program Synthesis and Transformation (LOPSTR'94). Springer, LNCS, 1994.

    Google Scholar 

  15. A. van Gelder, K. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38:620–650, 1991.

    Google Scholar 

  16. Jia-Huai You and Li-Yan Yuan. Three-valued Formalization of Logic Programming: is it needed. In Proc. of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 172–182. ACM Press, 1990.

    Google Scholar 

  17. J.-H. You and L.-Y. Yuan. On the Equivalence of Semantics for Normal Logic Programs. Proc. Workshop on Logic Programming with Incomplete Information, following ILPS' 93, pp. 161–176, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Koblenz, Rheinau 1, D-56075, Koblenz, Germany

    Jürgen Dix

  2. Graduiertenkolleg Kognition and German Research Center for AI (DFKI), Stuhlsatzenhausweg 3, D-66123, Saarbrücken

    Martin Müller

Authors
  1. Jürgen Dix
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Müller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zbigniew W. Raś Maria Zemankova

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dix, J., Müller, M. (1994). Partial evaluation and relevance for approximations of the stable semantics. In: Raś, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems. ISMIS 1994. Lecture Notes in Computer Science, vol 869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58495-1_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-58495-1_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58495-7

  • Online ISBN: 978-3-540-49010-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation