Skip to main content
Springer Nature Link
Log in

A Portfolio Solver for Answer Set Programming: Preliminary Report

  • Conference paper
Logic Programming and Nonmonotonic Reasoning (LPNMR 2011)

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

Abstract

We propose a portfolio-based solving approach to Answer Set Programming (ASP). Our approach is homogeneous in considering several configurations of the ASP solver clasp. The selection among the configurations is realized via Support Vector Regression. The resulting portfolio-based solver claspfolio regularly outperforms clasp’s default configuration as well as manual tuning.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  2. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: IJCAI 2007, pp. 386–392. AAAI Press, Menlo Park (2007)

    Google Scholar 

  3. Pipatsrisawat, K., Darwiche, A.: On the power of clause-learning SAT solvers with restarts. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 654–668. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: SATzilla: Portfolio-based algorithm selection for SAT. JAIR 32, 565–606 (2008)

    MATH  Google Scholar 

  5. Basak, D., Pal, S., Patranabis, D.: Support vector regression. NIP 11(10), 203–224 (2007)

    Google Scholar 

  6. Hutter, F., Hoos, H., Leyton-Brown, K., Stützle, T.: ParamILS: An automatic algorithm configuration framework. JAIR 36, 267–306 (2009)

    MATH  Google Scholar 

  7. http://potassco.sourceforge.net

  8. http://www.csie.ntu.edu.tw/~cjlin/libsvm

  9. Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczyński, M.: The second answer set programming competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 637–654. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Balduccini, M.: Learning domain-specific heuristics for answer set solvers. In: ICLP 2010 Tech. Comm., pp. 14–23 (2010)

    Google Scholar 

  11. Xu, L., Hoos, H., Leyton-Brown, K.: Hydra: Automatically configuring algorithms for portfolio-based selection. In: AAAI 2010, pp. 210–216. AAAI Press, Menlo Park (2010)

    Google Scholar 

  12. Gagliolo, M., Schmidhuber, J.: Learning dynamic algorithm portfolios. AMAI 47(3-4), 295–328 (2006)

    MathSciNet  MATH  Google Scholar 

  13. Samulowitz, H., Memisevic, R.: Learning to solve QBF. In: AAAI 2007, pp. 255–260. AAAI Press, Menlo Park (2007)

    Google Scholar 

  14. O’Mahony, E., Hebrard, E., Holland, A., Nugent, C., O’Sullivan, B.: Using case-based reasoning in an algorithm portfolio for constraint solving. In: AICS 2008 (2008)

    Google Scholar 

  15. Pulina, L., Tacchella, A.: A self-adaptive multi-engine solver for quantified Boolean formulas. Constraints 14(1), 80–116 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  16. Arbelaez, A., Hamadi, Y., Sebag, M.: Continuous search in constraint programming. In: ICTAI 2010, pp. 53–60. IEEE Press, Los Alamitos (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Potsdam, Germany

    Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub, Marius Thomas Schneider & Stefan Ziller

Authors
  1. Martin Gebser
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roland Kaminski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Benjamin Kaufmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Torsten Schaub
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Marius Thomas Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Stefan Ziller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing Science, Simon Fraser University, V5A 1S6, Burnaby, B.C., Canada

    James P. Delgrande

  2. Department of Mathematics, University of Calabria, 87036, Rende (CS), Italy

    Wolfgang Faber

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., Schneider, M.T., Ziller, S. (2011). A Portfolio Solver for Answer Set Programming: Preliminary Report. In: Delgrande, J.P., Faber, W. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2011. Lecture Notes in Computer Science(), vol 6645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20895-9_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20895-9_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20894-2

  • Online ISBN: 978-3-642-20895-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics