Skip to main content
SpringerLink
Log in

Implementation of Logical Retraction in Constraint Handling Rules with Justifications

  • Conference paper
  • First Online:
Declarative Programming and Knowledge Management (WFLP 2017, WLP 2017, INAP 2017)

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

Abstract

In previous work we added justifications to Constraint Handling Rules (CHR) to enable logical retraction of constraints for dynamic algorithms. We presented a straightforward source-to-source transformation to implement this conservative extension. In this companion paper, we improve the performance of the transformation. We discuss its worst-case time complexity in general. Then we perform experiments. We benchmark the dynamic problem of maintaining shortest paths under addition and retraction of paths. The results validate our complexity considerations.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

Notes

  1. 1.

    Dynamic algorithms for dynamic problems should not be confused with dynamic programming.

  2. 2.

    More precisely, a simplification rule is generated if there are no kept constraints and a propagation rule is generated if there are no removed constraints.

References

  1. Abdennadher, S., Frühwirth, T.: Integration and optimization of rule-based constraint solvers. In: Bruynooghe, M. (ed.) LOPSTR 2003. LNCS, vol. 3018, pp. 198–213. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-25938-1_17

    Chapter  MATH  Google Scholar 

  2. Duck, G.J., Stuckey, P.J., de la Banda, M.G., Holzbaur, C.: The refined operational semantics of constraint handling rules. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 90–104. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27775-0_7

    Chapter  Google Scholar 

  3. Duck, G.J.: SMCHR: satisfiability modulo constraint handling rules. Theory Pract. Log. Program. 12(4–5), 601–618 (2012)

    Article  MathSciNet  Google Scholar 

  4. Frühwirth, T., Raiser, F. (eds.): Constraint Handling Rules - Compilation, Execution, and Analysis. BOD, Norderstedt (2018). ISBN 9783746069050

    Google Scholar 

  5. Frühwirth, T.: As time goes by II: more automatic complexity analysis of concurrent rule programs. ENTCS 59(3), 185–206 (2002). Di Pierro, A., Wiklicky, H. (eds.) QAPL 2001: Proceedings of First International Workshop on Quantitative Aspects of Programming Languages. Elsevier

    Google Scholar 

  6. Frühwirth, T.: Constraint Handling Rules. Cambridge University Press, Cambridge (2009)

    Book  Google Scholar 

  7. Frühwirth, T.: Constraint handling rules - what else? In: Bassiliades, N., Gottlob, G., Sadri, F., Paschke, A., Roman, D. (eds.) RuleML 2015. LNCS, vol. 9202, pp. 13–34. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21542-6_2

    Chapter  Google Scholar 

  8. Frühwirth, T.: Justifications in constraint handling rules for logical retraction in dynamic algorithms. In: Fioravanti, F., Gallagher, J.P. (eds.) LOPSTR 2017. LNCS, vol. 10855, pp. 147–163. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94460-9_9

    Chapter  Google Scholar 

  9. McAllester, D.A.: Truth maintenance. In: AAAI, vol. 90, pp. 1109–1116 (1990)

    Google Scholar 

  10. Schrijvers, T., Frühwirth, T.: Optimal union-find in constraint handling rules, programming pearl. Theory Pract. Log. Program. (TPLP) 6(1), 213–224 (2006)

    Article  Google Scholar 

  11. Wolf, A., Gruenhagen, T., Geske, U.: On the incremental adaptation of chr derivations. Appl. Artif. Intell. 14(4), 389–416 (2000)

    Article  Google Scholar 

  12. Wolf, A.: Adaptive constraint handling with CHR in Java. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 256–270. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45578-7_18

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ulm University, Ulm, Germany

    Thom Frühwirth

Authors
  1. Thom Frühwirth
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thom Frühwirth .

Editor information

Editors and Affiliations

  1. Universität Würzburg, Wuerzburg, Germany

    Dietmar Seipel

  2. Christian-Albrechts-Universität zu Kiel, Kiel, Germany

    Michael Hanus

  3. Universidade de Èvora, Evora, Portugal

    Salvador Abreu

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Frühwirth, T. (2018). Implementation of Logical Retraction in Constraint Handling Rules with Justifications. In: Seipel, D., Hanus, M., Abreu, S. (eds) Declarative Programming and Knowledge Management. WFLP WLP INAP 2017 2017 2017. Lecture Notes in Computer Science(), vol 10997. Springer, Cham. https://doi.org/10.1007/978-3-030-00801-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00801-7_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00800-0

  • Online ISBN: 978-3-030-00801-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation