Encoding Definitional Fragments of Temporal Action Logic into Logic Programming (bibtex)
by Marc van Zee, Patrick Doherty, John-Jules Meyer
Abstract:
Temporal Action Logics (TAL) is an expressive class of nonmonotonic temporal logics for reasoning about action and change. In previous work, it has been shown that a very general fragment of the logic can be reduced to first-order logic with equality. Consequently, standard theorem proving techniques can be used to reason in TAL. TAL is intended to be used for robotics. In this case, standard theorem proving techniques are too general and do not provide efficient decision procedures. The goal of this article is to identify a limited subset of TAL that can be directly mapped to a normal logic program. Although quite restrictive, this sets the lower bound on what can be done with direct mappings to logic programs. Discussions concerning extensions to the restricted fragment are also provided.
Reference:
Encoding Definitional Fragments of Temporal Action Logic into Logic Programming (Marc van Zee, Patrick Doherty, John-Jules Meyer), In International Workshop on Defeasible and Ampliative Reasoning (DARe), 2014.
Bibtex Entry:
@InProceedings{vanzee-etal:dare2014,
  Title                    = {Encoding Definitional Fragments of Temporal Action Logic into Logic Programming},
  Author                   = {Marc van Zee and Patrick Doherty and John-Jules Meyer},
  Booktitle                = {International Workshop on Defeasible and Ampliative Reasoning (DARe)},
  Year                     = {2014},
  Month                    = {June},

  Abstract                 = {Temporal Action Logics (TAL) is an expressive class of nonmonotonic temporal logics for reasoning about action and change. In previous work, it has been shown that a very general fragment of the logic can be reduced to first-order logic with equality. Consequently, standard theorem proving techniques can be used to reason in TAL. TAL is intended to be used for robotics. In this case, standard theorem proving techniques are too general and do not provide efficient decision procedures. The goal of this article is to identify a limited subset of TAL that can be directly mapped to a normal logic program. Although quite restrictive, this sets the lower bound on what can be done with direct mappings to logic programs. Discussions concerning extensions to the restricted fragment are also provided.},
  Owner                    = {marc.vanzee},
  Url                      = {http://www.marcvanzee.nl/publications/2014/dare2014_definitional_fragments_of_TAL_in_LP.pdf}
}