Skip to Main content Skip to Navigation
Conference papers

Simple conceptual graphs revisited: hypergraphs and conjunctive types for efficient projection algorithms

Abstract : Simple Conceptual Graphs (SGs) form the cornerstone for the "Conceptual Graphs" family of languages. In this model, the subsumptio 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. This paper presents some such algorithms, inspired by those developped for Constraint Satisfaction Problems. In order to benefit from the optimization work done in this community, we have chosen to present an alternate version of SGs, differences being the definition of these graphs as hypergraphs and the use of conjunctive types.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-00906599
Contributor : Jérôme Euzenat Connect in order to contact the contributor
Submitted on : Wednesday, November 20, 2013 - 10:05:33 AM
Last modification on : Wednesday, November 4, 2020 - 11:32:02 AM
Long-term archiving on: : Friday, February 21, 2014 - 4:24:34 AM

File

baget2003a.pdf
Files produced by the author(s)

Identifiers

Collections

`

Citation

Jean-François Baget. Simple conceptual graphs revisited: hypergraphs and conjunctive types for efficient projection algorithms. Proc. 11th international conference on conceptual sructures (ICCS), Jul 2003, Dresden, Germany. pp.229-242, ⟨10.1007/978-3-540-45091-7_16⟩. ⟨hal-00906599⟩

Share

Metrics

Record views

260

Files downloads

488