[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Dualities between alternative semantics for logic programming and nonmonotonic reasoning

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

The Gelfond-Lifschitz operator associated with a logic program (and likewise the operator associated with default theories by Reiter) exhibits oscillating behavior. In the case of logic programs, there is always at least one finite, nonempty collection of Herbrand interpretations around which the Gelfond-Lifschitz operator ‘bounces around’. The same phenomenon occurs with default logic when Reiter's operator ГΔ is considered. Based on this, a ‘stable class’ semantics and ‘extension class’ semantics has been proposed. The main advantage of this semantics was that it was defined for all logic programs (and default theories), and that this definition was modelled using the standard operators existing in the literature such as Reiter's ГΔ operator. In this paper our primary aim is to prove that there is a very interestingduality between stable class theory and the well-founded semantics for logic programming. In the stable class semantics, classes that were minimal with respect to Smyth's power-domain ordering were selected. We show that the well-founded semantics precisely corresponds to a class that is minimal w.r.t. Hoare's power domain ordering: the well-known dual of Smyth's ordering. Besides this elegant duality, this immediately suggests how to define a well-founded semantics for default logic in such a way that the dualities that hold for logic programming continue to hold for default theories. We show how the same technique may be applied to ‘strong’ autoepistemic logic: the logic of strong expansions proposed by Marek and Truszczynski.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Bidoit, N. and Froidevaux, C., ‘General logicl databases and programs default logic semantics and stratification’,J. Information and Computation, in print (1988).

  2. Baral, C. and Subrahmanian, V. S., ‘Stable and extension class theory for logic programs and default logics’, technical report CS-TR-2402, Dept of Computer Science, University of Maryland (February 1990). Presented at the Third International Workshop on Non-Monotonic Reasoning, South Lake Tahoe, May 1990.J. Automated Reasoning 8, 345–366 (1992).

    Google Scholar 

  3. Van Gelder, A., ‘The alternating fixpoint of logic programs with negation’, inProceedings of the Symposium on Principles of Database Systems (1989) pp. 1–10.

  4. Gelfond, M. and Lifschitz, V., ‘The stable model semantics for logic programming’,Proc. 5th International Conference and Symposium on Logic Programming (eds. R. A. Kowalski and K. A. Bowen), pp. 1070–1080, Seattle, Washington, August 15–19 (1988).

  5. Gelfond, M. and Lifschitz, V.,Logic Programs with Classical Negation. Proc. 7th International Conference on Logic Programming, MIT Press, pp. 579–597, 1991.

  6. Konolige, K., ‘On the relation between default and autoepistemic logic’,Artificial Intelligence 35, 343–382 (1988).

    Google Scholar 

  7. Lloyd, J.,Foundations of Logic Programming, Springer-Verlag, 2nd edition (1987).

  8. Marek, W., ‘Stable theories in autoepistemic logic’,Fundamenta Informaticae 12, 243–254 (1989).

    Google Scholar 

  9. Marek, W. and Subrahmanian, V. S., ‘The relationship between stable, supported, default and auto-epistemic semantics for general logic programs’, inProc. ICLP 89 (eds. G. Levi and M. Martelli), pp. 600–620, 1989. Extended version inTheoretical Computer Science, Vol. 103, pp. 365–386 (1992).

  10. Marek, W. and Truszczynski, M., ‘Relating autoepistemic and default logics’, technical report, Department of Computer Science, University of Kentucky at Lexington (1989). Also appears inProc. KR 89.

  11. Marek, W. and Truszczynski, M., ‘Stable semantics for logic programs and default theories’, inProceedings of NACLP 89, pp. 243–256 (1989).

  12. Marek, W., Shvarts, G., Truszczynski, M., ‘Modal non-monotonic logics: ranges, characterization, computation’, to appear inProc. KR 91.

  13. McDermott, D., ‘Non-monotonic logic II: Non-monotonic modal theories’,J. ACM 29, 33–57 (1982).

    Google Scholar 

  14. Moore, R., ‘Semantical considerations on nonmonotonic logic’,Artificial Intelilgence 25, 75–94 (1985).

    Google Scholar 

  15. Przymusinski, T., ‘Three-valued formalizations of non-monotonic reasoning and logic programming’, inProc. First International Conference on Knowledge Representation and Reasoning (1989).

  16. Reiter, R., ‘A logic for default reasoning’,Artificial Intelligence 13 (1 or 2), 81–132 (1980).

    Google Scholar 

  17. Shvarts, G., ‘Auto-epistemic modal logics’, inProc. TARAK-1990 (R. Parikh, ed.), pp. 97–109, Morgan Kaufmann (1990).

  18. Smyth, M., ‘Power domains’,J. Computer and System Sciences 16(1), 23–36 (1978).

    Google Scholar 

  19. Van Gelder, A., Ross, K., and Schlipf, J. S., ‘Unfounded sets and well-founded semantics for general logic programs’, inProc. 7th Symposium on Principles of Database Systems, pp. 221–230 (1988). Full version inJACM 38(3), 620–650 (1991).

Download references

Author information

Author notes

  1. Chitta R. Baral

    Present address: Department of Computer Science, University of Texas at El Paso, 79968, El Paso, TX, USA

Authors and Affiliations

  1. Institute for Advanced Computer Studies and Department of Computer Science, University of Maryland, 20742, College Park, MD, USA

    Chitta R. Baral & V. S. Subrahmanian

Authors
  1. Chitta R. Baral
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. S. Subrahmanian
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baral, C.R., Subrahmanian, V.S. Dualities between alternative semantics for logic programming and nonmonotonic reasoning. J Autom Reasoning 10, 399–420 (1993). https://doi.org/10.1007/BF00881799

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00881799

Key words

Search

Navigation