Tight, consistent, and computable completions for unrestricted logic programs (Q4036289)
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: Tight, consistent, and computable completions for unrestricted logic programs |
scientific article; zbMATH DE number 168623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight, consistent, and computable completions for unrestricted logic programs |
scientific article; zbMATH DE number 168623 |
Statements
Tight, consistent, and computable completions for unrestricted logic programs (English)
0 references
16 May 1993
0 references
negation in logic programming
0 references
Clark's program completion
0 references
first-order semantics for logic programs
0 references
0 references
0.92090446
0 references
0 references
0.90972006
0 references
0 references
0.89238006
0 references
0.8892721
0 references
