Piece Resolution: Towards Larger Perspectives

This paper focuses on two aspects of piece resolution in backward chaining for conceptual graph rules [13]. 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.

[1]  Marie-Claude Landau,et al.  Conceptual Graphs for Semantics and Knowledge Processing , 1986, IBM J. Res. Dev..

[2]  Moshe Y. Vardi The implication and finite implication problems for typed template dependencies , 1982, PODS '82.

[3]  J. Lloyd Foundations of Logic Programming , 1984, Symbolic Computation.

[4]  Donald W. Loveland,et al.  A Simplified Format for the Model Elimination Theorem-Proving Procedure , 1969, J. ACM.

[5]  Alain Colmerauer Prolog in 10 figures , 1985, CACM.

[6]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[7]  Moshe Y. Vardi The implication and finite implication problems for typed template dependencies , 1982, J. Comput. Syst. Sci..

[8]  Vilas Wuwongse,et al.  A Direct Proof Procedure for Definite Conceptual Graph Programs , 1995, ICCS.

[9]  Marie-Laure Mugnier,et al.  Sound and Complete Forward and backward Chainingd of Graph Rules , 1996, ICCS.

[10]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[11]  Catriel Beeri,et al.  A Proof Procedure for Data Dependencies , 1984, JACM.

[12]  Eric Salvat Raisonner avec des opérations de graphes : graphes conceptuels et règles d'inférence , 1997 .

[13]  Paul McKevitt,et al.  Integration of natural language and vision processing: grounding representations , 1996 .

[14]  M. Mugnier,et al.  Représenter des connaissances et raisonner avec des graphes , 1996 .

[15]  Robert A. Kowalski,et al.  Predicate Logic as Programming Language , 1974, IFIP Congress.