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

Gray, Prof P.M.D. and Kemp, Dr G.J.L. (2006) Capturing Quantified Constraints in FOL, Through Interaction with a Relationship Graph. In Staab, Dr Stefan and Svátek, Dr V., Eds. Proceedings Managing Knowledge in a World of Networks: 15th International Conference (EKAW 2006) Lecture Notes in Computer Science (vol. 4248), pages pp. 19-26, Podebrady, CZ.

Full text available as:

PDF (This is a full length version of the published paper.) - Requires Adobe Acrobat Reader or other PDF viewer.

As new semantic web standards evolve to allow quanti¯ed rules in FOL, we need new ways to capture them from end users.We show how to do this against a graphic view of entities and their relationships (not just their subclasses). Some of these relationships can be derived from data values by algebraic expressions. For example scientists may use ad hoc lists of numbers instead of SQL key-matching conventions, as we show in the case of molecular pathway data. The derived relationships can also be included in captured constraints, which express domain se- mantics better. The constraints are captured as FOL and transmitted in RDFS(XML) format. However the user unfamiliar with FOL is made to see them as simple nested loops. This device even allows inclusion of ex- istential quanti¯ers 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 speci¯c cases picked out by the user, who is spared worries about proper syntax and boolean connectives.

Contact the site administrator at: hg@ecs.soton.ac.uk