A full theorem-prover under uncertainty

 
This item is provided by the institution :

Repository :
Digital Library of National Technical University of Athens | Dspace@NTUA
see the original item page
in the repository's web site and access all digital files if the item*
share



Semantic enrichment by EKT
Journal part (EN)
Scientific article (EN)
1993 (EN)
A full theorem-prover under uncertainty (EN)
Papakonstantinou, G (EN)
Panayiotopoulos, T (EN)
Prolog embodies an ordered input resolution inference mechanism, with a powerful unification procedure. However, Prolog is not a full theorem-prover, and does not contain an inexact reasoning mechanism. In this paper, it is shown how these capabilities can be combined in a Prolog environment. A Prolog meta-interpreter is used in an elegant and simple way for this purpose. The inexact reasoning mechanism is presented through the certainty factor model, but it is also discussed how other inexact reasoning models may be also implemented. © 1993 Kluwer Academic Publishers. (EN)
journalArticle (EN)
model elimination (EN)
theorem-proving (EN)
certainty (EN)
Prolog (EN)
Computer Science, Artificial Intelligence (EN)
EXPERT SYSTEMS (EN)
inexact reasoning (EN)
Robotics (EN)
National Technical University of Athens
Digital Library of National Technical University of Athens | Dspace@NTUA
Κεντρική Βιβλιοθήκη Ε.Μ.Π.
Ιδρυματικό Αποθετήριο
Δημοσιεύσεις μελών Δ.Ε.Π. σε περιοδικά
Journal of Intelligent & Robotic Systems (EN)
English
1993 (EN)
http://hdl.handle.net/123456789/10859
ISI:A1993KQ70800002 (EN)
2 (EN)
149 (EN)
10.1007/BF01257816 (EN)
7 (EN)
139 (EN)
0921-0296 (EN)
Kluwer Academic Publishers (EN)



*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)