Skip to main content
SpringerLink
Log in

Nogoods in Qualitative Constraint-Based Reasoning

  • Conference paper
KI 2012: Advances in Artificial Intelligence (KI 2012)

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

Included in the following conference series:

  • 1218 Accesses

Abstract

The prevalent method of increasing reasoning efficiency in the domain of qualitative constraint-based spatial and temporal reasoning is to use domain splitting based on so-called tractable subclasses. In this paper we analyze the application of nogood learning with restarts in combination with domain splitting. Previous results on nogood recording in the constraint satisfaction field feature learnt nogoods as a global constraint that allows for enforcing generalized arc consistency. We present an extension of such a technique capable of handling domain splitting, evaluate its benefits for qualitative constraint-based reasoning, and compare it with alternative approaches.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
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. Nebel, B.: Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-horn class. Constraints 1(3), 175–190 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  2. Renz, J., Nebel, B.: Efficient methods for qualitative spatial reasoning. Journal of Artificial Intelligence Research (JAIR) 15, 289–318 (2001)

    MathSciNet  MATH  Google Scholar 

  3. Westphal, M., Wölfl, S.: Qualitative CSP, finite CSP, and SAT: Comparing methods for qualitative constraint-based reasoning. In: Boutilier, C. (ed.) IJCAI 2009, pp. 628–633 (2009)

    Google Scholar 

  4. Li, J.J., Huang, J., Renz, J.: A divide-and-conquer approach for solving interval algebra networks. In: Boutilier, C. (ed.) IJCAI 2009, pp. 572–577 (2009)

    Google Scholar 

  5. van Beek, P.: Backtracking search algorithms. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier (2006)

    Google Scholar 

  6. Katsirelos, G., Bacchus, F.: Generalized nogoods in CSPs. In: Veloso, M.M., Kambhampati, S. (eds.) AAAI 2005, pp. 390–396. AAAI Press/The MIT Press (2005)

    Google Scholar 

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

    Chapter  Google Scholar 

  8. Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26(11), 832–843 (1983)

    Article  MATH  Google Scholar 

  9. Randell, D.A., Cui, Z., Cohn, A.G.: A spatial logic based on regions and connection. In: Nebel, B., Rich, C., Swartout, W.R. (eds.) KR 1992, pp. 165–176 (1992)

    Google Scholar 

  10. Bodirsky, M., Kára, J.: A fast algorithm and datalog inexpressibility for temporal reasoning. ACM Trans. Comput. Log. 11(3) (2010)

    Google Scholar 

  11. Condotta, J.-F., Ligozat, G., Saade, M.: Eligible and Frozen Constraints for Solving Temporal Qualitative Constraint Networks. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 806–814. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Lecoutre, C., Saïs, L., Tabary, S., Vidal, V.: Recording and minimizing nogoods from restarts. Journal on Satisfiability, Boolean Modeling and Computation 1(3-4), 147–167 (2007)

    Google Scholar 

  13. Westphal, M., Wölfl, S., Gantner, Z.: GQR: A fast solver for binary qualitative constraint networks. In: Proceedings of the AAAI 2009 Spring Symposium on Benchmarking of Qualitative Spatial and Temporal Reasoning Systems (2009)

    Google Scholar 

  14. van Beek, P., Manchak, D.W.: The design and experimental analysis of algorithms for temporal reasoning. Journal of Artificial Intelligence Research 4, 1–18 (1996)

    MATH  Google Scholar 

  15. Boussemart, F., Hemery, F., Lecoutre, C., Saïs, L.: Boosting systematic search by weighting constraints. In: de Mántaras, R.L., Saitta, L. (eds.) ECAI 2004, pp. 146–150. IOS Press (2004)

    Google Scholar 

  16. Bessière, C.: Constraint propagation. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier (2006)

    Google Scholar 

  17. Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Westphal, M., Wölfl, S., Li, J.J.: Restarts and nogood recording in qualitative constraint-based reasoning. In: Coelho, H., Studer, R., Wooldridge, M. (eds.) ECAI 2010, pp. 1093–1094. IOS Press (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Freiburg, Georges-Köhler-Allee 52, 79110, Freiburg, Germany

    Matthias Westphal & Julien Hué

Authors
  1. Matthias Westphal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julien Hué
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Artificial Intelligence, University of Ulm, 89069, Ulm, Germany

    Birte Glimm

  2. Saarland University and German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, 66123, Saarbrücken, Germany

    Antonio Krüger

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Westphal, M., Hué, J. (2012). Nogoods in Qualitative Constraint-Based Reasoning. In: Glimm, B., Krüger, A. (eds) KI 2012: Advances in Artificial Intelligence. KI 2012. Lecture Notes in Computer Science(), vol 7526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33347-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33347-7_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33346-0

  • Online ISBN: 978-3-642-33347-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation