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

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