Title :
Anytime reasoning in first-order logic
Author :
Vanderveen, Keith B. ; Ramamoorthy, C.V.
Author_Institution :
Comput. Sci. Div., California Univ., Berkeley, CA, USA
Abstract :
We propose a class of algorithms which gives best-effort answers to problems in first-order logic given a bound on the resources available for reasoning. The algorithms in this class generate and attempt to solve S1 and S3 approximations to the input problem, then use the results to determine the most likely solution to the input problem. We show that an algorithm in this class outperforms theorem provers which attempt to solve the problem directly
Keywords :
formal logic; inference mechanisms; uncertainty handling; S1 approximation; S3 approximation; algorithm performance; anytime reasoning; best-effort answers; bounded reasoning resources; first-order logic; most likely solution; theorem provers; Application software; Computer science; Decision making; Hardware; Intelligent agent; Logic; Resource management; Routing; Scheduling algorithm; Software algorithms;
Conference_Titel :
Tools with Artificial Intelligence, 1997. Proceedings., Ninth IEEE International Conference on
Conference_Location :
Newport Beach, CA
Print_ISBN :
0-8186-8203-5
DOI :
10.1109/TAI.1997.632248
