LiU Electronic Press
Full-text not available in DiVA
Author:
Magnusson, Martin (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Kvarnström, Jonas (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Doherty, Patrick (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab) (Linköping University, The Institute of Technology)
Title:
Abductive Reasoning with Filtered Circumscription
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Publication type:
Conference paper (Refereed)
Language:
English
In:
Proceedings of the IJCAI-09 Workshop on Nonmonotonic Reasoning, Action and Change (NRAC)
Place of publ.: Sydney Publisher: UTSePress
Year of publ.:
2009
URI:
urn:nbn:se:liu:diva-21973
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-21973
ISBN:
978-0-9802840-7-2
Subject category:
Engineering and Technology
Computer Science
SVEP category:
TECHNOLOGY
Computer science
Abstract(en) :

For logical artificial intelligence to be truly useful,its methods must scale to problems of realistic size.An interruptible algorithm enables a logical agentto act in a timely manner to the best of its knowledge,given its reasoning so far. This seems necessaryto avoid analysis paralysis, trying to thinkof every potentiality, however unlikely, beforehand.These considerations prompt us to look for alternativereasoning mechanisms for filtered circumscription,a nonmonotonic reasoning formalism usede.g. by Temporal Action Logic and Event Calculus.We generalize Ginsberg’s circumscriptive theoremprover and describe an interruptible theoremprover based on abduction that has been used tounify planning and reasoning in a logical agent architecture.

Available from:
2009-10-07
Created:
2009-10-07
Last updated:
2013-08-29
Statistics:
13 hits