In this paper we present a new approach to evaluate indicative conditionals with respect to some background information specified by a logic program. Because the weak completion of a logic program admits a least model under the three-valued Łukasiewicz semantics and this semantics has been successfully applied to other human reasoning tasks, conditionals are evaluated under these least L-models. If such a model maps the condition of a conditional to unknown, then abduction and revision are applied in order to satisfy the condition. Different strategies in applying abduction and revision might lead to different evaluations of a given conditional. Based on these findings we outline an experiment to better understand how humans handle those cases.
|Number of pages||12|
|Journal||CEUR Workshop Proceedings|
|Publication status||Published - 1 Jan 2015|
|Event||1st International Workshop on Semantic Technologies, IWOST 2015 - Changchun, China|
Duration: 9 Mar 2015 → 12 Mar 2015