Skip to main content
SpringerLink
Log in

Declarative Local Search for Predicate Logic

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 2019)

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

  • 707 Accesses

Abstract

In this paper we introduce a framework built on top of the Knowledge Base System , which allows local search heuristics to be synthesized from their formal descriptions. It is introduced as a new inference to solve optimization problems in . To model a local search heuristic, users need to specify its components, among which neighbourhood moves are the most important. Two types of neighbourhood moves, namely standard moves and Large Neighbourhood Search moves, are supported. A set of built-in local search heuristics are provided, allowing users to combine neighbourhoods in different ways. We demonstrate how the new local search inference can be used to complement the existing solving mechanisms for logic programming.

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

References

  1. Björdal, G., Flener, P., Pearson, J., Stuckey, P.J., Tack, G.: Declarative local-search neighbourhoods in MiniZinc. In: Tsoukalas, L.H., Grégoire, É., Alamaniotis, M. (eds.) IEEE 30th International Conference on Tools with Artificial Intelligence, ICTAI 2018, 5–7 November 2018, Volos, Greece, pp. 98–105. IEEE (2018). https://doi.org/10.1109/ICTAI.2018.00025

  2. De Cat, B., Bogaerts, B., Bruynooghe, M., Janssens, G., Denecker, M.: Predicate logic as a modeling language: the IDP system. In: Declarative Logic Programming, pp. 279–323. Association for Computing Machinery and Morgan & Claypool (2018)

    Google Scholar 

  3. De Cat, B., Bogaerts, B., Devriendt, J., Denecker, M.: Model expansion in the presence of function symbols using constraint programming. In: 25th International Conference on Tools with Artificial Intelligence, 4–6 November 2013, USA, pp. 1068–1075 (2013)

    Google Scholar 

  4. Devriendt, J.: Exploiting symmetry in model expansion for predicate and propositional logic. Ph.D. thesis, Informatics Section, Department of Computer Science, Faculty of Engineering Science, February 2017

    Google Scholar 

  5. Devriendt, J., De Causmaecker, P., Denecker, M.: Transforming constraint programs to input for local search. In: The Fourteenth International Workshop on Constraint Modelling and Reformulation, pp. 1–16 (2015)

    Google Scholar 

  6. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo = ASP+ control: preliminary report. arXiv preprint arXiv:1405.3694 (2014)

  7. Glover, F., Laguna, M.: Tabu search. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 2093–2229. Springer, Boston (1998). https://doi.org/10.1007/978-1-4613-0303-9_33

    Chapter  Google Scholar 

  8. Ierusalimschy, R., de Figueiredo, L.H., Celes, W.: Lua - an extensible extension language. Soft.: Pract. Exp. 26(6), 635–652 (1996)

    Google Scholar 

  9. Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 320–353. Springer, Boston (2003). https://doi.org/10.1007/0-306-48056-5_11

    Chapter  Google Scholar 

  10. Modelling and instances (2019). https://github.com/tusanpham/DeclarativeLocalSearch

  11. Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529–543. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74970-7_38

    Chapter  Google Scholar 

  12. Pham, T.-S., Devriendt, J., De Causmaecker, P.: Modelling local search in a knowledge base system. In: Daniele, P., Scrimali, L. (eds.) New Trends in Emerging Complex Real Life Problems. ASS, vol. 1, pp. 415–423. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00473-6_44

    Chapter  Google Scholar 

  13. Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-49481-2_30

    Chapter  Google Scholar 

Download references

Acknowledgements

This research was supported by Swedish Research Council grant 2016-00782, FWO research grant G.0922.13, and KU Leuven project C24/17/012.

Author information

Authors and Affiliations

  1. KU Leuven, Leuven, Belgium

    Tu-San Pham & Patrick De Causmaecker

  2. KTH Royal Institute of Technology, Stockholm, Sweden

    Jo Devriendt

Authors
  1. Tu-San Pham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jo Devriendt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Patrick De Causmaecker
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tu-San Pham .

Editor information

Editors and Affiliations

  1. Saint Joseph's University, Philadelphia, PA, USA

    Marcello Balduccini

  2. University of Nebraska at Omaha, Omaha, USA

    Yuliya Lierler

  3. TU Wien, Vienna, Austria

    Stefan Woltran

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Pham, TS., Devriendt, J., De Causmaecker, P. (2019). Declarative Local Search for Predicate Logic. In: Balduccini, M., Lierler, Y., Woltran, S. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2019. Lecture Notes in Computer Science(), vol 11481. Springer, Cham. https://doi.org/10.1007/978-3-030-20528-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-20528-7_25

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation