Piece resolution: Towards larger perspectives
- 125 Downloads
This paper focuses on two aspects of piece resolution in backward chaining for conceptual graph rules . First, as conceptual graphs admit a first-order logic interpretation, inferences can be proven by classical theorem provers. Nevertheless, they do not use the notion of piece, which is a graph notion. So we define piece resolution over a class of first-order logical formulae: the logical rules. An implementation of this procedure has been done, and we compare the results with the classical SLD-resolution (i.e. Prolog). We point out several interesting results: it appears that the number of backtracks is strongly reduced. Second, we point out the similarities between these rules and database data dependencies. The implication problem for dependencies is to decide whether a given dependency is logically implied by a given set of dependencies. A proof procedure for the implication problem, called “chase”, was already studied. The chase is a bottom-up procedure: from hypothesis to conclusion. This paper introduces a new proof procedure which is topdown: from conclusion to hypothesis. Indeed, we show that the implication problem for dependencies can be reduced to the existence of a piece resolution.
KeywordsLogical Rule Horn Clause Existential Quantifier Conceptual Graph Proof Procedure
Unable to display preview. Download preview PDF.
- 6.Stéphane Coulondre. Exploitation de la notion de pièce des règles de graphes conceptuels en programmation logique et en bases de données. Master's thesis, Université Montpellier II, 1997.Google Scholar
- 8.Bikash Chandra Ghosh and V. Wuwongse. A direct proof procedure for definite conceptual graph programs. Lecture Notes in Computer Science, 954, 1995.Google Scholar
- 9.R. A. Kowalski. Predicate logic as a programming language. Proc. IFIP 4, pages 569–574, 1974.Google Scholar
- 10.J. W. Lloyd. Foundations of Logic Programming, Second Edition. Springer-Verlag, 1987.Google Scholar
- 12.Eric Salvat. Raisonner avec des opérations de graphes: graphes conceptuels et règles d'inférence. PhD thesis, Université Montpellier II, Montpellier, France, December 1997.Google Scholar
- 13.Eric Salvat and Marie-Laure Mugnier. Sound and complete forward and backward chainings of graph rules. In Proceedings of the Fourth International Conference on Conceptual Structures (ICCS-96), volume 1115 of LNAI, pages 248–262, Berlin, Augustl9–22 1996. Springer.Google Scholar