CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Capturing Quantified Constraints in FOL, Through Interaction with a Relationship Graph

P. M. D. Gray ; Graham J.L. Kemp (Institutionen för data- och informationsteknik, Datavetenskap, Bioinformatik (Chalmers))
Managing Knowledge in a World of Networks: 15th International Conference, EKAW 2006, Lecture Notes in Computer Science Vol. 4248 (2006), p. 19-26.
[Konferensbidrag, refereegranskat]

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.

Denna post skapades 2006-11-01.
CPL Pubid: 22677