Name
Abstract | ||
|---|---|---|
Abstract: For representing high level knowledge, such as the mathematical knowledgeused in interactive theorem provers and verification systems, it is desirable toextend Prolog's concept of data object. A basic reason is that Prolog dataobjects --- Herbrand objects --- are terms of a minimal object language,which does not include its own object variables, or quantification over thosevariables. |
Year | Venue | Keywords |
|---|---|---|
1991 | LOGIC PROGRAMMING : PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE | meta programming,logic programming,programming languages,prolog,theorem prover |
Field | DocType | Citations |
Metaprogramming,Programming language,Method,Computer science,Unification,Automated theorem proving,Theoretical computer science,Object language,Prolog,Operator (computer programming),Logic programming | Conference | 3 |
PageRank | References | Authors |
0.68 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anthony S. K. Cheng | 1 | 3 | 1.36 |
| Peter J. Robinson | 2 | 121 | 20.26 |
| John Staples | 3 | 103 | 22.59 |