Capturing quantified constraints in FOL, through interaction with a relationship graph

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

Abstract

As new semantic web standards evolve to allow quantified rules in FOL, we need new ways to capture them from end users in RDFS(XML). We show how to do this against a graphic view of Entities and their Relationships (associated or derived). This even allows inclusion of existential quantifiers in readable fashion. The captured constraint can be tested by generating queries to search for violations in stored data. The constraint can then be automatically revised to exclude specific cases picked out by the user, who is spared worries about proper syntax and boolean connectives. © Springer.Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Gray, P. M. D., & Kemp, G. J. L. (2006). Capturing quantified constraints in FOL, through interaction with a relationship graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4248 LNAI, pp. 19–26). Springer Verlag. https://doi.org/10.1007/11891451_4

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