The complexity of concept languages
Information and Computation
Polynomial Algorithms for Projection and Matching
Proceedings of the 7th Annual Workshop on Conceptual Structures: Theory and Implementation
Conceptual Graphs and First-Order Logic
ICCS '95 Proceedings of the Third International Conference on Conceptual Structures: Applications, Implementation and Theory
A Sound and Complete CG Proof Procedure Combining Projections with Analytic Tableaux
ICCS '97 Proceedings of the Fifth International Conference on Conceptual Structures: Fulfilling Peirce's Dream
Towards Correspondence between Conceptual Graphs and Description Logics
ICCS '98 Proceedings of the 6th International Conference on Conceptual Structures: Theory, Tools and Applications
A Resolution Decision Procedure for the Guarded Fragment
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Quo Vadis, CS? --- On the (non)-Impact of Conceptual Structures on the Semantic Web
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
Ideal downward refinement in the EL description logic
ILP'09 Proceedings of the 19th international conference on Inductive logic programming
Fr-ONT: an algorithm for frequent concept mining with formal ontologies
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
| Hi-index | 0.00 |
It is well-known that problems like validity and subsumption of general CGs are undecidable, whereas subsumption is NP-complete for simple conceptual graphs (SGs) and tractable for SGs that are trees. We will employ results on decidable fragments of first-order logic to identify a natural and expressive fragment of CGs for which validity and subsumption is decidable in EXPTIME. In addition, we will extend existing work on the connection between SGs and description logics (DLs) by identifying a DL that corresponds to the class of SGs that are trees. This yields a tractability result previously unknown in the DL community.