Conceptual structures: information processing in mind and machine
Conceptual structures: information processing in mind and machine
A comparison of structural CSP decomposition methods
Artificial Intelligence
Proceedings of the 7th International Conference on Conceptual Structures: Standards and Practices
ICCS '99 Proceedings of the 7th International Conference on Conceptual Structures: Standards and Practices
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
Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday)
On querying simple conceptual graphs with negation
Data & Knowledge Engineering
A general datalog-based framework for tractable query answering over ontologies
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Default Conceptual Graph Rules: Preliminary Results for an Agronomy Application
ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
Extending decidable cases for rules with existential variables
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Conceptual graphs for a data base interface
IBM Journal of Research and Development
Supporting argumentation systems by graph representation and computation
GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
In this paper, we explore the expressivity of default CG rules (a CG-oriented subset of Reiter's default logics) through two applications. In the first one, we show that default CG rules provide a unifying framework for CG rules as well as polarized CGs (CGs with atomic negation). This framework allows us to study decidable subclasses of a new language mixing CG rules with atomic negation. In the second application, we use default CG rules as a formalism to model a game, an application seldom explored by the CG community. This model puts into light the conciseness provided by defaults, as well as the possibilities they offer to achieve efficient reasonings.