Skip to main content
Springer Nature Link
Log in

A Java Implementation of Temporal Defeasible Logic

  • Conference paper
Rule Interchange and Applications (RuleML 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5858))

Abstract

In this paper we report on a Java implementation of a variant of Temporal Defeasible Logic, an extension of Defeasible Logic developed to capture the concept of temporal persistence. The system consists of three elements: a graphical user interface for selecting defeasible theories, and for visualizing conclusions; a parser, which translates sets of rules in TXT or RuleML formats; and the inference engine to compute conclusions.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Allen, J.: Towards a general theory of action and time. Artificial Intelligence 23 (1984)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: Embedding defeasible logic into logic programming. Theory and Practice of Logic Programming 6, 703–735 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  4. Antoniou, G., Maher, M.J., Billington, D.: Defeasible logic versus logic programming without negation as failure. Journal of Logic Programming 42, 47–57 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Augusto, J., Simari, G.: Temporal defeasible reasoning. Knowledge and Information Systems 3, 287–318 (2001)

    Article  MATH  Google Scholar 

  6. Bassiliades, N., Antoniou, G., Vlahavas, I.: A defeasible logic reasoner for the Semantic Web. International Journal on Semantic Web and Information Systems 2, 1–41 (2006)

    Google Scholar 

  7. Governatori, G.: Representing business contracts in RuleML. International Journal of Cooperative Information Systems 14(2-3), 181–216 (2005)

    Article  Google Scholar 

  8. Governatori, G., Hulstijn, J., Riveret, R., Rotolo, A.: Characterising deadlines in temporal modal defeasible logic. In: Orgun, M.A., Thornton, J. (eds.) AI 2007. LNCS (LNAI), vol. 4830, pp. 486–496. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Governatori, G., Pham, H.D.: A semantic web based architecture for e-contracts in defeasible logic. In: Adi, A., Stoutenburg, S., Tabet, S. (eds.) RuleML 2005. LNCS, vol. 3791, pp. 145–159. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Governatori, G., Rotolo, A.: Temporal defeasible logic has linear complexity. Technical report, NICTA, Queensland Research Laboratory, Australia (2009), http://www.governatori.net/publications.html

  11. Governatori, G., Rotolo, A.: Changing legal systems: Legal abrogations and annulments in defeasible logic. The Logic Journal of IGPL (forthcoming)

    Google Scholar 

  12. Governatori, G., Rotolo, A., Sartor, G.: Temporalised normative positions in defeasible logic. In: ICAIL 2005, pp. 25–34. ACM Press, New York (2005)

    Chapter  Google Scholar 

  13. Governatori, G., Terenziani, P.: Temporal extensions to defeasible logic. In: Orgun, M.A., Thornton, J. (eds.) AI 2007. LNCS (LNAI), vol. 4830, pp. 476–485. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Grosof, B.N.: Representing e-commerce rules via situated courteous logic programs in RuleML. Electronic Commerce Research and Applications 3(1), 2–20 (2004)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  16. Rubino, R.: Una implementazione della logica defeasible temporale per il ragionamento giuridico. PhD thesis, CIRSFID, University of Bologna (2009)

    Google Scholar 

  17. Shanahan, M.: Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia. MIT Press, Cambridge (1997)

    Google Scholar 

  18. Turner, H.: Representing actions in logic programs and default theories: A situation calculus approach. Journal of Logic Programming 31(1-3), 245–298 (1997)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CIRSFID/Law School, University of Bologna, Italy

    Rossella Rubino & Antonino Rotolo

Authors
  1. Rossella Rubino
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antonino Rotolo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Queensland Research Laboratory, National ICT Australia, PO Box 6020, 4067, St Lucia, Queensland, Australia

    Guido Governatori

  2. Model Systems, 15-19 Cavendish Place, W1G 0DD, London, UK

    John Hall

  3. FB mathematik und Informatik, Institut für Informatik, AG Corporate Semantic Web, Freie Universität Berlin, Königin-Luise-Str. 24/26, 14495, Berlin, Germany

    Adrian Paschke

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rubino, R., Rotolo, A. (2009). A Java Implementation of Temporal Defeasible Logic. In: Governatori, G., Hall, J., Paschke, A. (eds) Rule Interchange and Applications. RuleML 2009. Lecture Notes in Computer Science, vol 5858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04985-9_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04985-9_27

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics