Extensions of simple conceptual graphs: The complexity of rules and constraints

Journal of Artificial Intelligence Research

Volumn 16, Issue , 2002, Pages 425-465

  Baget, Jean François ^a   Mugnier, Marie Laure ^a  

^a LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MATHEMATICAL MODELS; POLYNOMIALS; SEMANTICS;

GRAPH HOMOMORPHISM; KERNEL; SOWA'S MODELS;

GRAPH THEORY;

EID: 26944480924     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.918     Document Type: Article

References (36)

1. Abiteboul, S., Hull, R., & Vianu, V. (1995). Foundations of Databases. Addison-Wesley.
2. Baader, F., Molitor, R., & Tobies, S. (1999). Tractable and Decidable Fragments of Conceptual Graphs. In Proc. of ICCS'99, LNAI 1640, pp. 480-493. Springer.
3. Baget, J.-F., Genest, D., & Mugnier, M.-L. (1999). Knowledge Acquisition with a Pure Graph-Based Knowledge Representation Model - Application to the Sisyphus-I Case Study. In Proc. of KAW'99. available at http://sern.ucalgary.ca/KSI/KAW/KAW99/papers.htm.
4. Baget, J.-F., & Mugnier, M.-L. (2001). The SG Family: Extensions of Simple Conceptual Graphs. In Proc. of IJCAI'01, pp. 205-210.
5. Baget, J.-F. (2001). Représenter des connaissances et raisonner avec des hypergraphes: de la projection à la dérivation sous contraintes. Ph.D. thesis, University of Montpellier II.
6. Borgida, A. (1996). On the relative expressiveness of description logics and predicate logics. Artificial Intelligence Journal, 82, 353-367.
7. Bos, C., Botella, B., & Vanheeghe, P. (1997). Modeling and Simulating Human Behaviors with Conceptual Graphs. In Proc. of ICCS'97, LNAI 1257, pp. 275-289. Springer.
8. Chandra, A. K., & Merlin, P. M. (1977). Optimal implementation on conjunctive queries in relational data bases. In Proc. ACM SIGACT Symp. on the Theory of Computing, pp. 77-90.
9. Chein, M., & Mugnier, M.-L. (1992). Conceptual Graphs: Fundamental Notions. Revue d'Intelligence Artificielle, 6(4), 365-406.
10. Chein, M., Mugnier, M.-L., & Simonet, G. (1998). Nested Graphs: A Graph-based Knowledge Representation Model with FOL Semantics. In Proc. of KR'98, pp. 524-534. Morgan Kaufmann.
11. Cogis, O., & Guinaldo, O. (1995). A linear descriptor for conceptual graphs and a class for polynomial isomorphism test. In Proc. of ICCS'95, LNAI 954, pp. 263-277. Springer.
12. Coulondre, S., & Salvat, E. (1998). Piece Resolution: Towards Larger Perspectives. In Proc. of ICCS'98, LNAI 1453, pp. 179-193. Springer.
13. Dibie, J., Haemmerlé, O., & Loiseau, S. (1998). A Semantic Validation of Conceptual Graphs. In Proc. of ICCS'98, LNAI 1453, pp. 80-93. Springer.
14. Fargier, H., Lang, J., & Schiex, T. (1996). Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge. In Proc. of AAAI'96, pp. 175-180.
15. Feder, T., & Vardi, M. (1993). Monotone Monadic SNP and Constraint Satisfaction. In Proceedings of the 25th ACM STOC, pp. 612-622.
16. Genest, D. (2000). Extension du modèle des graphes conceptuels pour la recherche d'informations. Ph.D. thesis, Université Montpellier II.
17. Gosh, B. C., &: Wuwongse, V. (1995). A Direct Proof Procedure for Definite Conceptual Graphs Programs. In Proc. of ICCS'95, LNAI 954, pp. 158-172. Springer.
18. Gottlob, G., Leone, N., & Scarcello, F. (1999). A Comparison of Structural CSP Decomposition Methods. In Proc. of IJCAI'99, pp. 394-399.
19. Kerdiles, G. (1997). Projection: A Unification Procedure for Tableaux in Conceptual Graphs. In Proc. of TABLEAUX'97, LNAI 1227, pp. 216-230.
20. Konolige, K. (1996). Abductive Theories in Artificial Intelligence. In Principles of Knowledge Representation, pp. 129-152. CSLI Publications.
21. Levy, A. Y., & Rousset, M.-C. (1996). Verification of Knowledge Bases Based on Containment Checking. In Proc. of AAAI'96, pp. 585-591.
22. Mineau, G. W., & Missaoui, R. (1997). The Representation of Semantic Constraints in Conceptual Graphs Systems. In Proc. of ICCS'97, LNAI 1257, pp. 138-152. Springer.
23. Mugnier, M.-L. (1995). On Generalization / Specialization for Conceptual Graphs. Journal of Experimental and Theoretical Artificial Intelligence, 7, 325-344.
24. Mugnier, M.-L. (2000). Knowledge Representation and Reasonings based on graph Homomorphism. In Proc. of ICCS'00, pp. 172-192. Springer.
25. Mugnier, M.-L., & Chein, M. (1996). Représenter des connaissances et raisonner avec des graphes. Revue d'Intelligence Artificielle, 10(1), 7-56.
26. Papadimitriou, C. H. (1994). Computational Complexity. Addison-Wesley.
27. Post, E. L. (1947). Recursive unsolvability of a problem of Thue. Journal of Symbolic Logic, 12(1), 1-11.
28. Reprinted in: M. Davis (Ed.), The Collected Works of Emil L. Post, Birkhauser, Boston 1994, pp. 503-513.
29. Preller, A., Mugnier, M.-L., & Chein, M. (1998). Logic for Nested Graphs. Computational Intelligence, 14(3), 335-357.
30. Rudolf, M. (1998). Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching. In Proc. of 6th International Workshop on Theory and Application of Graph Transformations, LNCS 1764, pp. 238-251. Springer.
31. Salvat, E. (1998). Theorem proving using graph operations in the conceptual graphs formalism. In Proc. of ECAI'98, pp. 356-360.
32. Salvat, E., & Mugnier, M.-L. (1996). Sound and Complete Forward and Backward Chainings of Graph Rules. In Proc. of ICCS'96, LNAI 1115, pp. 248-262. Springer.
33. Sowa, J. F. (1984). Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley.
34. Stockmeyer, L. J. (1977). The polynomial-time hierarchy. Theoretical Computer Science, 3, 1-22.
35. Thue, A. (1914). Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln. Skr. Viedensk. Selsk. I, 10.
36. Wermelinger, M. (1995). Conceptual Graphs and First-Order Logic. In Proc. of ICCS'95, LNAI 954, pp. 323-337.