10.4230/LIPICS.ICLP.2011.162
Fodor, Paul
Paul
Fodor
Kifer, Michael
Michael
Kifer
Transaction Logic with Defaults and Argumentation Theories
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2011
Transaction Logic
Defeasible reasoning
Well-founded models
Gallagher, John P.
John P.
Gallagher
Gelfond, Michael
Michael
Gelfond
2011
2011-06-27
2011-06-27
2011-06-27
en
urn:nbn:de:0030-drops-31594
10.4230/LIPIcs.ICLP.2011
978-3-939897-31-6
1868-8969
10.4230/LIPIcs.ICLP.2011
LIPIcs, Volume 11, ICLP 2011
Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)
2013
11
16
162
174
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Gallagher, John P.
John P.
Gallagher
Gelfond, Michael
Michael
Gelfond
1868-8969
Leibniz International Proceedings in Informatics (LIPIcs)
2011
11
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
13 pages
542616 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
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.
LIPIcs, Vol. 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11), pages 162-174