A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
A Direct Proof Procedure for Definite Conceptual Graph Programs
ICCS '95 Proceedings of the Third International Conference on Conceptual Structures: Applications, Implementation and Theory
Sound and Complete Forward and backward Chainingd of Graph Rules
ICCS '96 Proceedings of the 4th International Conference on Conceptual Structures: Knowledge Representation as Interlingua
Piece Resolution: Towards Larger Perspectives
ICCS '98 Proceedings of the 6th International Conference on Conceptual Structures: Theory, Tools and Applications
On the decidability and complexity of query answering over inconsistent and incomplete databases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Containment of conjunctive object meta-queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Graph-based Knowledge Representation: Computational Foundations of Conceptual Graphs
Graph-based Knowledge Representation: Computational Foundations of Conceptual Graphs
Extensions of simple conceptual graphs: the complexity of rules and constraints
Journal of Artificial Intelligence Research
Extending decidable cases for rules with existential variables
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Rules dependencies in backward chaining of conceptual graphs rules
ICCS'06 Proceedings of the 14th international conference on Conceptual Structures: inspiration and Application
Hi-index | 0.00 |
This paper is an extended abstract of the talk given at ICCS'09. Rules have long been considered as an essential component of knowledge-based systems. We focus here on conceptual graph rules and on the semantically equivalent knowledge constructs in logic and databases, namely rules with existential variables and tuple-generating dependencies. The aim of this presentation is to synthesize main decidability, complexity and algorithmic results obtained on this kind of rules. We emphasize the fact that the graph vision of rules has led to new results.