Baader F., R. Molitor and S. Tobies (1999), Tractable and decidable fragments of Conceptual Graphs, In ICCS'99 proceedings, LNAI, Springer Verlag. 480-493. 31 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Compilation and Approximation of Conjunctive Queries by.. - Goasdoué, Rousset (2002) (Correct)
.... q(X) Expand(q; X) be the tree query defined by its expansion: C j q j Compil(q) Theorem 1 is based on an extension of the homomophism theorem for relational conjunctive queries [9] It is a direct adaptation of the extension of the homomophism theorem for conceptual graphs [18, 10] pointed in [3] for establishing the correspondence between conceptual graphs and description logics. The result comes from the combination of two known results [15, 12] i) checking whether there exists a homomorphism from a tree onto a graph, and (ii) checking subsumption of two AL concept descriptions can ....
....ALC) In [2] lower approximations of concept descriptions are defined w.r.t a given description logic and a terminology. The problem addressed in [7] is the computation for ALC concept descriptions of their upper approximation in ALE . As for the compilation preserving equivalence, in [3], an equivalent translation is provided from the ELIRO1 description logics into a subclass of rooted simple conceptual graphs. However, they do not provide a necessary condition for a rooted simple conceptual graph (i.e. a unary conjunctive query) to be equivalently compilable into a concept ....
F. Baader, R. Molitor, and S. Tobies, `Tractable and decidable fragments of conceptual graphs', in Proceedings of ICCS'99.
Knowledge Representation and Reasonings Based on Graph Homomorphism - Mugnier (2000) (1 citation) (Correct)
....viewpoint. For instance, just to give some immediate notions, a path, a cycle or a distance are natural notions on graphs and are not in logics. See for instance the algorithm for backward chaining of production rules based on the graph notion of a piece in [SM96] or the complexity result in [BMT99] (the deduction problem of a description logic, whose complexity was unknown, is shown to be solvable in polynomial time by a translation into a graph homomorphism problem) Limitations. One question we have been exploring can be summarized as follows how far is it possible to go in knowlegde ....
F. Baader, R. Molitor, and S. Tobies. Tractable and Decidable Fragments of Conceptual Graphs. In Proc. ICCS'99, LNAI 1640, pages 480493. Springer Verlag, 1999.
An algorithmic definition of CG operations based on a - Adil Kabbaj Bernard (Correct)
No context found.
Baader F., R. Molitor and S. Tobies (1999), Tractable and decidable fragments of Conceptual Graphs, In ICCS'99 proceedings, LNAI, Springer Verlag. 480-493. 31
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC