Proving termination properties of prolog programs: A semantic approach (Q4015950)
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: Proving termination properties of prolog programs: A semantic approach |
scientific article; zbMATH DE number 70119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proving termination properties of prolog programs: A semantic approach |
scientific article; zbMATH DE number 70119 |
Statements
Proving termination properties of prolog programs: A semantic approach (English)
0 references
10 November 1992
0 references
functional semantics of Prolog
0 references
first order properties
0 references
first order theorem proving
0 references
structural induction
0 references
minimization
0 references
cut
0 references
0.8383910059928894
0 references
0.8362963795661926
0 references
0.8360841870307922
0 references
