Abstract
In classical logical programming, one of the most powerful conceptual tools consists of the semantic interpretation of a set of formulas, like functions on ordered sets with certain structural properties. Such functions in combination with fixed point theorems as the Knaster-Tarsky, allow solving equations of definition in the declaratory semantics of a logical program, giving foundation to a complete semantics for the program. In this work, through an operator of consequence based on a technique of annotated hyper-resolution well-known as f-resolution, we introduce a semantics of fixed point for annotated logical programs.
| Original language | Spanish |
|---|---|
| Pages (from-to) | 87-102 |
| Journal | Matemáticas Enseñanza universitaria |
| Volume | 16 |
| Issue number | 2 |
| State | Published - 2008 |
| Externally published | Yes |
Keywords
- Fixed pints
- annotateds logics
- hyper-resolution
- programming logic