Commonsense reasoning in Prolog

Authors:
Wei Si Jiang;William G. Wee
Affiliations:
Dept. of Electrical and Computer Engineering, University of Cincinnati, Cincinnati, Ohio;Dept. of Electrical and Computer Engineering, University of Cincinnati, Cincinnati, Ohio
Venue:
CSC '87 Proceedings of the 15th annual conference on Computer Science
Year:
1987

Citing 4
Cited 0

Programming in Prolog (2nd ed.)

Programming in Prolog (2nd ed.)
Applications of circumscription to formalizing common-sense knowledge

Artificial Intelligence
The limitation of logic

CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
Computing circumscription

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Commonsense reasoning with incomplete knowledge plays an important role in problem solving. Various kinds of non-monotonic logic are the formalizations of this kind of reasoning. In many cases the closed world assumption with negation as failure can achieve the same (or even stronger) conclusions as those of these formalizations. Consequently, it is convenient and effective for Prolog to implement commonsense reasoning.