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 \({\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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baget, J.-F., Mugnier, M.-L.: The Complexity of Rules and Constraints. JAIR 16, 425–465 (2002)
Chein, M., Mugnier, M.-L.: Conceptual Graphs: Fundamental Notions. Revue d’Intelligence Artificielle 6(4), 365–406 (1992)
Dau, F. (ed.): The Logic System of Concept Graphs with Negation And Its Relationship to Predicate Logic. LNCS (LNAI), vol. 2892. Springer, Heidelberg (2003)
Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions: A survey. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 37–57. Springer, Heidelberg (2001)
Kerdiles, G.: Saying it with Pictures: a logical landscape of conceptual graphs. PhD thesis, Univ. Montpellier II / Amsterdam (November 2001)
Klinger, J.: Local negation in concept graphs. In: ICCS, pp. 209–222 (2005)
Leclère, M., Mugnier, M.-L.: Simple conceptual graphs with atomic negation and difference. In: ICCS, pp. 331–345 (2006)
Leclère, M., Mugnier, M.-L.: Some algorithmic improvements for the containment problem of conjunctive queries with negation. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 404–418. Springer, Heidelberg (2006)
Mugnier, M.L., Chein, M.: Polynomial algorithms for projection and matching. In: Pfeiffer, H.D., Nagle, T.E. (eds.) Conceptual Structures: Theory and Implementation. LNCS, vol. 754, pp. 49–58. Springer, Heidelberg (1993)
Mugnier, M.-L., Leclère, M.: On querying simple conceptual graphs with negation. Data Knowl. Eng. 60(3), 468–493 (2007)
Mugnier, M.-L.: Knowledge Representation and Reasoning based on Graph Homomorphism. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867, pp. 172–192. Springer, Heidelberg (2000)
Mugnier, M.-L.: On the \(\pi^2_p\)-completeness of the containment problem of conjunctive queries with negation and other problems. Research Report 07004, LIRMM (2007)
Sowa, J.F.: Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley, Reading (1984)
Thomazo, M.: Complexité et propriétés algorithmiques de la déduction dans les graphes polarisés. First year research report, ENS Cachan (2007)
Wermelinger, M., Lopes, J.G.: Basic conceptual structures theory. In: Mugnier, M.-L., Chein, M. (eds.) ICCS 1994. LNCS (LNAI), vol. 835, pp. 144–159. Springer, Heidelberg (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leclère, M., Mugnier, ML. (2008). An Algorithmic Study of Deduction in Simple Conceptual Graphs with Classical Negation. In: Eklund, P., Haemmerlé, O. (eds) Conceptual Structures: Knowledge Visualization and Reasoning. ICCS 2008. Lecture Notes in Computer Science(), vol 5113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70596-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-70596-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70595-6
Online ISBN: 978-3-540-70596-3
eBook Packages: Computer ScienceComputer Science (R0)