The Experts below are selected from a list of 285 Experts worldwide ranked by ideXlab platform
Jeanyves Djamen - One of the best experts on this subject based on the ideXlab platform.
-
a conceptual and contextual object oriented logic programming the Prolog Language
International Conference on Conceptual Structures, 1994Co-Authors: Adil Kabbaj, Claude Frasson, Marc Kaltenbach, Jeanyves DjamenAbstract:Building upon J. Sowa's Conceptual Graph (CG) theory, this paper introduces basic elements of the new Language, Prolog++, subsuming Prolog with various objet oriented, conceptual and contextual extensions. A Prolog++ “program” is composed of a declarative knowledge base and a distributed strategic knowledge base; the latter forms a network of objects that communicate by sending messages. A message corresponds to a goal described by a term or a CG (simple or compound). Declarative knowledge base corresponds to a “conceptual dictionary” describing the semantic of concepts and relations used in CG. The declarative base is composed of two hierarchies, one for concepts and the other for relations, each element of the two hierarchies corresponds to an object made up of conceptual structures. This base thus endows Prolog++ with a second form of object oriented programming. Finally, Prolog++ provides, as predefined methods, a set of conceptual operations for editing and handling CG.
Adil Kabbaj - One of the best experts on this subject based on the ideXlab platform.
-
a conceptual and contextual object oriented logic programming the Prolog Language
International Conference on Conceptual Structures, 1994Co-Authors: Adil Kabbaj, Claude Frasson, Marc Kaltenbach, Jeanyves DjamenAbstract:Building upon J. Sowa's Conceptual Graph (CG) theory, this paper introduces basic elements of the new Language, Prolog++, subsuming Prolog with various objet oriented, conceptual and contextual extensions. A Prolog++ “program” is composed of a declarative knowledge base and a distributed strategic knowledge base; the latter forms a network of objects that communicate by sending messages. A message corresponds to a goal described by a term or a CG (simple or compound). Declarative knowledge base corresponds to a “conceptual dictionary” describing the semantic of concepts and relations used in CG. The declarative base is composed of two hierarchies, one for concepts and the other for relations, each element of the two hierarchies corresponds to an object made up of conceptual structures. This base thus endows Prolog++ with a second form of object oriented programming. Finally, Prolog++ provides, as predefined methods, a set of conceptual operations for editing and handling CG.
Roland Karlsson - One of the best experts on this subject based on the ideXlab platform.
-
PARLE - Performance of Muse on the BBN Butterfly TC2000
PARLE '92 Parallel Architectures and Languages Europe, 1992Co-Authors: Roland KarlssonAbstract:Muse is a simple and efficient approach to Or-parallel implementation of the full Prolog Language. It is based on having multiple sequential Prolog engines, each with its local address space, and some shared memory space. It is currently implemented on a number of bus-based and switch-based multiprocessors.
-
Full Prolog and scheduling or-parallelism in muse
International Journal of Parallel Programming, 1991Co-Authors: Roland KarlssonAbstract:Muse is a simple and efficient approach to Or-parallel implementation of the full Prolog Language. It is based on havingmultiplesequential Prolog engines, each with its local address space, and some shared memory space. It is currently implemented on a number of bus-based and switch-based multiprocessors. The sequential SICStus Prolog system has been adapted to Or-parallel implementation with very low extra overhead in comparison with other approaches. The Muse performanhce results are very encouraging in absolute and relative terms.
-
ICLP Workshop on Parallel Execution of Logic Programs - Performance of Muse on the BBN Butterfly TC2000
Parallel Execution of Logic Programs, 1991Co-Authors: Roland Karlsson, Shyam MudambiAbstract:Muse is a simple and efficient approach to Or-parallel implementation of the full Prolog Language. It is based on having multiple sequential Prolog engines, each with its local address space, and some shared memory space. It is currently implemented on a number of bus-based and switch-based multiprocessors.
-
Full Prolog and scheduling or-parallelism in muse
International Journal of Parallel Programming, 1990Co-Authors: Roland KarlssonAbstract:Muse is a simple and efficient approach to Or-parallel implementation of the full Prolog Language. It is based on having mu ltiple se quential Prolog engines, each with its local address space, and some shared memory space. It is currently implemented on a number of bus-based and switch-based multiprocessors. The sequential SICStus Prolog system has been adapted to Or-parallel implementation with very low extra overhead in comparison with other approaches. The Muse performanhce results are very encouraging in absolute and relative terms. The Muse execution model and its performance results on two different multiprocessor machines for a parallel version of Prolog, named Commit Prolog, have been presented in previous papers. This paper discusses supporting the full Prolog Language and describes mechanisms being developed for scheduling Or-parallelism in Muse. It also presents performance results of the Muse implementation on Sequent Symmetry after supporting full Prolog. The results show that the extra overhead associated with supporting the full Prolog Language is negligible.
Péter Szeredi - One of the best experts on this subject based on the ideXlab platform.
-
ICLP Workshop on Parallel Execution of Logic Programs - Solving Optimisation Problems in the Aurora Or-parallel Prolog System
Parallel Execution of Logic Programs, 1991Co-Authors: Péter SzerediAbstract:Aurora is a prototype or-parallel implementation of Prolog for shared memory multiprocessors. It supports the full Prolog Language, thus being able to execute existing Prolog programs without any change. There are, however, several application areas where the simple built-in control of Prolog execution hinders efficient exploitation of or-parallelism.
-
Flexible scheduling of or-parallelism is Aurora: the Bristol scheduler
PARLE '91 Parallel Architectures and Languages Europe, 1991Co-Authors: Anthony Beaumont, Péter Szeredi, S. Muthu Raman, David H. D. WarrenAbstract:Aurora is a prototype or-parallel implementation of the full Prolog Language for shared memory multiprocessors, based on the SRI model of execution. It consists of a Prolog engine based on SICStus Prolog and several alternative schedulers. The task of the schedulers is to share the work available in the Prolog search tree
-
PARLE (2) - Interfacing engines and schedulers in Or-paralllel Prolog systems
PARLE '91 Parallel Architectures and Languages Europe, 1991Co-Authors: Péter Szeredi, Rong Yang, Mats CarlssonAbstract:Parallel Prolog systems consist, at least conceptually, of two components: an engine and a scheduler. This paper addresses the problem of defining a clean interface between these components. Such an interface has been designed for Aurora, a prototype or-parallel implementation of the full Prolog Language for shared memory multiprocessors.
Claude Frasson - One of the best experts on this subject based on the ideXlab platform.
-
a conceptual and contextual object oriented logic programming the Prolog Language
International Conference on Conceptual Structures, 1994Co-Authors: Adil Kabbaj, Claude Frasson, Marc Kaltenbach, Jeanyves DjamenAbstract:Building upon J. Sowa's Conceptual Graph (CG) theory, this paper introduces basic elements of the new Language, Prolog++, subsuming Prolog with various objet oriented, conceptual and contextual extensions. A Prolog++ “program” is composed of a declarative knowledge base and a distributed strategic knowledge base; the latter forms a network of objects that communicate by sending messages. A message corresponds to a goal described by a term or a CG (simple or compound). Declarative knowledge base corresponds to a “conceptual dictionary” describing the semantic of concepts and relations used in CG. The declarative base is composed of two hierarchies, one for concepts and the other for relations, each element of the two hierarchies corresponds to an object made up of conceptual structures. This base thus endows Prolog++ with a second form of object oriented programming. Finally, Prolog++ provides, as predefined methods, a set of conceptual operations for editing and handling CG.
