Skip to main content
SpringerLink
Log in

Advancements in Resource-Driven Substructural Defeasible Logic

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 2019)

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

Included in the following conference series:

  • 728 Accesses

Abstract

Linear Logic and Defeasible Logic have been adopted to formalise different features of knowledge representation: consumption of resources and reasoning with exceptions. We propose a framework to combine sub-structural features, corresponding to the consumption of resources, with defeasibility aspects to handle potentially conflicting information, and we discuss the design choices.

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

Access this chapter

Log in via an institution
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 EPUB and 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

Notes

  1. 1.

    Trivially, e.g., if literal a has been derived twice, but it appears in the antecedent of three rules, only two of such rules can produce their conclusions.

  2. 2.

    The atomic propositions are the nodes, and there is a directed edge between nodes if there is a rule containing the source or its negation in the body, and the target or its negation in the head.

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Engberg, U., Winskel, G.: Completeness results for linear logic on Petri nets. Ann. Pure Appl. Logic 86(2), 101–135 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Gaboardi, M., Marion, J.Y., Ronchi Della Rocca, S.: Soft linear logic and polynomial complexity classes. Electron. Notes Theoret. Comput. Sci. 205(C), 67–87 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ghooshchi, N.G., van Beest, N., Governatori, G., Olivieri, F., Sattar, A.: Visualisation of compliant declarative business processes. In: EDOC 2017, pp. 89–94. IEEE (2017)

    Google Scholar 

  5. Girard, J.Y.: Light linear logic. Inf. Comput. 143(2), 175–204 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. Governatori, G., Olivieri, F., Cristani, M., Scannapieco, S.: Revision of defeasible preferences. Int. J. Approx. Reasoning 104, 205–230 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  7. Governatori, G., Olivieri, F., Scannapieco, S., Rotolo, A., Cristani, M.: The rationale behind the concept of goal. Theory Pract. Log. Program. 16(3), 296–324 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kanovich, M., Ito, T.: Temporal linear logic specifications for concurrent processes. In: LICS 1997, pp. 48–57. IEEE Computer Society (1997)

    Google Scholar 

  9. Küngas, P., Matskin, M.: Linear logic, partial deduction and cooperative problem solving. In: Leite, J., Omicini, A., Sterling, L., Torroni, P. (eds.) DALT 2003. LNCS (LNAI), vol. 2990, pp. 263–279. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-25932-9_14

    Chapter  Google Scholar 

  10. 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). https://doi.org/10.1007/978-3-642-04985-9_29

    Chapter  Google Scholar 

  11. Nute, D.: Defeasible logic. In: Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3. Oxford University Press (1987)

    Google Scholar 

  12. Olivieri, F., Cristani, M., Governatori, G.: Compliant business processes with exclusive choices from agent specification. In: Chen, Q., Torroni, P., Villata, S., Hsu, J., Omicini, A. (eds.) PRIMA 2015. LNCS (LNAI), vol. 9387, pp. 603–612. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25524-8_43

    Chapter  Google Scholar 

  13. Olivieri, F., Governatori, G., Cristani, M., van Beest, N., Colombo-Tosatto, S.: Resource-driven substructural defeasible logic. In: Miller, T., Oren, N., Sakurai, Y., Noda, I., Savarimuthu, B.T.R., Cao Son, T. (eds.) PRIMA 2018. LNCS (LNAI), vol. 11224, pp. 594–602. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-03098-8_46

    Chapter  Google Scholar 

  14. Olivieri, F., Governatori, G., Scannapieco, S., Cristani, M.: Compliant business process design by declarative specifications. In: Boella, G., Elkind, E., Savarimuthu, B.T.R., Dignum, F., Purvis, M.K. (eds.) PRIMA 2013. LNCS (LNAI), vol. 8291, pp. 213–228. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-44927-7_15

    Chapter  Google Scholar 

  15. Pham, D.Q., Harland, J.: Temporal linear logic as a basis for flexible agent interactions. In: AAMAS 2007, pp. 28:1–28:8. ACM (2007)

    Google Scholar 

  16. Pham, D.Q., Harland, J., Winikoff, M.: Modeling agents’ choices in temporal linear logic. In: Baldoni, M., Son, T.C., van Riemsdijk, M.B., Winikoff, M. (eds.) DALT 2007. LNCS (LNAI), vol. 4897, pp. 140–157. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-77564-5_9

    Chapter  Google Scholar 

  17. Rao, J., Küngas, P., Matskin, M.: Composition of semantic web services using linear logic theorem proving. Inf. Syst. 31(4–5), 340–360 (2006)

    Article  Google Scholar 

  18. Tanabe, M.: Timed Petri nets and temporal linear logic. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 156–174. Springer, Heidelberg (1997). https://doi.org/10.1007/3-540-63139-9_35

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Data61, CSIRO, Brisbane, Australia

    Francesco Olivieri & Guido Governatori

  2. University of Verona, Strada Le Grazie 15, 37135, Verona, VR, Italy

    Matteo Cristani

Authors
  1. Francesco Olivieri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guido Governatori
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Matteo Cristani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Francesco Olivieri .

Editor information

Editors and Affiliations

  1. University of Calabria, Rende, Italy

    Francesco Calimeri

  2. University of Calabria, Rende, Italy

    Nicola Leone

  3. Mathematics and Computer Science, University of Calabria, Rende, Italy

    Marco Manna

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Olivieri, F., Governatori, G., Cristani, M. (2019). Advancements in Resource-Driven Substructural Defeasible Logic. In: Calimeri, F., Leone, N., Manna, M. (eds) Logics in Artificial Intelligence. JELIA 2019. Lecture Notes in Computer Science(), vol 11468. Springer, Cham. https://doi.org/10.1007/978-3-030-19570-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-19570-0_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-19569-4

  • Online ISBN: 978-3-030-19570-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation