Tractable and decidable fragments of conceptual graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1640, Issue , 1999, Pages 480-493

  Baader, F ^a   Molitor, R ^a   Tobies, S ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; DATA DESCRIPTION; FORESTRY; FORMAL LOGIC;

CONCEPTUAL GRAPH; DESCRIPTION LOGIC; EXPTIME; FIRST ORDER LOGIC; NP COMPLETE;

TREES (MATHEMATICS);

EID: 84958673907     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48659-3_31     Document Type: Conference Paper

References (16)

1. H. Andréka, J. van Benthem, and I. Németi. Modal languages and bounded fragments of predicate logic. J. of Philosophical Logic, 27(3):217-274, 1998.
2. F. Baader, R. Molitor, and S. Tobies. The Guarded Fragment of Conceptual Graphs. LTCS-Report 98-10, available at http://www-lti.informatik.rwthaachen.de/Forschung/Papers.html.
3. F. Baader, R. Molitor, and S. Tobies. On the Relationship between Descripion Logics and Conceptual Graphs. LTCS-Report 98-11, available at http://wwwlti.informatik.rwth-aachen.de/Forschung/Papers.html.
4. E. Borger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Perspectives in Mathematical Logic. Springer, 1997.
5. M. Chein and M. L. Mugnier. Conceptual graphs: fundamental notions. Revue d’Intelligence Artificielle, 6(4):365-406, 1992.
6. M. Chein, M. L. Mugnier, and G. Simonet. Nested graphs: a graph-based knowledge representation model with FOL semantics. In Proc. KR’98, 1998.
7. P. Coupey and C. Faron. Towards correspondences between conceptual graphs and description logics. In Proc. IGGS’98, LNCS 1453, 1998.
8. H. de Nivelle. A resolution decision procedure for the guarded fragment. In Proc. CADE-15, LNCS 1421, 1998.
9. F. M. Donini, M. Lenzerini, D. Nardi, and W. Nutt. The complexity of concept languages. Information and Computation, 134(1):1-58, 1997.
10. F. M. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Reasoning in description logics. In Foundation of Knowledge Representation, CSLI-Publications, 1996.
11. E. Grädel. On the restraining power of guards. Journal of Symbolic Logic, 1999. To appear.
12. G. Kerdiles and E. Salvat. A sound and complete CG proof procedure combining projections with analytic tableaux. In Proc. ICCS’97, LNCS 1257, 1997.
13. M. L. Mugnier and M. Chein. Polynomial algorithms for projection and matching. In Proc. 7th Workshop on Conceptual Structures, 1992, LNCS 754, 1993.
14. John F Sowa. Conceptual Structures. Addison-Wesley, 1984.
15. J. van Benthem. Dynamic Bits and Pieces. Technical Report LP-1997-01, ILLC, University of Amsterdam, The Netherlands, 1997.
16. M. Wermelinger. Conceptual graphs and first-order logic. In Proc. ICCS’95, LNCS 954, 1995.