A fixpoint semantics for reasoning about finite failure (Q4938429)
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 1405454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fixpoint semantics for reasoning about finite failure |
scientific article; zbMATH DE number 1405454 |
Statements
12 December 2000
0 references
logic programming
0 references
abstract interpretation
0 references
negation
0 references
0.8086177706718445
0 references
0.7948884963989258
0 references
0.7947596907615662
0 references
0.793729841709137
0 references
A fixpoint semantics for reasoning about finite failure (English)
0 references
The semantic of negation in logic programming has received a considerable attention in the last few years and is still an active research area. This paper contributes to this field by considering the semantics of finite failure. The result obtained here shows that one can obtain a fixpoint characterization of the set of atoms having a fair finitely failed SLD-tree. The proof uses in a nice way abstract interpretation techniques, thus showing that these techniques can be useful also outside the area of static analysis. For the entire collection see [Zbl 0921.00037].
0 references
