Skip to main content

A Comparison of Sceptical NAF-Free Logic Programming Approaches

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 1999)

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

  • 276 Accesses

Abstract

Recently there has been increased interest in logic programming- based default reasoning approaches which are not using negation-as failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. Historically the first logic in this class was Defeasible Logic. In this paper we will study its relationship to other approaches which also rely on the idea of using logic rules and priorities. In particular we will study sceptical LPwNF, courteous logic programs, and priority logic.

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

Access this chapter

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. G. Antoniou. Nonmonotonic Reasoning. MIT Press 1997.

    Google Scholar 

  2. G. Antoniou, D. Billington, and M.J. Maher. Normal forms for defeasible logic. In Proc. 1998 Joint International Conference and Symposium on Logic Programming, MIT Press 1998.

    Google Scholar 

  3. D. Billington, K. de Coster and D. Nute. A modular translation from defeasible nets to defeasible logic. Journal of Experimental and Theoretical Artificial Intelligence 2 (1990): 151–177.

    Article  Google Scholar 

  4. D. Billington. Defeasible Logic is Stable. Journal of Logic and Computation 3 (1993): 370–400.

    Article  MathSciNet  Google Scholar 

  5. M.A. Covington, D. Nute and A. Vellino. Prolog Programming in Depth. Prentice Hall 1997.

    Google Scholar 

  6. Y. Dimopoulos and A. Kakas. Logic Programming without Negation as Failure. In Proc. ICLP-95, MIT Press 1995.

    Google Scholar 

  7. B.N. Grosof. Prioritized Conflict Handling for Logic Programs. In Proc. Int. Logic Programming Symposium, J. Maluszynski (Ed.), 197–211. MIT Press, 1997.

    Google Scholar 

  8. J.F. Horty, R.H. Thomason and D. Touretzky. A skeptical theory of inheritance in nonmonotonic semantic networks. In Proc. AAAI-87, 358–363.

    Google Scholar 

  9. J.F. Horty. Some direct theories of nonmonotonic inheritance. In D.M. Gabbay, C.J. Hogger and J.A. Robinson (eds): Handbook of Logic in Artificial Intelligence and Logic Programming Vol. 3, Clarendon Press 1994, 111–187.

    Google Scholar 

  10. A.C. Kakas, P. Mancarella and P.M. Dung. The Acceptability Semantics for Logic Programs. In Proc. Eleventh International Conference on Logic Programming,(ICLP’94), 504–519, MIT Press 1994

    Google Scholar 

  11. M.J. Maher, G. Antoniou and D. Billington. A Study of Provability in Defeasible Logic. In Proc. 11th Australian Joint Conference on Artificial Intelligence, LNAI 1502, Springer 1998, 215–226.

    Google Scholar 

  12. D. Nute. Defeasible Reasoning. In Proc. 20th Hawaii International Conference on Systems Science, IEEE Press 1987, 470–477.

    Google Scholar 

  13. D. Nute. Defeasible Logic. In D.M. Gabbay, C.J. Hogger and J.A. Robinson (eds.): Handbook of Logic in Arti_cial Intelligence and Logic Programming Vol. 3, Oxford University Press 1994, 353–395.

    Google Scholar 

  14. D. Touretzky. The mathematics of inheritance systems. Morgan Kaufmann 1986.

    Google Scholar 

  15. D. Touretzky, J.F. Horty and R.H. Thomason. A clash of intuitions: The current state of nonmonotonic multiple inheritance systems. In Proc. IJCAI-87, 476–482, Morgan Kaufmann 1987.

    Google Scholar 

  16. G. Wagner. Ex contradictione nihil sequitur. In Proc. 12th International Joint Conference on Artificial Intelligence, Morgan Kaufmann 1991.

    Google Scholar 

  17. X. Wang, J. You and L. Yuan. Nonmonotonic reasoning by monotonic inferences with priority constraints. In Nonmonotonic Extensions of Logic Programming, J Dix, P. Pereira, and T. Przymusinski (eds), LNAI 1216, Springer 1997, 91–109.

    Google Scholar 

  18. X. Wang, J. You and L. Yuan. Logic programming without default negation revisited. In Proc. IEEE International Conference on Intelligent Processing Systems, IEEE 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Antoniou, G., Maher, M.J., Billington, B., Governatori, G. (1999). A Comparison of Sceptical NAF-Free Logic Programming Approaches. In: Gelfond, M., Leone, N., Pfeifer, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1999. Lecture Notes in Computer Science(), vol 1730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46767-X_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-46767-X_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics