Proving termination properties of prolog programs: A semantic approach (Q4015950): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0743-1066(92)90045-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973337882 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:00, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proving termination properties of prolog programs: A semantic approach |
scientific article |
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
