DocumentCode
1948689
Title
Bottom up logic programming as an inference tool
Author
McAllester, David
Author_Institution
AI Lab., MIT Cambridge, MA
fYear
1993
fDate
8-11 Nov 1993
Firstpage
8
Abstract
It is well known that complete logical inference is computationally intractable. However, I take the position here that inference is a principle tool in improving efficiency in a wide variety of computations. My case for the pragmatic value of inference is based on technical results concerning bottom up logic programming. The basic intuition behind the value of inference involves the notion of “obvious consequence”. In many domains there is a class of questions which can be answered quickly. Pragmatically one is interested in constructing systems that can answer a useful class of questions quickly. Bottom up logic programming provides a flexible paradigm for doing this. I give one particularly startling result which states that a simple syntactic restriction on logic programs yields a simple programming language in which one can define all and only polynominal time decision procedures
Keywords
Horn clauses; inference mechanisms; logic programming; programming theory; Horn clauses; bottom up logic programming; complete logical inference; computationally intractable; inference tool; obvious consequence; polynominal time decision procedures; simple programming language; syntactic restriction; Artificial intelligence; Computer languages; Inference algorithms; Laboratories; Logic programming; Natural languages; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Tools with Artificial Intelligence, 1993. TAI '93. Proceedings., Fifth International Conference on
Conference_Location
Boston, MA
ISSN
1063-6730
Print_ISBN
0-8186-4200-9
Type
conf
DOI
10.1109/TAI.1993.633927
Filename
633927
Link To Document