Declarative programs with implicit implication

In the presence of taxonomic information, there often exists implicit implication among atoms in an interpretation domain. A general framework is proposed for the discussion of an appropriate semantics for declarative programs with respect to such implicit implication. It is first assumed that the i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on knowledge and data engineering Jg. 14; H. 4; S. 836 - 849
Hauptverfasser: Wuwongse, W., Nantajeewarawat, E.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.07.2002
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Computer Society
Deductive databases
Foundations
Knowledge based systems
Knowledge representation
Logic
Mathematical models
Object oriented databases
Object oriented modeling
Ontologies
Operators
Representations
Semantics
Studies
Taxonomy
Vocabulary
ISSN:1041-4347, 1558-2191
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In the presence of taxonomic information, there often exists implicit implication among atoms in an interpretation domain. A general framework is proposed for the discussion of an appropriate semantics for declarative programs with respect to such implicit implication. It is first assumed that the implicit implication can be predetermined and represented by a preorder on the interpretation domain. Under the consequent constraint that every interpretation must conform to the implicit implication, an appropriate model-theoretic semantics as well as its corresponding fixpoint semantics for declarative programs is described. Based on Kostler et al.'s (1993) foundation of fixpoint with subsumption, it is shown that, it the implicit-implication relation is, in addition, assumed to be a partial order, then the meaning of a program can be determined more efficiently by application of an immediate-consequence operator which involves only reduced representations, basically consisting only of their maximal elements, of subsets of the interpretation domain.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1041-4347
1558-2191
DOI:10.1109/TKDE.2002.1019217