Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Prolog technology for default reasoning: proof theory and compilation techniques
Schaub T., Brüning S. Artificial Intelligence106 (1):1-75,1998.Type:Article
Date Reviewed: Jul 1 1999

The primary aim of this paper is to demonstrate the use of Prologmethodology to answer queries in default logics. The implementationtechniques are those of model elimination, as found in Mark Stickel’sProlog Technology Theorem Prover (PTTP). This fairly long paper is forthe most part self-contained, assuming the reader knows the fundamentalconcepts of propositional and first-order logic, and is familiar withautomated reasoning and Prolog. The paper is organized in such a waythat the theoretical underpinnings are carefully presented (with keyproofs in the appendices) and are followed by details of theimplementation and experiments in query answering.

Reviewer:  R. W. Wilkerson Review #: CR127375 (99070572)
Bookmark and Share
 
Deduction And Theorem Proving (I.2.3 )
 
Would you recommend this review?
yes
no
Other reviews under "Deduction And Theorem Proving": Date
Noninteractive zero-knowledge
Blum M., De Santis A., Micali S., Persiano G. SIAM Journal on Computing 20(6): 1084-1118, 1991. Type: Article
Jan 1 1993
Cut elimination and automatic proof procedures
Zhang W. Theoretical Computer Science 91(2): 265-284, 1991. Type: Article
Apr 1 1993
A non-reified temporal logic
Bacchus F., Tenenberg J., Koomen J. Artificial Intelligence 52(1): 87-108, 1991. Type: Article
Oct 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy