Skip to main content

What Are the Necessity Rules in Defeasible Reasoning?

  • Conference paper
Logic Programming and Nonmonotonic Reasoning (LPNMR 2011)

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

Abstract

This paper investigates a new approach for computing the inference of defeasible logic. The algorithm proposed can substantially reduced the theory size increase due to transformations while preserving the representation properties in different variants of DL. Experiments also show that our algorithm outperform traditional approach by several order of amplitudes.

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. Nute, D.: Defeasible logic. In: Gabbay, D., Hogger, C. (eds.) Handbook of Logic for Artificial Intelligence and Logic Programming, vol. III, pp. 353–395. Oxford University Press, Oxford (1994)

    Google Scholar 

  2. Maher, M.J.: Propositional defeasible logic has linear complexity. Theory and Practice of Logic Programming 1(6), 691–711 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: Representation results for defeasible logic. ACM Transactions on Computational Logic 2(2), 255–286 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bryant, D., Krause, P.: A review of current defeasible reasoning implementations. Knowl. Eng. Rev. 23(3), 227–260 (2008)

    Article  Google Scholar 

  5. Antoniou, G., Billington, D., Governatori, G., Maher, M.J., Rock, A.: A family of defeasible reasoning logics and its implementation. In: Proc. ECAI 2000, pp. 459–463 (2000)

    Google Scholar 

  6. Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: A flexible framework for defeasible logics. In: AAAI 2000, pp. 401–405. AAAI/MIT Press (2000)

    Google Scholar 

  7. Billington, D., Antoniou, G., Governatori, G., Maher, M.J.: An inclusion theorem for defeasible logic. ACM Transactions in Computational Logic 12(1) (2010)

    Google Scholar 

  8. Lam, H.-P., Governatori, G.: On the problem of computing ambiguity propagation and well-founded semantics in defeasible logic. In: Dean, M., Hall, J., Rotolo, A., Tabet, S. (eds.) RuleML 2010. LNCS, vol. 6403, pp. 119–127. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  9. Lam, H.-P., Governatori, G.: The making of SPINdle. In: Governatori, G., Hall, J., Paschke, A. (eds.) RuleML 2009. LNCS, vol. 5858, pp. 315–322. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Lam, H.P., Thakur, S., Governatori, G., Sattar, A.: A model to coordinate uavs in urban environment using defeasible logic. In: Hu, Y.J., Yeh, C.L., Laun, W., Governatori, G., Hall, J., Paschke, A. (eds.) Proc. RuleML 2009 Challenge. CEUR Workshop Proceedings, vol. 549 (2009)

    Google Scholar 

  11. Maher, M.J., Rock, A., Antoniou, G., Billington, D., Miller, T.: Efficient defeasible reasoning systems. International Journal on Artificial Intelligence Tools 10(4), 483–501 (2001)

    Article  Google Scholar 

  12. Antoniou, G., Bikakis, A.: DR-Prolog: A system for defeasible reasoning with rules and ontologies on the semantic web. IEEE Trans. Knowl. Data Eng. 19(2), 233–245 (2007)

    Article  Google Scholar 

  13. Madalińska-Bugaj, E., Lukaszewicz, W.: Formalizing defeasible logic in cake. Fundam. Inf. 57(2-4), 193–213 (2003)

    MathSciNet  MATH  Google Scholar 

  14. Antoniou, G.: A discussion of some intuitions of defeasible reasoning. In: Vouros, G.A., Panayiotopoulos, T. (eds.) SETN 2004. LNCS (LNAI), vol. 3025, pp. 311–320. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lam, HP., Governatori, G. (2011). What Are the Necessity Rules in Defeasible Reasoning?. In: Delgrande, J.P., Faber, W. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2011. Lecture Notes in Computer Science(), vol 6645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20895-9_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20895-9_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20894-2

  • Online ISBN: 978-3-642-20895-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics