Skip to main content
SpringerLink
Log in

Providing Built-In Counters in a Declarative Dynamic Programming Environment

  • Conference paper
  • First Online:
KI 2016: Advances in Artificial Intelligence (KI 2016)

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

  • 1276 Accesses

Abstract

D-FLAT is a framework for developing algorithms that solve computational problems by dynamic programming on a tree decomposition of the problem instance. The dynamic programming algorithm is specified by means of Answer-Set Programming (ASP), allowing for declarative and succinct specifications. D-FLAT traverses the tree decomposition and calls an ASP system with the provided specification at each tree decomposition node. It is thus crucial that the evaluation of the ASP program is done in an efficient way. As experiments have shown, problems that include weights or more involved arithmetics slow down this step significantly due to the grounding step in ASP, which yields large ground programs in these cases. To overcome this problem, we equip D-FLAT with built-in counters in order to shift certain computations from the ASP side to the internal part of D-FLAT. In this paper, we highlight this new feature and provide empirical benchmarks on weighted versions of the Dominating Set problem showing that our new version increases D-FLAT’s robustness and efficiency.

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.

    In [4] it was shown that the treewidth of metro and urban train systems even of large cities like Singapore is relatively small and often not much higher than 5 or 6.

  2. 2.

    Free software, available at github.com/mabseher/htd.

  3. 3.

    Each node n has at most two child nodes; in case of two child nodes, the bags of n and its children contain the same vertices.

  4. 4.

    See www.dbai.tuwien.ac.at/proj/dflat/system/files/counters.zip.

  5. 5.

    See www.dbai.tuwien.ac.at/proj/dflat/system/files/counters.zip for such an encoding example.

References

  1. Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Hecher, M., Woltran, S.: D-FLAT: progress report. Technical report DBAI-TR-2014-86, Vienna University of Technology (2014)

    Google Scholar 

  2. Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Hecher, M., Woltran, S.: The D-FLAT system for dynamic programming on tree decompositions. In: Fermé, E., Leite, J. (eds.) JELIA 2014. LNCS, vol. 8761, pp. 558–572. Springer, Heidelberg (2014)

    Google Scholar 

  3. Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Woltran, S.: Computing secure sets in graphs using answer set programming. J. Logic Comput. (2016). Accepted for publication

    Google Scholar 

  4. Abseher, M., Musliu, N., Woltran, S.: Improving the efficiency of dynamic programming on tree decompositions via machine learning. Technical report DBAI-TR-2016-94, TU Wien (2016). http://www.dbai.tuwien.ac.at/research/report/dbai-tr-2016-94.pdf

  5. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods 8(2), 277–284 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bliem, B., Kaufmann, B., Schaub, T., Woltran, S.: ASP for anytime dynamic programming on tree decompositions. In: Proceedings of the IJCAI (2016). Accepted for publication

    Google Scholar 

  7. Bliem, B., Morak, M., Woltran, S.: D-FLAT: declarative problem solving using tree decompositions and answer-set programming. TPLP 12(4–5), 445–464 (2012)

    MathSciNet  MATH  Google Scholar 

  8. Bliem, B., Pichler, R., Woltran, S.: Declarative dynamic programming as an alternative realization of Courcelle’s theorem. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 28–40. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  9. Hans, L.: Bodlaender.: a tourist guide through treewidth. Acta Cybern. 11(1–2), 1–22 (1993)

    MATH  Google Scholar 

  10. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  11. Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations I. Upper bounds. Inf. Comput. 208(3), 259–275 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  12. Brewka, G., Eiter, T., Truszczyński, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)

    Article  Google Scholar 

  13. Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12–75 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  14. Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Heidelberg (2015)

    Book  MATH  Google Scholar 

  15. Dechter, R.: Constraint Processing. Morgan Kaufmann, Burlington (2003)

    MATH  Google Scholar 

  16. Dermaku, A., Ganzow, T., Gottlob, G., McMahan, B., Musliu, N., Samer, M.: Heuristic methods for hypertree decomposition. In: Gelbukh, A., Morales, E.F. (eds.) MICAI 2008. LNCS (LNAI), vol. 5317, pp. 1–11. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  17. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)

    Book  Google Scholar 

  18. Gebser, M., Kaminski, R., Kaufmann, B., Lindauer, M., Ostrowski, M., Romero, J., Schaub, T., Thiele, S.: Potassco User Guide 2.0. (2015). https://sourceforge.net/projects/potassco/files/guide/2.0/guide-2.0.pdf

  19. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, San Rafael (2012)

    Google Scholar 

  20. Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.T.: Potassco: the potsdam answer set solving collection. AI Commun. 24(2), 107–124 (2011)

    MathSciNet  MATH  Google Scholar 

  21. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3/4), 365–386 (1991)

    Article  MATH  Google Scholar 

  22. Lierler, Y.: On the relation of constraint answer set programming languages and algorithms. In: Proceedings of the AAAI, pp. 521–527. AAAI Press (2012)

    Google Scholar 

  23. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications. OUP, Oxford (2006)

    Book  Google Scholar 

  24. Ostrowski, M., Schaub, T.: ASP modulo CSP: the Clingcon system. TPLP 12(4–5), 485–503 (2012)

    MathSciNet  MATH  Google Scholar 

  25. Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. J. Comb. Theory Ser. B 36(1), 49–64 (1984)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work has been supported by the Austrian Science Fund (FWF): P25607-N23, Y698-N23. The authors thank the reviewers for their helpful comments which allowed to clarify the presentation of our work in the final version of this paper.

Author information

Authors and Affiliations

  1. Institute of Information Systems 184/2, TU Wien, Vienna, Austria

    Michael Abseher, Marius Moldovan & Stefan Woltran

Authors
  1. Michael Abseher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marius Moldovan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefan Woltran
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marius Moldovan .

Editor information

Editors and Affiliations

  1. Alpen-Adria Universität Klagenfurt, Klagenfurt, Austria

    Gerhard Friedrich

  2. University of Basel, Basel, Switzerland

    Malte Helmert

  3. Technische Universität Graz, Graz, Austria

    Franz Wotawa

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Abseher, M., Moldovan, M., Woltran, S. (2016). Providing Built-In Counters in a Declarative Dynamic Programming Environment. In: Friedrich, G., Helmert, M., Wotawa, F. (eds) KI 2016: Advances in Artificial Intelligence. KI 2016. Lecture Notes in Computer Science(), vol 9904. Springer, Cham. https://doi.org/10.1007/978-3-319-46073-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46073-4_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46072-7

  • Online ISBN: 978-3-319-46073-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation