Parallel and Constraint Logic Programming

Parallel and Constraint Logic Programming PDF

Author: Ioannis Vlahavas

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 157

ISBN-13: 1461551196

DOWNLOAD EBOOK →

Constraint Logic Programming (CLP), an area of extreme research interest in recent years, extends the semantics of Prolog in such a way that the combinatorial explosion, a characteristic of most problems in the field of Artificial Intelligence, can be tackled efficiently. By employing solvers dedicated to each domain instead of the unification algorithm, CLP drastically reduces the search space of the problem, which leads to increased efficiency in the execution of logic programs. CLP offers the possibility of solving complex combinatorial problems in an efficient way, and at the same time maintains the advantages offered by the declarativeness of logic programming. The aim of this book is to present parallel and constraint logic programming, offering a basic understanding of the two fields to the reader new to the area. The first part of the book gives an introduction to the fundamental aspects of conventional logic programming which is necessary for understanding the parts that follow. The second part includes an introduction to parallel logic programming, architectures and implementations proposed in the area. Finally, the third part presents the principles of constraint logic programming. The last two parts also include descriptions of the supporting facilities for the two paradigms in two popular systems; ECLIPSe and SICStus. These platforms have been selected mainly because they offer both parallel and constraint features. Annotated and explained examples are also included in the relevant parts, offering a valuable guide and a first practical experience to the reader. Finally, applications of the covered paradigms are presented. The authors felt that a book of this kind should provide some theoretical background necessary for the understanding of the covered logic programming paradigms, and a quick start for the reader interested in writing parallel and constraint logic programming programs. However it is outside the scope of this book to provide a deep theoretical background of the two areas. In that sense, this book is addressed to a public interested in obtaining a knowledge of the domain, without spending the time and effort to understand the extensive theoretical work done in the field – namely postgraduate and advanced undergraduate students in the area of logic programming. This book fills a gap in the current bibliography, since there is no comprehensive book of this level that covers the areas of conventional, parallel, and constraint logic programming. Parallel and Constraint Logic Programming: An Introduction to Logic, Parallelism and Constraints is appropriate for an advanced level course on Logic Programming or Constraints, and as a reference for practitioners and researchers in industry.

Parallelism and Implementation of Logic and Constraint Logic Programming

Parallelism and Implementation of Logic and Constraint Logic Programming PDF

Author: Ines de Castro Dutra

Publisher: Nova Biomedical Books

Published: 1999

Total Pages: 410

ISBN-13:

DOWNLOAD EBOOK →

One of the main areas of research in logic programming is the design and implementation of sequential and parallel (constraint) logic programming systems. This research goes broadly from the design and specification of novel implementation technology to its actual evaluation in real life situations. This book includes topics such as the analysis and description of implemented systems (or currently under implementation) and their associated techniques, problems found in their development or design, and steps taken towards the solution of these problems.

Handbook of Parallel Constraint Reasoning

Handbook of Parallel Constraint Reasoning PDF

Author: Youssef Hamadi

Publisher: Springer

Published: 2018-04-05

Total Pages: 677

ISBN-13: 3319635166

DOWNLOAD EBOOK →

This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements in a concise way, assuming the reader is familiar with the classical, sequential background. It presents work demonstrating the use of multiple resources from single machine multi-core and GPU-based computations to very large scale distributed execution platforms up to 80,000 processing units. The contributions in the book cover the most important and recent contributions in parallel propositional satisfiability (SAT), maximum satisfiability (MaxSAT), quantified Boolean formulas (QBF), satisfiability modulo theory (SMT), theorem proving (TP), answer set programming (ASP), mixed integer linear programming (MILP), constraint programming (CP), stochastic local search (SLS), optimal path finding with A*, model checking for linear-time temporal logic (MC/LTL), binary decision diagrams (BDD), and model-based diagnosis (MBD). The book is suitable for researchers, graduate students, advanced undergraduates, and practitioners who wish to learn about the state of the art in parallel constraint reasoning.

Logic Programming

Logic Programming PDF

Author: Lee Naish

Publisher: MIT Press

Published: 1997

Total Pages: 446

ISBN-13: 9780262640350

DOWNLOAD EBOOK →

Covers the latest research in areas such as theoretical foundations, constraints, concurrency and parallelism, deductive databases,language design and implementation, non-monotonic reasoning, and logicprogramming and the Internet. 8-12 July 1997, Leuven, Belgium The International Conference on Logic Programming is the main annual conference sponsored by the Association for Logic Programming. It covers the latest research in areas such as theoretical foundations, constraints, concurrency and parallelism, deductive databases, language design and implementation, non-monotonic reasoning, and logic programming and the Internet.

Parallel Constraint Logic Programming Language GDCC and Its Parallel Constraint Solvers

Parallel Constraint Logic Programming Language GDCC and Its Parallel Constraint Solvers PDF

Author: Shin Sedai Konpyūta Gijutsu Kaihatsu Kikō (Japan)

Publisher:

Published: 1992

Total Pages: 17

ISBN-13:

DOWNLOAD EBOOK →

