Mints type deductive calculi for logic programming (Q1192340)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 60743
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mints type deductive calculi for logic programming |
scientific article; zbMATH DE number 60743 |
Statements
Mints type deductive calculi for logic programming (English)
0 references
27 September 1992
0 references
A calculus introduced by the reviewer [Izv. Akad. Nauk Ehst. SSR, Fiz., Mat. 35, 367-380 (1986; Zbl 0616.68004)] to describe manipulation with Prolog trees is extended and modified here to cover the use of negated goals in Prolog, SLD-resolution, SLDNF-resolution and some of its extensions.
0 references
Prolog trees
0 references
negated goals
0 references
SLD-resolution
0 references
0 references
0.8777791
0 references
0 references
0.8738544
0 references
0.8717079
0 references
0.8708889
0 references
