Sökning: onr:"swepub:oai:research.chalmers.se:281f13ab-3733-4027-90af-c2ef0efacbbf" >
Capturing Quantifie...
Capturing Quantified Constraints in FOL, Through Interaction with a Relationship Graph
-
Gray, P. M. D. (författare)
-
- Kemp, Graham, 1965 (författare)
- Chalmers tekniska högskola,Chalmers University of Technology
-
(creator_code:org_t)
- ISBN 9783540463634
- Berlin, Heidelberg : Springer Berlin Heidelberg, 2006
- 2006
- Engelska.
-
Ingår i: Managing Knowledge in a World of Networks: 15th International Conference, EKAW 2006, Lecture Notes in Computer Science. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 9783540463634 ; 4248, s. 19-26
- Relaterad länk:
-
https://doi.org/10.1...
-
visa fler...
-
https://research.cha...
-
visa färre...
Innehållsförteckning
Abstract
Ämnesord
Stäng
No table of content available
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- kon (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas