Skip to main content

Default reasoning via negation as failure

  • Chapter
  • First Online:
Foundations of Knowledge Representation and Reasoning

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

Abstract

We show how recent developments in the study of negation as failure of Logic Programming can be used to define a general framework for Default Reasoning. Negation as failure can be viewed as a form of hypotheses with which we extend the underlying theory, given by the logic program, provided that this extension satisfies an appropriate criterion, called acceptability. The generalization of logic programming to more general representation frameworks is done by adapting this view of NAF and the basic notion of acceptability to the new frameworks. In general, an extension of a given theory by a set of hypotheses (e.g. defaults) is acceptable if it can render any other conflicting extension not acceptable thus ensuring that it is a “self-justified” set of assumptions. We compare our framework with other existing non-monotonic frameworks such as Default Logic and Theorist. In particular, we will show how our framework includes and extends Default Logic.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K.R., Blair, H.A., Walker, A.,: Towards a theory of Declarative Knowledge, in Foundations of Deductive Databases and Logic Programming, (J. Minker ed.), Morgan-Kaufmann, (1988) 89–148.

    Google Scholar 

  2. Brewka G.,: Preferred Subtheories: An Extended Logical Framework for Default Reasoning, in Proc. 11th International Conference on Artificial Intelligence, Detroit, Mi (1989) 1043–1048.

    Google Scholar 

  3. Dung P. M.,: Negation as Hypothesis; An Abductive Foundation for Logic Programming, in Proc. 8th International Conference on Logic Programming, Paris (1991) 3–17.

    Google Scholar 

  4. Dung P. M., Kakas A.C., Mancarella P.,: Negation as Failure Revisited. Technical report, University of Pisa, Pisa (1992).

    Google Scholar 

  5. Eshghi K., Kowalski R.A.,: Abduction Compared with Negation by Failure, in Proc. 6th International Conference on Logic Programming, Lisbon, (1989) 234–255.

    Google Scholar 

  6. Geffner, H.,: Default Reasoning: Causal and Conditional Theories. Ph.D. Thesis, UCLA, Los Angeles, CA (1989).

    Google Scholar 

  7. Gelfond, M., Lifschitz, V.,: The Stable Model Semantics for Logic Programming, in Proc. 5th International Conference on Logic Programming, Washington, Seattle (1988) 1070–1080.

    Google Scholar 

  8. Hunter, A.,: Using priorities in non-monotonic proof theory. Technical report, Imperial College, London (1993).

    Google Scholar 

  9. Kakas A.C., Kowalski R.A., Toni F.,: Abductive Logic Programming. Journal of Logic and Computation 2 no 6 (1993) 719–770.

    Google Scholar 

  10. Kakas A.C., Mancarella P.,: Generalized Stable Models: a Semantics for Abduction, in Proc 9th European Conference on Artificial Intelligence, Stockholm, (1990) 385–391.

    Google Scholar 

  11. Kakas A.C., Mancarella P.,: Negation as Stable Hypotheses, in Proc. of 1st International Workshop on Logic Programming and Non-Monotonic Reasoning, Washington DC, (1991).

    Google Scholar 

  12. Kakas A.C., Mancarella P.,: Preferred Extensions are Partial Stable Models. Journal of Logic Programming (1992).

    Google Scholar 

  13. Kakas A.C., Mancarella P.,: Stable theories for Logic Programs, in Proc. of 1st International Symposium of Logic Programming, San Diego, (1991).

    Google Scholar 

  14. Moore, R.C.,: Semantical Considerations on Nonmonotonic Logic.Journal of Artificial Intelligence, 25 1 (1985) 75–94.

    Google Scholar 

  15. Poole D.L.,: A Logical Framework for Default Reasoning. Journal of Artificial Intelligence 36 (1988) 27–47.

    Google Scholar 

  16. Poole D.L.,: What the Lottery paradox tells us about Default Reasoning, in Proc. 1st International Conference on Principles of Knowledge Representation and Reasoning, Toronto (1989) 301–311.

    Google Scholar 

  17. Poole D.L., Goebel R.G., Aleliunas R.,: Theorist: A logical reasoning system for defaults and diagnosis, in The knowledge Frontier: Essays in the Representation of Knowledge (eds. N. Cercone and G. McCalla), Springer-Verlag, (1987).

    Google Scholar 

  18. Przymusinski, T.C.,: On the Declarative Semantics of Deductive Databases and Logic Programs, in Foundations of Deductive Databases and Logic Programming, (J. Minker ed.), Morgan-Kaufmann, (1988) 193–216.

    Google Scholar 

  19. Przymusinski, T.C.,: Stationary Semantics for Disjunctive Logic Programs and Deductive Databases, in Proc. 1990 North American Conference on Logic Programming (S. Deabray and M. Hermenegildo eds.) MIT Press (1990) 40–60.

    Google Scholar 

  20. Reiter, R.,: A Logic for Default Reasoning. Journal of Artificial Intelligence 13 (1980) 81–132.

    Google Scholar 

  21. Ryan, M.,: Ordered Presentations of Theories-Default Reasoning and Belief Revision. Ph.D. Thesis, Imperial College, London, UK (1992).

    Google Scholar 

  22. Saccà, D., Zaniolo, C.,: Stable Models and Non-Determinism for Logic Programs with Negation, in Proc. ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, (1990) 205–217.

    Google Scholar 

  23. Toni, F., Kakas A. C.,: Computing the Acceptability Semantics. Technical report, Imperial College, (1992).

    Google Scholar 

  24. Van Gelder, A., Ross, K.A., Schlipf, J.S.,: Unfounded sets and the well-founded Semantics for General Logic Programs, in Proc. ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, (1988) 221–230.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Gerhard Lakemeyer Bernhard Nebel

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kakas, A.C. (1994). Default reasoning via negation as failure. In: Lakemeyer, G., Nebel, B. (eds) Foundations of Knowledge Representation and Reasoning. Lecture Notes in Computer Science, vol 810. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58107-3_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-58107-3_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58107-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics