Skip to main content
SpringerLink
Log in

Defeasible Logic Programming in Satisfiability Modulo CHR

  • Conference paper
  • First Online:
AI*IA 2015 Advances in Artificial Intelligence (AI*IA 2015)

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

Included in the following conference series:

Abstract

We revise some results in Argumentation-based Logic Programming under the umbrella of Satisfiability Modulo CHR (SMCHR), specifically considering Defeasible Logic Programming (DeLP). Strict and defeasible rules in DeLP can be cast to SMCHR rules, which act as conflict “disentanglers” and implement the Theory part. At the same time, we inherit several built-in theory solvers, as SAT, unification, or linear arithmetic ones, which implement the Satisfiability-modulo part. Moreover, we show how to deal with possibilistic extensions of DeLP, i.e., Possibilistic-DeLP, where certainty scores describing the possibility of some events are associated with rules.

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 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. Alsinet, T., Chesñevar, C.I., Godo, L., Simari, G.R.: A logic programming framework for possibilistic argumentation: Formalization and logical properties. Fuzzy Sets and Systems 159(10), 1208–1228 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bistarelli, S., Santini, F.: Conarg: a constraint-based computational framework for argumentation systems. In: Proceedings of the 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence, ICTAI 2011, pp. 605–612. IEEE Computer Society (2011)

    Google Scholar 

  3. Bistarelli, S., Santini, F.: Coalitions of arguments: An approach with constraint programming. Fundam. Inform. 124(4), 383–401 (2013)

    MathSciNet  MATH  Google Scholar 

  4. Bistarelli, S., Rossi, F., Santini, F.: A first comparison of abstract argumentation reasoning-tools. In: ECAI 2014–21st European Conference on Artificial Intelligence. FAIA, vol. 263, pp. 969–970. IOS Press (2014)

    Google Scholar 

  5. Cerutti, F., Giacomin, M., Vallati, M.: ArgSemSAT: solving argumentation problems using SAT. In: Computational Models of Argument - Proceedings of COMMA 2014. FAIA, vol. 266, pp. 455–456. IOS Press (2014)

    Google Scholar 

  6. Charwat, G., Dvorák, W., Gaggl, S.A., Wallner, J.P., Woltran, S.: Methods for solving reasoning problems in abstract argumentation: A survey. Artificial Intelligence 220, 28–63 (2015)

    Google Scholar 

  7. Duck, G.J.: SMCHR: Satisfiability modulo constraint handling rules. TPLP 12(4–5), 601–618 (2012)

    MathSciNet  MATH  Google Scholar 

  8. Duck, G.J.: Satisfiability modulo constraint handling rules (extended abstract). In: IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence (2013)

    Google Scholar 

  9. Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77(2), 321–358 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  10. Egly, U., Gaggl, S.A., Woltran, S.: Answer-set programming encodings for argumentation frameworks. Argument & Computation 1(2), 147–177 (2010)

    Article  MATH  Google Scholar 

  11. Frühwirth, T.W.: Theory and practice of constraint handling rules. J. Log. Program. 37(1–3), 95–138 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  12. Frühwirth, T.W.: Constraint Handling Rules, 1st edn. Cambridge University Press, New York (2009)

    Book  MATH  Google Scholar 

  13. García, A.J., Simari, G.R.: Defeasible logic programming: An argumentative approach. Theory Pract. Log. Program. 4(2), 95–138 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kakas, A., Moraitis, P.: Argumentation based decision making for autonomous agents. In: Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2003, pp. 883–890. ACM (2003)

    Google Scholar 

  15. Nute, D.: Defeasible reasoning: a philosophical analysis in Prolog. In: Aspects of Artificial Intelligence, pp. 251–288. Springer (1988)

    Google Scholar 

  16. Prakken, H., Sartor, G.: Argument-based extended logic programming with defeasible priorities. Journal of Applied Non-Classical Logics 7(1–2), 25–75 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  17. Rahwan, I., Simari, G.R.: Argumentation in Artificial Intelligence, 1st edn. Springer Publishing Company, Incorporated (2009)

    Google Scholar 

  18. Santini, F.: Argument-based constraint logic-programming in satisfiability modulo CHR. In: 12th International Workshop on Argumentation in Multi-Agent Systems. Informal Proceedings (2015)

    Google Scholar 

  19. Schrijvers, T., Demoen, B.: The K.U. Leuven CHR system: Implementation and application. In: First Workshop on Constraint Handling Rules: Selected Contributions, pp. 1–5 (2004)

    Google Scholar 

  20. Schweimeier, R., Schroeder, M.: A parameterised hierarchy of argumentation semantics for extended logic programming and its application to the well-founded semantics. Theory Pract. Log. Program. 5(1–2), 207–242 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Informatica, Università di Perugia, Perugia, Italy

    Francesco Santini

Authors
  1. Francesco Santini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Francesco Santini .

Editor information

Editors and Affiliations

  1. Dipartimento di Ingegneria,, Università di Ferrara,, Ferrara, Italy

    Marco Gavanelli

  2. Dipartimento di Ingegneria, Università di Ferrara, Ferrara, Italy

    Evelina Lamma

  3. Dep di Matem e Informatica, Universita di Ferrara, Ferrara, Italy

    Fabrizio Riguzzi

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Santini, F. (2015). Defeasible Logic Programming in Satisfiability Modulo CHR. In: Gavanelli, M., Lamma, E., Riguzzi, F. (eds) AI*IA 2015 Advances in Artificial Intelligence. AI*IA 2015. Lecture Notes in Computer Science(), vol 9336. Springer, Cham. https://doi.org/10.1007/978-3-319-24309-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24309-2_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24308-5

  • Online ISBN: 978-3-319-24309-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation