Skip to main content

Incrementally Building Partially Path Consistent Qualitative Constraint Networks

  • Conference paper
Artificial Intelligence: Methodology, Systems, and Applications (AIMSA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8722))

Abstract

The Interval Algebra (IA) and a fragment of the Region Connection Calculus (RCC), namely, RCC-8, are the dominant Artificial Intelligence approaches for representing and reasoning about qualitative temporal and topological relations respectively. In this framework, one of the main tasks is to compute the path consistency of a given Qualitative Constraint Network (QCN). We concentrate on the partial path consistency checking problem problem of a QCN, i.e., the path consistency enforced on an underlying chordal constraint graph of the QCN, and propose an algorithm for maintaining or enforcing partial path consistency for growing constraint networks, i.e., networks that grow with new temporal or spatial entities over time. We evaluate our algorithm experimentally with QCNs of IA and RCC-8 and obtain impressive results.

This work was funded by a PhD grant from Université d’Artois and region Nord-Pas-de-Calais.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allen, J.F.: Maintaining knowledge about temporal intervals. CACM 26, 832–843 (1983)

    Article  MATH  Google Scholar 

  2. Amaneddine, N., Condotta, J.F., Sioutis, M.: Efficient Approach to Solve the Minimal Labeling Problem of Temporal and Spatial Qualitative Constraints. In: IJCAI (2013)

    Google Scholar 

  3. Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  4. Berry, A., Blair, J.R.S., Heggernes, P.: Maximum Cardinality Search for Computing Minimal Triangulations. In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 1–12. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Berry, A., Heggernes, P., Villanger, Y.: A vertex incremental approach for maintaining chordality. Discrete Mathematics 306 (2006)

    Google Scholar 

  6. Bessière, C.: A Simple Way to Improve Path Consistency Processing in Interval Algebra Networks. In: AAAI/IAAI (1996)

    Google Scholar 

  7. Bhatt, M., Guesgen, H., Wölfl, S., Hazarika, S.: Qualitative Spatial and Temporal Reasoning: Emerging Applications, Trends, and Directions. Spatial Cognition & Computation 11, 1–14 (2011)

    Article  Google Scholar 

  8. Bliek, C., Sam-Haroud, D.: Path consistency on triangulated constraint graphs. In: IJCAI (1999)

    Google Scholar 

  9. Chmeiss, A., Condotta, J.F.: Consistency of Triangulated Temporal Qualitative Constraint Networks. In: ICTAI (2011)

    Google Scholar 

  10. Gerevini, A.: Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ord-horn class. Artif. Intell. 166(1-2), 37–80 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  11. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. Elsevier Science (2004)

    Google Scholar 

  12. Goodwin, J., Dolbear, C., Hart, G.: Geographical Linked Data: The Administrative Geography of Great Britain on the Semantic Web. TGIS 12, 19–30 (2008)

    Google Scholar 

  13. Huang, J.: Compactness and its implications for qualitative spatial and temporal reasoning. In: KR (2012)

    Google Scholar 

  14. Nebel, B.: Solving Hard Qualitative Temporal Reasoning Problems: Evaluating the Efficiency of Using the ORD-Horn Class. In: ECAI (1996)

    Google Scholar 

  15. Planken, L., de Weerdt, M., Yorke-Smith, N.: Incrementally Solving STNs by Enforcing Partial PC. In: ICAPS (2010)

    Google Scholar 

  16. Randell, D.A., Cui, Z., Cohn, A.: A Spatial Logic Based on Regions and Connection. In: KR (1992)

    Google Scholar 

  17. Renz, J.: Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis. In: IJCAI (1999)

    Google Scholar 

  18. 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)

    Chapter  Google Scholar 

  19. Renz, J., Nebel, B.: Efficient Methods for Qualitative Spatial Reasoning. JAIR 15, 289–318 (2001)

    MATH  MathSciNet  Google Scholar 

  20. Sioutis, M., Condotta, J.-F.: Tackling large Qualitative Spatial Networks of scale-free-like structure. In: Likas, A., Blekas, K., Kalles, D. (eds.) SETN 2014. LNCS, vol. 8445, pp. 178–191. Springer, Heidelberg (2014)

    Google Scholar 

  21. Sioutis, M., Koubarakis, M.: Consistency of Chordal RCC-8 Networks. In: ICTAI (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Sioutis, M., Condotta, JF. (2014). Incrementally Building Partially Path Consistent Qualitative Constraint Networks. In: Agre, G., Hitzler, P., Krisnadhi, A.A., Kuznetsov, S.O. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2014. Lecture Notes in Computer Science(), vol 8722. Springer, Cham. https://doi.org/10.1007/978-3-319-10554-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10554-3_10

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10553-6

  • Online ISBN: 978-3-319-10554-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics