Premium
CONSTRAINED RESOLUTION AND ABDUCTTVE TEMPORAL REASONING
Author(s) -
Chleq Nicolas
Publication year - 1996
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/j.1467-8640.1996.tb00268.x
Subject(s) - formalism (music) , computer science , temporal logic , answer set programming , non monotonic logic , abductive reasoning , event calculus , logic programming , linear temporal logic , temporal logic of actions , artificial intelligence , resolution (logic) , theoretical computer science , interval temporal logic , art , musical , visual arts
This article presents our work on the effective implementation of abduction in temporal reasoning. This works builds on some results, both in the logic programming field and in the automated reasoning area. We have defined and implemented an abductive procedure, which is well adapted for temporal reasoning because it is based on a constrained resolution principle. Constrained resolution has two advantages for temporal reasoning: First, it allows us to deal efficiently with temporal ordering and equality predicates, which are otherwise too much trouble with classical resolution; second, it allows a restricted form of abduction where hypotheses are limited to ordering relationships. From the logic programming area, our work uses results and procedures developed by others in the abductive logic programming field. The procedure we define and implement in this work is relatively independent of the temporal formalism: It has been used with some reified temporal logics and with the event calculus. More generally it can be used on any point‐based temporal formalism, provided that a correct and complete algorithm is available for checking the consistency of a set of temporal ordering relationships in this language.