Declaratively Solving Google Code Jam Problems with Picat

  • Conference paper
  • First Online:
Practical Aspects of Declarative Languages (PADL 2015)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9131))

Included in the following conference series:

Abstract

In this paper we present several examples of solving algorithmic problems from the Google Code Jam programming contest with Picat programming language using declarative techniques: constraint logic programming and tabled logic programming. In some cases the use of Picat simplifies the implementation compared to conventional imperative programming languages, while in others it allows to directly convert the problem statement into an efficiently solvable declarative problem specification without inventing an imperative algorithm.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.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
EUR 29.95
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 32.09
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 42.20
Price includes VAT (France)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** 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.

Similar content being viewed by others

References

  1. Dymchenko, S., Mykhailova, M.: Declaratively solving tricky Google Code Jam problems with Prolog-based ECLiPSe CLP system (2014). http://arxiv.org/abs/1412.2304

  2. Knuth, D.E., Pardo, L.T.: The Early Development of Programming Languages. Stanford University, Computer Science Department (1976)

    Google Scholar 

  3. Warren, D.S.: Memoing for logic programs. Commun ACM 35(3) (1992)

    Google Scholar 

  4. Zhou, N.-F.: The language features and architecture of B-Prolog. Theory and Practice of Logic Programming 12(1–2) (2012)

    Google Scholar 

  5. Zhou, N.-F.: Combinatorial search with Picat (2014). http://arxiv.org/abs/1405.2538

  6. Zhou, N.-F., Kameya, Y., Sato, T.: Mode-directed tabling for dynamic programming, machine learning, and constraint solving. In: 2010 22nd IEEE International Conference on Tools with Artificial Intelligence, vol. 2 (2010)

    Google Scholar 

  7. Zhou, N.-F., Kjellerstrand, H.: Solving several planning problems with Picat. In: Control and Decision Conference (2014 CCDC), The 26th Chinese (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sergii Dymchenko .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Dymchenko, S., Mykhailova, M. (2015). Declaratively Solving Google Code Jam Problems with Picat. In: Pontelli, E., Son, T. (eds) Practical Aspects of Declarative Languages. PADL 2015. Lecture Notes in Computer Science(), vol 9131. Springer, Cham. https://doi.org/10.1007/978-3-319-19686-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19686-2_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19685-5

  • Online ISBN: 978-3-319-19686-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Navigation