Simple Conceptual Graphs Revisited: Hypergraphs and Conjunctive Types for Efficient Projection Algorithms

Simple Conceptual Graphs (SGs) form the cornerstone for the "Conceptual Graphs" family of languages. In this model, the subsumption operation is called projection; it is a labelled graphs homomorphism (a NP-hard problem). Designing efficient algorithms to compute projections between two SGs is thus of uttermost importance for the community building languages on top of this basic model.

[1]  Solomon W. Golomb,et al.  Backtrack Programming , 1965, JACM.

[2]  John F. Sowa,et al.  Conceptual Graphs for a Data Base Interface , 1976, IBM J. Res. Dev..

[3]  J. Gaschnig.  Performance measurement and analysis of certain search algorithms. , 1979 .

[4]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[5]  John F. Sowa,et al.  Conceptual Structures: Information Processing in Mind and Machine , 1983 .

[6]  M. Chein,et al.  Conceptual graphs: fundamental notions , 1992 .

[7]  Patrick Prosser,et al.  HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..

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

[9]  Michel Wermelinger,et al.  Conceptual Graphs and First-Order Logic , 1995, ICCS.

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

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

[12]  Martin E. Dyer,et al.  Locating the Phase Transition in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..

[13]  Gwen Kerdiles,et al.  Projection: A Unification Procedure for Tableaux in Conceptual Graphs , 1997, TABLEAUX.

[14]  David Genest,et al.  A Platform Allowing Typed Nested Graphs: How CoGITo Became CoGITaNT (Research Note) , 1998, ICCS.

[15]  Jean-François Baget.  A Simulation of Co-identity with Rules in Simple and Nested Graphs , 1999, ICCS.

[16]  Franz Baader,et al.  Tractable and Decidable Fragments of Conceptual Graphs , 1999, ICCS.

[17]  On Forward Checking for Non-binary Constraint Satisfaction , 1999, CP.

[18]  Joxan Jaffar,et al.  Principles and Practice of Constraint Programming – CP’99 , 1999, Lecture Notes in Computer Science.

[19]  Knowledge Representation and Reasonings Based on Graph Homomorphism , 2000, ICCS.

[20]  Roy Dyckhoff.  Automated Reasoning with Analytic Tableaux and Related Methods , 2000, Lecture Notes in Computer Science.

[21]  Bernhard Ganter,et al.  Conceptual Structures: Logical, Linguistic, and Computational Issues , 2000, Lecture Notes in Computer Science.

[22]  Jean-François Baget.  Extending the CG Model by Simulations , 2000, ICCS.

[23]  Jean-François Baget,et al.  Backtracking Through Biconnected Components of a Constraint Graph , 2001, IJCAI.