Abstract
The minimal label problem (MLP) (also known as the deductive closure problem) is a fundamental problem in qualitative spatial and temporal reasoning (QSTR). Given a qualitative constraint network Γ, the minimal network of Γ relates each pair of variables (x,y) by the minimal label of (x,y), which is the minimal relation between x,y that is entailed by network Γ. It is well-known that MLP is equivalent to the corresponding consistency problem with respect to polynomial Turing-reductions. This paper further shows, for several qualitative calculi including Interval Algebra and RCC-8 algebra, that deciding the minimality of qualitative constraint networks and computing a solution of a minimal constraint network are both NP-hard problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832–843 (1983)
van Beek, P.: Reasoning about qualitative temporal information. Artif. Intell. 58(1-3), 297–326 (1992)
Broxvall, M., Jonsson, P.: Point algebras for temporal reasoning: Algorithms and complexity. Artif. Intell. 149(2), 179–220 (2003)
Chandra, P., Pujari, A.K.: Minimality and convexity properties in spatial CSPs. In: ICTAI, pp. 589–593. IEEE Computer Society (2005)
Cohn, A.G., Renz, J.: Qualitative spatial reasoning. In: van Harmelen, F., Lifschitz, V., Porter, B. (eds.) Handbook of Knowledge Representation. Elsevier (2007)
Dechter, R.: Constraint processing. Elsevier Morgan Kaufmann (2003)
Drakengren, T., Jonsson, P.: A complete classification of tractability in Allen’s algebra relative to subsets of basic relations. Artif. Intell. 106(2), 205–219 (1998)
Frank, A.U.: Qualitative spatial reasoning with cardinal directions. In: Kaindl, H. (ed.) ÖGAI. Informatik-Fachberichte, vol. 287, pp. 157–167. Springer (1991)
Gerevini, A., Saetti, A.: Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure. Artif. Intell. 175(2), 556–585 (2011)
Gottlob, G.: On Minimal Constraint Networks. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 325–339. Springer, Heidelberg (2011)
Li, S.: On topological consistency and realization. Constraints 11(1), 31–51 (2006)
Li, S., Ying, M.: Region Connection Calculus: Its models and composition table. Artif. Intell. 145(1-2), 121–146 (2003)
Ligozat, G.: Reasoning about cardinal directions. J. Vis. Lang. Comput. 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 (LNAI), vol. 3157, pp. 53–64. Springer, Heidelberg (2004)
Liu, W., Zhang, X., Li, S., Ying, M.: Reasoning about cardinal directions between extended objects. Artif. Intell. 174(12-13), 951–983 (2010)
Montanari, U.: Networks of constraints: Fundamental properties and applications to picture processing. Inf. Sci. 7, 95–132 (1974)
Nebel, B., Bürckert, H.J.: Reasoning about temporal relations: A maximal tractable subclass of Allen’s Interval Algebra. J. ACM 42(1), 43–66 (1995)
Randell, D.A., Cui, Z., Cohn, A.G.: A spatial logic based on regions and connection. In: KR, pp. 165–176 (1992)
Renz, J., Nebel, B.: On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus. Artif. Intell. 108(1-2), 69–123 (1999)
Vilain, M.B., Kautz, H.A.: Constraint propagation algorithms for temporal reasoning. In: AAAI, pp. 377–382 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, W., Li, S. (2012). Solving Minimal Constraint Networks in Qualitative Spatial and Temporal Reasoning. In: Milano, M. (eds) Principles and Practice of Constraint Programming. CP 2012. Lecture Notes in Computer Science, vol 7514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33558-7_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-33558-7_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33557-0
Online ISBN: 978-3-642-33558-7
eBook Packages: Computer ScienceComputer Science (R0)