Testing logic programs for local stratification (Q1199536)
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: Testing logic programs for local stratification |
scientific article; zbMATH DE number 94459
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Testing logic programs for local stratification |
scientific article; zbMATH DE number 94459 |
Statements
Testing logic programs for local stratification (English)
0 references
16 January 1993
0 references
Locally stratified programs are a significant class of logic programs with negation for which both declarative and fixpoint semantics are well defined. Unfortunately in most cases recognizing local stratification is so hard a task that it has been conjectured that the problem is undecidable. Indeed, a formal proof of this undecidability is presented and rather general sufficient conditions for local stratification are introduced. The sufficient conditions are based on an analysis of unification patterns based on a suitably defined algebra of terms.
0 references
logic programs with negation
0 references
analysis of unification patterns
0 references
algebra of terms
0 references
0.91958755
0 references
0.8704669
0 references
0 references
0.8499242
0 references
0.84768844
0 references
0.8466698
0 references
