Logic Languages

  • Reference work entry
Encyclopedia of Parallel Computing

Synonyms

Concurrent logic languages; Distributed logic languages; Prolog

Definition

The common name of Parallel Logic Languages groups those languages which are based on logic programming and which, while respecting as much as possible the declarative semantics, have an operational semantics which exploits parallelism or concurrency, either explicitly or implicitly, to gain in efficiency or expressiveness.

Discussion

Logic Programing

The application of logic and mechanized proofs to express problems and their solutions is at the origins of computer science [6]. The basis of this approach is to express the knowledge on some problem (e.g., how a sorted tree is organized) as a consistent theory in some logic and to model the desired goal (e.g., storing an item on the tree) as a formula. If the formula is true in the theory capturing the problem conditions, then the objective expressed by such formula is achievable (i.e., the item can be stored). The set of formulas which are true in the...

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 (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 1,284.00
Price includes VAT (Germany)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
EUR 1,711.99
Price includes VAT (Germany)
  • Durable hardcover 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

Bibliography

  1. Ali K, Karlsson R (1990) The Muse approach to or-parallel Prolog. Int J Parallel Program 19(2):129–162

    Article  MathSciNet  Google Scholar 

  2. Bevemyr J, Lindgren T, Millroth H (1993) Reform Prolog: the language and its implementation. In: Warren DS (ed) Proceedings of tenth international conference on logic programming. MIT Press, Cambridge, pp 283–298

    Google Scholar 

  3. Bueno F, García de la Banda M, Hermenegildo M (March 1999) Effectiveness of abstract interpretation in automatic parallelization: a case study in logic programming. ACM Trans Program Lang Syst 21(2):189–238

    Article  Google Scholar 

  4. Conery JS (1987) Parallel execution of logic programs. Kluwer, Norwell

    Book  Google Scholar 

  5. Costa VS, Warren DHD, Yang R (1996) Andorra-I compilation. New Gener Comput 14(1):3–30

    Article  Google Scholar 

  6. Green C (1969) Theorem proving by resolution as a basis for question-answering systems. In: Machine intelligence, 4

    Google Scholar 

  7. Gupta G, Pontelli E, Ali K, Carlsson M, Hermenegildo M (July 2001) Parallel execution of Prolog programs: a survey. ACM Trans Program Lang Syst 23(4):472–602

    Article  Google Scholar 

  8. Hermenegildo M (December 2000) Parallelizing irregular and pointer-based computations automatically: perspectives from logic and constraint programming. Parallel Comput 26(13–14):1685–1708

    Article  MATH  Google Scholar 

  9. Hermenegildo M, Carro M (July 1996) Relating data-parallelism and (and-) parallelism in logic programs. Comput Lang J 22(2/3):143–163

    Article  Google Scholar 

  10. Hermenegildo M, Greene K (1991) The &-Prolog system: exploiting independent and-parallelism. New Gener Comput 9(3,4):233–257

    Article  Google Scholar 

  11. Kacsuk P (1992) Distributed data driven Prolog abstract machine (3DPAM). In: Kacsuk P, Wise MJ (eds) Implementations of distributed Prolog. Wiley, Aachen, pp 89–118

    Google Scholar 

  12. Lloyd JW (1987) Foundations of logic programming, 2nd extended edn. Springer, New York

    Google Scholar 

  13. Lusk E, Butler R, Disz T, Olson R, Stevens R, Warren DHD, Calderwood A, Szeredi P, Brand P, Carlsson M, Ciepielewski A, Hausman B, Haridi S (1988) The aurora or-parallel Prolog system. New Gener Comput 7(2/3):243–271

    Google Scholar 

  14. Muthukumar K, Bueno F, García de la Banda M, Hermenegildo M (February 1999) Automatic compile-time parallelization of logic programs for restricted, goal-level, independent and-parallelism. J Log Program 38(2):165–218

    Article  MATH  Google Scholar 

  15. Shapiro EY (September 1989) The family of concurrent logic programming languages. ACM Comput Surv 21(3):412–510

    Article  Google Scholar 

  16. Shen K (November 1996) Overview of DASWAM: exploitation of dependent and-parallelism. J Log Program 29(1–3):245–293

    Article  MATH  Google Scholar 

  17. Smith D (1996) MultiLog and data or-parallelism. J Log Program 29(1–3):195–244

    Article  MATH  Google Scholar 

  18. Tick E (May 1995) The deevolution of concurrent programming languages. J Log Program 23(2):89–124

    Article  MATH  MathSciNet  Google Scholar 

  19. Ueda K (1987) Guarded Horn clauses. In: Shapiro EY (ed) Concurrent Prolog: collected papers. MIT Press, Cambridge, pp 140–156

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Carro, M., Hermenegildo, M. (2011). Logic Languages. In: Padua, D. (eds) Encyclopedia of Parallel Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09766-4_116

Download citation

Publish with us

Policies and ethics

Navigation