Conceptual structures: information processing in mind and machine
Conceptual structures: information processing in mind and machine
Basic Conceptual Structures Theory
ICCS '94 Proceedings of the Second International Conference on Conceptual Structures: Current Practices
Knowledge Representation and Reasonings Based on Graph Homomorphism
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
The Logic System of Concept Graphs With Negation: And Its Relationship to Predicate Logic
The Logic System of Concept Graphs With Negation: And Its Relationship to Predicate Logic
On querying simple conceptual graphs with negation
Data & Knowledge Engineering
Extensions of simple conceptual graphs: the complexity of rules and constraints
Journal of Artificial Intelligence Research
Some algorithmic improvements for the containment problem of conjunctive queries with negation
ICDT'07 Proceedings of the 11th international conference on Database Theory
Local negation in concept graphs
ICCS'05 Proceedings of the 13th international conference on Conceptual Structures: common Semantics for Sharing Knowledge
Simple conceptual graphs with atomic negation and difference
ICCS'06 Proceedings of the 14th international conference on Conceptual Structures: inspiration and Application
| Hi-index | 0.01 |
Polarized conceptual graphs (PGs) are simple conceptual graphs added with a restricted form of negation, namely negation on relations. Classical deduction with PGs (in short PG-Deduction) is highly intractable; it is indeed ${\Pi}^2_P$ complete. In [LM06] a brute-force algorithm for solving PG-Deduction was outlined. In the present paper, we extend previous work with two kinds of results. First, we exhibit particular cases of PGs for which the complexity of PG-Deduction decreases and becomes not more difficult than in simple conceptual graphs. Secondly, we improve the brute-force algorithm with several kinds of techniques based on properties concerning the graph structure and the labels.