TY - GEN
T1 - Contextual reasoning
T2 - 14th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2017
AU - Saldanha, Emmanuelle Anna Dietz
AU - Hölldobler, Steffen
AU - Pereira, Luís Moniz
N1 - LMP acknowledges support from FCT/MEC NOVA LINCS Pest UID/CEC/04516/2013. Many thanks to Tobias Philipp and Christoph Wernhard.
PY - 2017
Y1 - 2017
N2 - We present a new logic programming approach to contextual reasoning, based on the Weak Completion Semantics (WCS), the latter of which has been successfully applied in the past to adequately model various human reasoning tasks. One of the properties of WCS is the open world assumption with respect to undefined atoms. This is a characteristic that is different to other common Logic Programming semantics, a property that seems suitable when modeling human reasoning. Notwithstanding, we have noticed that the famous Tweety default reasoning example, originally introduced by Reiter, cannot be modeled straightforwardly under WCS. Hence, to address the issue and taking Pereira and Pinto’s inspection points as inspiration, we develop a notion of contextual reasoning for which we introduce contextual logic programs. We reconsider the formal properties of WCS with respect to these and verify whether they still hold. Finally, we set forth contextual abduction and show that not only the original Tweety example can be nicely modeled within the new approach, but more sophisticated examples as well, where context plays an important role.
AB - We present a new logic programming approach to contextual reasoning, based on the Weak Completion Semantics (WCS), the latter of which has been successfully applied in the past to adequately model various human reasoning tasks. One of the properties of WCS is the open world assumption with respect to undefined atoms. This is a characteristic that is different to other common Logic Programming semantics, a property that seems suitable when modeling human reasoning. Notwithstanding, we have noticed that the famous Tweety default reasoning example, originally introduced by Reiter, cannot be modeled straightforwardly under WCS. Hence, to address the issue and taking Pereira and Pinto’s inspection points as inspiration, we develop a notion of contextual reasoning for which we introduce contextual logic programs. We reconsider the formal properties of WCS with respect to these and verify whether they still hold. Finally, we set forth contextual abduction and show that not only the original Tweety example can be nicely modeled within the new approach, but more sophisticated examples as well, where context plays an important role.
KW - WELL-FOUNDED SEMANTICS
KW - LOGIC PROGRAMS
UR - http://www.scopus.com/inward/record.url?scp=85025162292&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-61660-5_8
DO - 10.1007/978-3-319-61660-5_8
M3 - Conference contribution
AN - SCOPUS:85025162292
SN - 978-3-319-61659-9
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 64
EP - 77
BT - Logic Programming and Nonmonotonic Reasoning - 14th International Conference, LPNMR 2017, Proceedings
A2 - Balduccini , M.
A2 - Janhunen , T.
PB - Springer Verlag
CY - Cham
Y2 - 3 July 2017 through 6 July 2017
ER -