Abstract
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 ∏P2 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. © 2008 Springer-Verlag.
Cite
CITATION STYLE
Leclère, M., & Mugnier, M. L. (2008). An algorithmic study of deduction in simple conceptual graphs with classical negation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5113 LNAI, pp. 119–132). https://doi.org/10.1007/978-3-540-70596-3_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
