15th European Conference on Artificial Intelligence
|July 21-26 2002 Lyon France|
Marcelo Finger, Renata Wassermann
Real agents (natural or artificial) are limited in their reasoning capabilities. In this paper, we present a general framework for modeling limited reasoning based on approximate reasoning and discuss its properties. We start from Cadoli and Schaerf's approximate entailment. We first extend their system to deal with the full language of propositional logic. A tableau inference system is proposed for the extended system together with a sub-classical semantics; it is shown that this new approximate reasoning system is sound and complete with respect to this semantics. We show how this system can be incrementally used to move from one approximation to the next until the reasoning limitation is reached. We note that although the extension is more expressive than the original system, it offers less control over the approximation process. We then suggest how we can recover control while keeping the increased expressivity.
Keywords: Resource-Bounded Reasoning, Automated Reasoning, Common-sense Reasoning, Deduction
Citation: Marcelo Finger, Renata Wassermann: Expressivity and Control in Limited Reasoning. In F. van Harmelen (ed.): ECAI2002, Proceedings of the 15th European Conference on Artificial Intelligence, IOS Press, Amsterdam, 2002, pp.272-276.