Semantics of notation3 logic: A solution for implicit quantification

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Since the development of Notation3 Logic, several years have passed in which the theory has been refined and used in practice by different reasoning engines such as cwm, FuXi or EYE. Nevertheless, a clear model-theoretic definition of its semantics is still missing. This leaves room for individual interpretations and renders it difficult to make clear statements about its relation to other logics such as DL or FOL or even about such basic concepts as correctness. In this paper we address one of the main open challenges: the formalization of implicit quantification. We point out how the interpretation of implicit quantifiers differs in two of the above mentioned reasoning engines and how the specification, proposed in the W3C team submission, could be formalized. Our formalization is then put into context by integrating it into a model-theoretic definition of the whole language. We finish our contribution by arguing why universal quantification should be handled differently than currently prescribed.

Cite

CITATION STYLE

APA

Arndt, D., Verborgh, R., De Roo, J., Sun, H., Mannens, E., & Van De Walle, R. (2015). Semantics of notation3 logic: A solution for implicit quantification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9202, pp. 127–143). Springer Verlag. https://doi.org/10.1007/978-3-319-21542-6_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free