Theory of generalized annotated logic programming and its applications* * A preliminary report on this research has appeared in [34].

Michael Kifer, V. S. Subrahmanian

Research output: Contribution to journalArticlepeer-review

304 Scopus citations

Abstract

Annotated logics were introduced in [43] and later studied in [5, 7, 31, 32]. In [32], annotations were extended to allow variables and functions, and it was argued that such logics can be used to provide a formal semantics for rule-based expert systems with uncertainty. In this paper, we continue to investigate the power of this approach. First, we introduce a new semantics for such programs based on ideals of lattices. Subsequently, some proposals for multivalued logic programming [5, 7, 18, 32, 40, 47] as well as some formalisms for temporal reasoning [1, 3, 41] are shown to fit into this framework. As an interesting byproduct of the investigation, we obtain a new result concerning multivalued logic programming: a model theory for Fitting's bilattice-based logic programming, which until now has not been characterized model-theoretically. This is accompanied by a corresponding proof theory.

Original languageEnglish (US)
Pages (from-to)335-367
Number of pages33
JournalJournal of Logic Programming
Volume12
Issue number4
DOIs
StatePublished - Apr 1992
Externally publishedYes

ASJC Scopus subject areas

  • Logic

Fingerprint

Dive into the research topics of 'Theory of generalized annotated logic programming and its applications<sup>*</sup> * A preliminary report on this research has appeared in [34].'. Together they form a unique fingerprint.

Cite this