A declarative approach for first-order built-in's of Prolog (Q1328181)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A declarative approach for first-order built-in's of Prolog |
scientific article; zbMATH DE number 599668
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A declarative approach for first-order built-in's of Prolog |
scientific article; zbMATH DE number 599668 |
Statements
A declarative approach for first-order built-in's of Prolog (English)
0 references
4 July 1994
0 references
The aim of the paper is to provide a new non-standard declarative semantic for Prolog programs with built-in's that include arithmetic operations and metalogical relations like var and ground. Completeness of the Prolog computation mechanism w.r.t. this semantics is proved. The authors provide a method for proving termination of Prolog programs with built-in's which uses this semantics.
0 references
non-standard declarative semantic
0 references
Prolog programs
0 references
0.7941603660583496
0 references
0.7772369384765625
0 references
