Abstract
This paper addresses the problem of merging qualitative constraint networks (QCNs) defined on different qualitative formalisms. Our model is restricted to formalisms where the entities and the relationships between these entities are defined on the same domain. The method is an upstream step to a previous framework dealing with a set of QCNs defined on the same formalism. It consists of translating the input QCNs into a well-chosen common formalism. Two approaches are investigated: in the first one, each input QCN is translated to an equivalent QCN; in the second one, the QCNs are translated to approximations. These approaches take advantage of two dual notions that we introduce, the ones of refinement and abstraction between qualitative formalisms.
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
Allen, J.-F.: An interval-based representation of temporal knowledge. In: Proc. of 7th the International Joint Conference on Artificial Intelligence (IJCAI), pp. 221–226 (1981)
Cholvy, L.: Reasoning about merging information. Handbook of Defeasible Reasoning and Uncertainty Management Systems 3, 233–263 (1998)
Condotta, J.-F., Kaci, S., Marquis, P., Schwind, N.: Merging qualitative constraints networks using propositional logic. In: Proc. of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU), pp. 347–358 (2009)
Condotta, J.-F., Kaci, S., Schwind, N.: A Framework for Merging Qualitative Constraints Networks. In: Proc. of the 21th FLAIRS Conference, pp. 586–591 (2008)
Condotta, J.-F., Ligozat, G., Saade, M.: A qualitative algebra toolkit. In: Proc. of the 2nd IEEE International Conference on Information Technologies: from Theory to Applications, ICTTA (2006)
Egenhofer, M.-J.: Reasoning about binary topological relations. In: Günther, O., Schek, H.-J. (eds.) SSD 1991. LNCS, vol. 525, pp. 143–160. Springer, Heidelberg (1991)
Frank, A.U.: Qualitative spatial reasoning about cardinal directions. In: Proc. of the 7th Austrian Conference on Artificial Intelligence, pp. 157–167 (1991)
Gerevini, A., Renz, J.: Combining topological and size information for spatial reasoning. Artificial Intelligence 137(1-2), 1–42 (2002)
Jonsson, P., Drakengren, T.: A complete classification of tractability in RCC-5. Journal of Artificial Intelligence Research 6, 211–221 (1997)
Konieczny, S., Lang, J., Marquis, P.: DA2 merging operators. Artificial Intelligence 157(1-2), 49–79 (2004)
Li, S.: Combining topological and directional information for spatial reasoning. In: Proc. of the 20th International Joint Conference on Artificial Intelligence (IJCAI), pp. 435–440 (2007)
Ligozat, G.: Reasoning about cardinal directions. Journal of Visual Languages and Computing 9(1), 23–44 (1998)
Ligozat, G., Renz, J.: What Is a Qualitative Calculus? A General Framework. In: Zhang, C., Guesgen, H.W., Yeap, W.-K. (eds.) PRICAI 2004. LNCS, vol. 3157, pp. 53–64. Springer, Heidelberg (2004)
Lin, J.: Integration of weighted knowledge bases. Artificial Intelligence 83, 363–378 (1996)
Pujari, A.K., Kumari, G.V., Sattar, A.: \(\mathcal{INDU}\): An interval duration network. In: Proc. of the 16th Australian Joint Conference on Artificial Intelligence (AI), pp. 291–303 (2000)
Ragni, M., Wölfl, S.: Reasoning about topological and positional information in dynamic settings. In: Proc. of the 21th FLAIRS Conference, pp. 606–611 (2008)
Randell, D.-A., Cui, Z., Cohn, A.: A spatial logic based on regions and connection. In: Proc. of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 165–176 (1992)
Renz, J.: Qualitative spatial reasoning with topological information. Springer, Heidelberg (2002)
Renz, J., Ligozat, G.: Weak Composition for Qualitative Spatial and Temporal Reasoning. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 534–548. Springer, Heidelberg (2005)
Renz, J., Mitra, D.: Qualitative direction calculi with arbitrary granularity. In: Zhang, C., Guesgen, H.W., Yeap, W.-K. (eds.) PRICAI 2004. LNCS, vol. 3157, pp. 65–74. Springer, Heidelberg (2004)
Revesz, P.Z.: On the semantics of arbitration. Journal of Algebra and Computation 7(2), 133–160 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Condotta, JF., Kaci, S., Marquis, P., Schwind, N. (2009). Merging Qualitative Constraint Networks Defined on Different Qualitative Formalisms. In: Hornsby, K.S., Claramunt, C., Denis, M., Ligozat, G. (eds) Spatial Information Theory. COSIT 2009. Lecture Notes in Computer Science, vol 5756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03832-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-03832-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03831-0
Online ISBN: 978-3-642-03832-7
eBook Packages: Computer ScienceComputer Science (R0)