Pseudo-Boolean valued Prolog (Q1117705)
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 4092825
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pseudo-Boolean valued Prolog |
scientific article; zbMATH DE number 4092825 |
Statements
Pseudo-Boolean valued Prolog (English)
0 references
1988
0 references
A generalization of conventional Horn clause logic programming is proposed in which the space of truth values is a pseudo-Boolean or Heyting algebra, whose members may be thought of as evidences for propositions. A minimal model and an operational semantics is presented, and their equivalence is proved, thus generalizing the classic work of Van Emden and Kowalski.
0 references
pseudo-Boolean
0 references
Heyting algebra
0 references
Horn clause logic programming
0 references
pseudo- Boolean or Heyting algebra
0 references
minimal model
0 references
operational semantics
0 references
0.7719858288764954
0 references
0.7718973159790039
0 references
