Abstract
This article introduces a preliminary declarative semantics for a subset of the language Xcerpt (so-called grouping-stratifiable programs) in form of a classical (Tarski style) model theory, adapted to the specific requirements of Xcerpt’s constructs (e.g. the various aspects of incompleteness in query terms, grouping constructs in rule heads, etc.). Most importantly, the model theory uses term simulation as a replacement for term equality to handle incomplete term specifications, and an extended notion of substitutions in order to properly convey the semantics of grouping constructs. Based upon this model theory, a fixpoint semantics is also described, leading to a first notion of forward chaining evaluation of Xcerpt programs
Item Type: | Paper |
---|---|
Form of publication: | Submitted Version |
Keywords: | reasoning, query language, Semantic Web, model theory, semantics, declarative semantics |
Faculties: | Mathematics, Computer Science and Statistics > Computer Science |
Subjects: | 000 Computer science, information and general works > 004 Data processing computer science |
URN: | urn:nbn:de:bvb:19-epub-14893-8 |
Language: | English |
Item ID: | 14893 |
Date Deposited: | 19. Apr 2013, 08:35 |
Last Modified: | 13. Aug 2024, 12:51 |