Abstract
Two computation procedures are described for intuitionistic and classical logic. The first introduces Skolem functions at runtime. The second restricts unification by time stamping. For universal Horn clauses the computation is the same as Prolog.
| Original language | English |
|---|---|
| Pages (from-to) | 93-128 |
| Number of pages | 36 |
| Journal | Journal of Applied Non-Classical Logics |
| Volume | 3 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Jan 1993 |
| Externally published | Yes |
Bibliographical note
Funding Information:Research partially supported by Science and Engineering Research Council under grant GR/D/5939.7 as part of the Alvey Pure Logic Language project. Research partially supported by lliM Germany, LILOG Project; and by DFG through a grant to visit Imperial College during the academic year 1990/1991.
Funding
Research partially supported by Science and Engineering Research Council under grant GR/D/5939.7 as part of the Alvey Pure Logic Language project. Research partially supported by lliM Germany, LILOG Project; and by DFG through a grant to visit Imperial College during the academic year 1990/1991.
| Funders | Funder number |
|---|---|
| Alvey Pure Logic Language | |
| Deutsche Forschungsgemeinschaft | |
| Science and Engineering Research Council | GR/D/5939.7 |