License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICLP.2011.162
URN: urn:nbn:de:0030-drops-31594
URL: http://drops.dagstuhl.de/opus/volltexte/2011/3159/
Go to the corresponding Portal


Fodor, Paul ; Kifer, Michael

Transaction Logic with Defaults and Argumentation Theories

pdf-format:
Document 1.pdf (530 KB)


Abstract

Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many advanced applications, including modeling robot movements, actions specification, and planning in artificial intelligence. In a parallel development, much work has been devoted to various theories of defeasible reasoning. In this paper, we unify these two streams of research and develop Transaction Logic with Defaults and Argumentation Theories, an extension of both Transaction Logic and the recently proposed unifying framework for defeasible reasoning called Logic Programs with Defaults and Argumentation Theories. We show that this combination has a number of interesting applications, including specification of defaults in action theories and heuristics for directed search in artificial intelligence planning problems. We also demonstrate the usefulness of the approach by experimenting with a prototype of the logic and showing how heuristics expressed as defeasible actions can significantly reduce the search space as well as execution time and space requirements.

BibTeX - Entry

@InProceedings{fodor_et_al:LIPIcs:2011:3159,
  author =	{Paul Fodor and Michael Kifer},
  title =	{{Transaction Logic with Defaults and Argumentation Theories}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) },
  pages =	{162--174},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{John P. Gallagher and Michael Gelfond},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3159},
  URN =		{urn:nbn:de:0030-drops-31594},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.ICLP.2011.162},
  annote =	{Keywords: Transaction Logic, Defeasible reasoning, Well-founded models}
}

Keywords: Transaction Logic, Defeasible reasoning, Well-founded models
Seminar: Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)
Issue Date: 2011
Date of publication: 27.06.2011


DROPS-Home | Fulltext Search | Imprint Published by LZI