Abstract: "Parallelization of a constraint logic programming (CLP) language can be considered at two major levels; the execution of an inference engine and a solver in parallel, and the execution of a solver in parallel. GDCC is a parallel CLP language that satisfies this two level parallelism. It is implemented in KL1 and is currently running on the Multi-PSI, a loosely coupled distributed memory parallel machine. GDCC has multiple solvers and a block mechanism that enables meta-operation to a constraint set. Currently there are three solvers: an algebraic solver for nonlinear algebraic equations using the Buchberger algorithm, a boolean solver for boolean equations using the Boolean Buchberger algorithm, and a linear integer solver for mixed integer programming. The Buchberger algorithm is a basic technology for symbolic algebra, and several attempts at its parallelization have appeared in the recent literature, with some good results for shared memory machines. The algorithm we present is designed for the distributed memory machine, but nevertheless shows consistently good performance and speedups for a number of standard benchmarks from the literature."

Principles and Practice of Constraint Programming

Principles and Practice of Constraint Programming PDF

Author: Alan H. Borning

Publisher: Springer Science & Business Media

Published: 1994-10-12

Total Pages: 382

ISBN-13: 9783540586012

DOWNLOAD EBOOK →

This volume is the proceedings of the Second International Workshop on the Principles and Practice of Constraint Programming, held at Rosario, Orcas Island, Washington, USA in May 1994 in cooperation with AAAI and ALP. The volume contains 27 full revised papers selected from 87 submissions as well as a summary of a panel session on commercial applications of constraint programming. The contributions cover a broad range of topics including constraint programming languages, algorithms for constraint satisfaction and entailment, and constraints and their relation to fields such as artificial intelligence, databases, operations research, problem solving, and user interfaces.

Multiparadigm Constraint Programming Languages

Multiparadigm Constraint Programming Languages PDF

Author: Petra Hofstedt

Publisher: Springer Science & Business Media

Published: 2011-06-16

Total Pages: 183

ISBN-13: 3642173306

DOWNLOAD EBOOK →

Programming languages are often classified according to their paradigms, e.g. imperative, functional, logic, constraint-based, object-oriented, or aspect-oriented. A paradigm characterizes the style, concepts, and methods of the language for describing situations and processes and for solving problems, and each paradigm serves best for programming in particular application areas. Real-world problems, however, are often best implemented by a combination of concepts from different paradigms, because they comprise aspects from several realms, and this combination is more comfortably realized using multiparadigm programming languages. This book deals with the theory and practice of multiparadigm constraint programming languages. The author first elaborates on programming paradigms and languages, constraints, and the merging of programming concepts which yields multiparadigm (constraint) programming languages. In the second part the author inspects two concrete approaches on multiparadigm constraint programming – the concurrent constraint functional language CCFL, which combines the functional and the constraint-based paradigms and allows the description of concurrent processes; and a general framework for multiparadigm constraint programming and its implementation, Meta-S. The book is appropriate for researchers and graduate students in the areas of programming and artificial intelligence.

Principles and Practice of Constraint Programming

Principles and Practice of Constraint Programming PDF

Author: Vijay Saraswat

Publisher: MIT Press

Published: 1995

Total Pages: 504

ISBN-13: 9780262193610

DOWNLOAD EBOOK →

Constraint programming aims at supporting a wide range of complex applications, which are often modeled naturally in terms of constraints. Early work, in the 1960s and 1970s, made use of constraints in computer graphics, user interfaces, and artificial intelligence. Such work introduced a declarative component in otherwise-procedural systems to reduce the development effort.

Programming Constraint Services

Programming Constraint Services PDF

Author: Christian Schulte

Publisher: Springer

Published: 2003-08-01

Total Pages: 183

ISBN-13: 3540459456

DOWNLOAD EBOOK →

Constraint Programming is an approach for modeling and solving combi- torial problems that has proven successful in many applications. It builds on techniques developed in Arti?cial Intelligence, Logic Programming, and - erations Research. Key techniques are constraint propagation and heuristic search. Constraint Programming is based on an abstraction that decomposes a problem solver into a reusable constraint engine and a declarative program modeling the problem. The constraint engine implements the required pr- agation and search algorithms. It can be realized as a library for a general purpose programming language (e.g. C++), as an extension of an existing language (e.g. Prolog), or as a system with its own dedicated language. The present book is concerned with the architecture and implementation of constraint engines. It presents a new, concurrent architecture that is far superior to the sequential architecture underlying Prolog. The new archit- ture is based on concurrent search with copying and recomputation rather than sequential search with trailing and backtracking. One advantage of the concurrent approach is that it accommodates any search strategy. Furth- more, it considerably simpli?es the implementation of constraint propagation algorithms since it eliminates the need to account for trailing and backtra- ing. The book investigates an expressive generalization of the concurrent - chitecture that accommodates propagation-preserving combinators (known as deep guard combinators) for negation, disjunction, implication, and re- cation of constraint propagators. Such combinators are beyond the scope of Prolog’s technology. In the concurrent approach they can be obtained with a re?ective encapsulation primitive.