Learn More
In ∀∃-rules, the conclusion may contain existen-tially quantified variables, which makes reasoning tasks (as deduction) non-decidable. These rules have the same logical form as TGD (tuple-generating dependencies) in databases and as conceptual graph rules. We extend known decidable cases by combining backward and forward chaining schemes, in association(More)
Conceptual Graphs Rules were proposed as an extension of Simple Conceptual Graphs (CGs) to represent knowledge of form " if A then B " , where A and B are simple CGs. Optimizations of the deduction calculus in this KR formalism include a Backward Chaining that unifies at the same time whole subgraphs of a rule, and a Forward Chaining that relies on(More)
Simple conceptual graphs can be seen as a very basic description logic, allowing however for answering conjunctive queries. In the first part of this paper, we translate some results obtained for conceptual graph rules of form " if A then B " into an equivalent DL-based formalism. Then we show that, our algorithms can automatically decide in some cases(More)