Flexible Computation of the Well-Founded Semantics of Normal Logic Programs

The well-founded semantics has been accepted as the most relevant semantics for logic-based information systems. In this dissertation a framework based on a set of program transformations is presented that generalizes all major computation approaches for the well-founded semantics using a common data structure and provides a common language to describe their evaluation strategy. This rewriting system gives the formal background to analyze and combine different evaluation strategies in a common framework, or to design new algorithms and prove the correctness of its implementations at a high level just by changing the order of program transformations.

Level thesis:degree_level

thesis.doctoral

Grantor dc:publisher

Universität Passau

Year

2001

Author dc:creator

• Zukowski, Ulrich

Contributors dc:contributor

• Brandenburg, Franz-Josef

• Wohlfundierte Semantik
• Logische Programme
• Programmtransformation
• Auswertungsstrategien
• well-founded semantics
• program transformations

Statement dc:rights

• Standardbedingung laut Einverständniserklärung

Repository record source_url

https://opus4.kobv.de/opus4-uni-passau/frontdoor/index/index/docId/19

OAI identifier oai:identifier

oai:kobv.de-opus4-uni-passau:19