Skip to main content

The Multi-Engine ASP Solver me-asp

  • Conference paper
Logics in Artificial Intelligence (JELIA 2012)

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

Included in the following conference series:

Abstract

In this paper we describe the new system me-asp, which applies machine learning techniques for inductively choosing, among a set of available ones, the “best” ASP solver on a per-instance basis. Moreover, we report the results of some experiments, carried out on benchmarks from the “System Track” of the 3rd ASP Competition, showing the state-of-the-art performance of our solver.

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. Balduccini, M.: Learning and using domain-specific heuristics in ASP solvers. AICOM 24, 147–164 (2011)

    MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  3. Calimeri, F., Ianni, G., Ricca, F., Alviano, M., Bria, A., Catalano, G., Cozza, S., Faber, W., Febbraro, O., Leone, N., Manna, M., Martello, A., Panetta, C., Perri, S., Reale, K., Santoro, M.C., Sirianni, M., Terracina, G., Veltri, P.: The Third Answer Set Programming Competition: Preliminary Report of the System Competition Track. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 388–403. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM Transactions on Database Systems 22(3), 364–418 (1997)

    Article  Google Scholar 

  5. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., Schneider, M.T., Ziller, S.: A Portfolio Solver for Answer Set Programming: Preliminary Report. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 352–357. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Proc. of IJCAI 2007, pp. 386–392. Morgan Kaufmann Publishers (2007)

    Google Scholar 

  7. Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365–385 (1991)

    Article  MATH  Google Scholar 

  8. Halder, A., Ghosh, A., Ghosh, S.: Aggregation pheromone density based pattern classification. Fundamenta Informaticae 92(4), 345–362 (2009)

    MathSciNet  Google Scholar 

  9. Janhunen, T., Niemelä, I., Sevalnev, M.: Computing Stable Models via Reductions to Difference Logic. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 142–154. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. ACM TOCL 7(3), 499–562 (2006)

    Article  MathSciNet  Google Scholar 

  11. Lierler, Y.: Disjunctive Answer Set Programming via Satisfiability. In: Proc. of LPNMR 2005. LNCS, vol. 3662, pp. 447–451. Springer, Heidelberg (2005)

    Google Scholar 

  12. Lifschitz, V.: Answer Set Planning. In: Proc. of ICLP 1999, Las Cruces, New Mexico, USA, pp. 23–37. The MIT Press (November 1999)

    Google Scholar 

  13. Maratea, M., Pulina, L., Ricca, F.: Applying machine learning techniques to ASP solving. Number CVL 2012/003, p. 21. University of Sassari Tech. Rep. (March 2012)

    Google Scholar 

  14. Mariën, M., Wittocx, J., Denecker, M., Bruynooghe, M.: SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 211–224. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. Mierswa, I., Wurst, M., Klinkenberg, R., Scholz, M., Euler, T.: Yale: Rapid prototyping for complex data mining tasks. In: Proc. of KDD 2006, pp. 935–940. ACM (2006)

    Google Scholar 

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

  17. Simons, P., Niemelä, I., Soininen, T.: Extending and Implementing the Stable Model Semantics. Artificial Intelligence 138, 181–234 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  18. Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Satzilla: Portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research 32, 565–606 (2008)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maratea, M., Pulina, L., Ricca, F. (2012). The Multi-Engine ASP Solver me-asp. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds) Logics in Artificial Intelligence. JELIA 2012. Lecture Notes in Computer Science(), vol 7519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33353-8_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33353-8_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33352-1

  • Online ISBN: 978-3-642-33353-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics