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.
Defeasible logic programming in satisfiability Modulo CHR
SANTINI, FRANCESCO
2015
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.