Abstract
The paper introduces two connected advancements of Positional-Slotted, Object-Applicative RuleML: (1) a model-theoretic semantics, realized transformationally, that directly handles atoms (i.e., predicate applications) without object identifiers (e.g., relationships as in Prolog) and (2) a transformational semantics that handles nested atomic formulas (e.g., nested frames as in Flora-2/F-logic). For (1), the model theory is extended to atoms with optional OIDs, the transformation is developed from static to dynamic objectification, and the correctness of the realization is proved. For (2), the unnesting transformation is defined to decompose nested atomic formulas into equivalent conjunctions.
Cite
CITATION STYLE
Zou, G., & Boley, H. (2016). Minimal objectification and maximal unnesting in PSOA ruleML. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9718, pp. 130–147). Springer Verlag. https://doi.org/10.1007/978-3-319-42019-6_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
