[PDF] Parallel Constraint Logic Programming Language Gdcc And Its Parallel Constraint Solvers eBook

Author : Shin Sedai Konpyūta Gijutsu Kaihatsu Kikō (Japan)
Publisher :
Page : 17 pages
File Size : 33,80 MB
Release : 1992
Category : Logic programming
ISBN :

GET BOOK

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

Author : David Hawley
Publisher :
Page : 17 pages
File Size : 38,62 MB
Release : 1991
Category : Concurrent programming
ISBN :

GET BOOK

We introduce the language, its implementation in KL1[NaI89a], and a parallel constraint solver for rational polynomials based on a parallel implementation of the Buchberger Algorithm. 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 Multi-PSI, but nevertheless shows consistently good performance and speedups for a number of standard benchmarks from the literature.

Author :
Publisher : IOS Press
Page : 498 pages
File Size : 25,48 MB
Release : 1992
Category : Computers
ISBN : 9789051990997

GET BOOK

The FGCS project was introduced at a congerence in 1981 and commenced the following year. This volume contains the reports on the final phase of the project, showing how the research goals set were achieved.

Author : Youssef Hamadi
Publisher : Springer
Page : 687 pages
File Size : 20,5 MB
Release : 2018-04-05
Category : Computers
ISBN : 3319635166

GET BOOK

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.

Author : Vijay Saraswat
Publisher : MIT Press
Page : 504 pages
File Size : 36,78 MB
Release : 1995
Category : Computers
ISBN : 9780262193610

GET BOOK

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.

Author : El-Ghazali Talbi
Publisher : John Wiley & Sons
Page : 348 pages
File Size : 43,93 MB
Release : 2006-10-27
Category : Computers
ISBN : 0470053917

GET BOOK

This text provides an excellent balance of theory and application that enables you to deploy powerful algorithms, frameworks, and methodologies to solve complex optimization problems in a diverse range of industries. Each chapter is written by leading experts in the fields of parallel and distributed optimization. Collectively, the contributions serve as a complete reference to the field of combinatorial optimization, including details and findings of recent and ongoing investigations.

Author : Ho-Fung Leung
Publisher : World Scientific
Page : 352 pages
File Size : 30,57 MB
Release : 1993
Category : Computers
ISBN : 9789810214562

GET BOOK

This book presents the first attempt to combine concurrent logic programming and constraint logic programing. It is divided into three parts. In the first part, a novel computation model, called the multi-Pandora model, which is designed on the basis of the Pandora model, is presented. In the second part, the distributed implementation schemes for Parlog, Pandora, and multi-Pandora are presented. Finally, the author presents the distributed constraint solvers for finite domain constraints, as well as the distributed constraint solvers in the domains of real numbers and Boolean rings which can be incorporated into the schemes presented in the second part to handle the ?ask?- and ?tell?-constraints.

Author : Petra Hofstedt
Publisher : Springer Science & Business Media
Page : 183 pages
File Size : 45,72 MB
Release : 2011-06-16
Category : Computers
ISBN : 3642173306

GET BOOK

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.