Back to search

Aristotle University Of Thessaloniki (AUTH)

Παράλληλα συστήματα λογικού προγραμματισμού με υποστήριξη περιορισμών

Abstract

dc:description

Logic programming (LP) maintains all the advantages of the declarative programming paradigm, and the main disadvantage of reduced efficiency. To this problem two "orthogonal" solutions have been proposed. The first concerns exploitation of the parallelism that is naturally embedded in logic programs. The second concerns replacing the standard unification process of LP with constraint solving, a solution that led to the introduction of constraint logic programming (CLP). The above two solutions are orthogonal in the sense that they can exist simultaneously in a system, thus leading to the creation of parallel constraint logic programming systems. The present thesis is an effort to propose a solution to the open problem of implementing such systems. In this framework the research described in this thesis was aimed toward a complete solution to the problem of increasing the efficiency of CLP programs, by proposing both a platform, CSPCONS, for the implementation of parallel/distributed CLP applications and a parallel consistency algorithm Dis-SAC. CSPCONS supports programming based on communicating sequential processes that interact through message passing and event generation. Communication between processes is naturally extended over TCP/IP channels, thus allowing the parallel execution of CLP programs in low cost multi-processor environments. CSPCONS is the first LP platform that combines constraint solving, processes and channel based communication and is an excellent platform for the prototyping and implementing parallel/distributed CLP applications. In the present work, this was further demonstrated by the development of two example applications: a distributed workforce management application and an animator tool for X-machines. Towards the more efficient execution of CLP programs, the distributed filtering algorithm Dis-SAC was proposed. Dis-SAC is a consistency algorithm that presents important characteristics, such as the fact that it imposes a high degree of consistency, simple implementation and linear speedup with respect to the number of processing units involved in the execution. The combination of CSPCONS and the Dis-SAC algorithm for the solution of CLP problems, proved to be highly efficient, as demonstrated by the initial implementation and experimental results. This combination is the main result of the present research effort: a complete solution to the efficient execution of CLP programs in a multi-processor environment.

Degree

thesis:*
Grantor dc:publisher
Aristotle University Of Thessaloniki (AUTH)
Year dc:date
2006

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Σακελλαρίου, Ηλίας
  • Sakellariou, Ilias

Subjects

dc:subject × 9

Rights

dc:rights
Statement dc:rights
  • BY_SA
Language dc:language
gre

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/30252

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Σακελλαρίου, Ηλίας; Sakellariou, Ilias. Παράλληλα συστήματα λογικού προγραμματισμού με υποστήριξη περιορισμών. Aristotle University Of Thessaloniki (AUTH), 2006. http://hdl.handle.net/10442/hedi/30252