Nothing Special   »   [go: up one dir, main page]

Skip to main content

Annotated Semantics for Defeasible Deontic Reasoning

  • Conference paper
  • First Online:
Rough Sets and Current Trends in Computing (RSCTC 2000)

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

Included in the following conference series:

Abstract

In this paper, we propose an annotated logic program called an EVALPSN (Extended Vector Annotated Logic Program with Strong Negation) to formulate the semantics for a defeasible deontic reasoning proposed by D.Nute. We propose a translation from defeasible deontic theory into EVALPSN and show that the stable model of EVALPSN provides an annotated semantics for D.Nute’s defeasible deontic logic. The annotated semantics can provide a theoretical base for an automated defeasible deontic reasoning system.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Billington, D.: Conicting Literals and Defeasible Logic. Proc. 2nd AustralianWorkshop on Commonsense Reasoning, (1997) 1–15

    Google Scholar 

  2. Da Costa, N.C.A., Subrahmanian, V.S., and Vago, C.: The Paraconsistent Logics PT. Zeitschrift für MLGM 37 (1989) 139–148

    Google Scholar 

  3. Gelfond, M. and Lifschitz, V.: The Stable Model Semantics for Logic Programming. Proc. 5th Int'l Conf. and Symp. on Logic Programming (1989) 1070–1080

    Google Scholar 

  4. Lloyd, J.W.: Foundations of Logic Programming(2nd edition). Springer (1987)

    Google Scholar 

  5. Meyer, C.J. and Wieringa, J.R.: Deontic Logic in Computer Science. John Wiley & Sons (1993)

    Google Scholar 

  6. McNamara, P. and Prakken, H.(eds.): Norms, Logics and Information Systems. New Studies in Deontic Logic and Computer Science, Frontiers in Artificial Intelligence and Applications Vol.49IOS Press (1999)

    Google Scholar 

  7. Nakamatsu, K. and Suzuki, A.: Annotated Semantics for Default Reasoning. Proc. 3rd Pacific Rim International Conference on Artificial Intelligence (1994) 180–186

    Google Scholar 

  8. Nakamatsu, K. and Suzuki, A.: A Nonmonotonic ATMS Based on Annotated Logic Programs. Agents and Multi-Agents Systems, LNAI 1441 Springer (1998) 79–93

    Google Scholar 

  9. Nakamatsu, K.and Abe, J.M.: Reasonings Based on Vector Annotated Logic Programs. Computational Intelligence for Modelling, Control & Automation, Concurrent Systems Engineering Series 55. IOS Press (1999) 396–403

    Google Scholar 

  10. Nute, D.: Basic Defeasible Logics. Intensional Logics for Programming. Oxford University Press (1992) 125–154

    Google Scholar 

  11. Nute, D.: Apparent Obligation. Defeasible Deontic Logic. Kluwer Academic Publisher (1997) 287–316

    Google Scholar 

  12. Prakken, H.: Logical Tools for Modelling Legal Argument A Study of Defeasible Reasoning in Law. Law and Philosophy Library Vol.32 Kuwer Academic (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nakamatsu, K., Abe, J.M., Suzuki, A. (2001). Annotated Semantics for Defeasible Deontic Reasoning. In: Ziarko, W., Yao, Y. (eds) Rough Sets and Current Trends in Computing. RSCTC 2000. Lecture Notes in Computer Science(), vol 2005. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45554-X_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-45554-X_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43074-2

  • Online ISBN: 978-3-540-45554-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics