Knowledge Representation and Reasonings Based on Graph Homomorphism

Mugnier, Marie-Laure

doi:10.1007/10722280_12

Cited by 45 publications

(41 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In that purpose, we suggest a query/answering mechanism using the "projection" operation, based on operations of graphs defined in the CGs. The fact that the same language (CGs) is used as an interface and as an operational tool makes transparent the logical structure of information, facilitating the understanding and interpretation of the results by the user (Mugnier, 2000).…”

Section: Post-processingmentioning

confidence: 99%

See 1 more Smart Citation

Improving Maintenance Strategies from Experience Feedback

Ruiz

Foguem²,

Grabot³

2013

IFAC Proceedings Volumes

View full text Add to dashboard Cite

Section: Post-processingmentioning

confidence: 99%

“…Given WZR JUDSKV * DQG + + " * * LV VDLG WR "subsume" H) if H can be obtained from G by a global operation (projection), ZKLFK LV HVVHQWLDOO\ D KRPRPRUSKLVP RI JUDSK 7KXV + " * implies the existence of a projection from G to H (Mugnier, 2000).…”

Section: Post-processingmentioning

confidence: 99%

Improving Maintenance Strategies from Experience Feedback

Ruiz

Foguem²,

Grabot³

2013

IFAC Proceedings Volumes

View full text Add to dashboard Cite

“…As indicated in [2], thanks to a reduction from constraint networks (CSP) that preserves the structure of the projected graph [9], all structural restrictions on CSPs leading to polynomial algorithms (e.g. hypertrees decompositions in [8]) translate to structural restrictions on the projected simple CG leading to polynomial algorithms.…”

Section: Calculus Definition 4 (Projection) Let G and H Be Two Simplmentioning

confidence: 99%

Rules Dependencies in Backward Chaining of Conceptual Graphs Rules

Baget

Salvat²

2006

Conceptual Structures: Inspiration and Application

View full text Add to dashboard Cite

Abstract. 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 compiling dependencies between rules. In this paper, we show that the unification used in the first algorithm is exactly the operation required to compute dependencies in the second one. We also combine the benefits of the two approaches, by using the graph of rules dependencies in a Backward Chaining framework.

show abstract

“…In the first subsection (4.1), we compare the derivation rules used as a sound and complete calculus for conceptual graphs [15] and concept graphs [18,7]. Then (4.2) we compare their reformulation as a kind of graph homomorphism named projection [5,18], and discuss the interests of this global operation for efficiency purpose.…”

Section: Calculusmentioning

confidence: 99%

Simple Conceptual Graphs and Simple Concept Graphs

Aubert

Baget

Chein

2006

Conceptual Structures: Inspiration and Application

View full text Add to dashboard Cite

Abstract. Sowa's Conceptual Graphs and Formal Concept Analysis have been combined into another knowledge representation formalism named Concept Graphs. In this paper, we compare Simple Conceptual Graphs with Simple Concept Graphs, by successively studying their different syntaxes, semantics, and entailment calculus. We show that these graphs are almost identical mathematical objects, have equivalent semantics, and similar inference mechanisms. We highlight the respective benefits of these two graph-based knowledge representation formalisms, and propose to unify them.

show abstract

Knowledge Representation and Reasonings Based on Graph Homomorphism

Cited by 45 publications

References 14 publications

Improving Maintenance Strategies from Experience Feedback

Improving Maintenance Strategies from Experience Feedback

Rules Dependencies in Backward Chaining of Conceptual Graphs Rules

Simple Conceptual Graphs and Simple Concept Graphs

Contact Info

Product

Resources

About