Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-17T22:24:18.521Z Has data issue: false hasContentIssue false
  • English
  • Français

A uniform approach to logic programming semantics

Published online by Cambridge University Press:  10 January 2005

PASCAL HITZLER  and
MATTHIAS WENDT
PASCAL HITZLER
Affiliation:
Institute AIFB, University of Karlsruhe, Germany (e-mail: [email protected])
MATTHIAS WENDT
Affiliation:
Department of Mathematics and Computer Science, University of Leipzig, Germany (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

Part of the theory of logic programming and nonmonotonic reasoning concerns the study of fixed-point semantics for these paradigms. Several different semantics have been proposed during the last two decades, and some have been more successful and acknowledged than others. The rationales behind those various semantics have been manifold, depending on one's point of view, which may be that of a programmer or inspired by commonsense reasoning, and consequently the constructions which lead to these semantics are technically very diverse, and the exact relationships between them have not yet been fully understood. In this paper, we present a conceptually new method, based on level mappings, which allows to provide uniform characterizations of different semantics for logic programs. We will display our approach by giving new and uniform characterizations of some of the major semantics, more particular of the least model semantics for definite programs, of the Fitting semantics, and of the well-founded semantics. A novel characterization of the weakly perfect model semantics will also be provided.

Keywords

level mappingFitting semanticswell-founded semanticsleast model seman ticsstable semanticsweak stratification
Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 5 , Issue 1-2 , January 2005 , pp. 93 - 121
Copyright
© 2005 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)