Open AccessDissertation
Coupled resolution engines for programming knowledge based systems in logic
Hamish Taylor
- 01 Jan 1989
3
TL;DR: The design and use of a logic programming system that reconciles three different requirements for this type of application, which couples a concurrent logic programming or CLP engine with a multi-threaded Prolog engine, and is compatible with scale enhancing approaches to resolution using knowledge base machines.
read more
Abstract: Research on a fifth generation of computer systems aims at building high performance knowledge processing engines on the basis of the highly parallel execution of logic programs. Howev er, outstanding problems in the design and implementation of logic programming languages make it problematic to combine parallel execution, adequate support for deduction and a systems programming capability. This combination is important for programming multi-user knowledge based systems in logic. This research describes the design and use of a logic programming system that reconciles these three different requirements for this type of application. The system couples a concurrent logic programming or CLP engine with a multi-threaded Prolog engine. Concurrency among coupled CLP and Prolog computations is sustained partly by fine-grained and-parallelism in the CLP engine, and partly by coarse grained concurrent processing of multiple Prolog processes and a CLP engine under Unix. Communication among distinct computations is realised by message passing, which allows the architecture to reduce contention for shared memory during multi-processing. The CLP engine sustains the process interpretation of systems programming, which enables it to execute the management system of a multi-user knowledge based system. The Prolog engine can exhibit don’t know non-determinism, which enables it to perform exhaustive searches over a knowledge base. The coupled system allows Prolog computation threads to share or to have private databases, and is compatible with scale enhancing approaches to resolution using knowledge base machines. Only minor extensions to CLP and Prolog engines are needed to realise the coupled architecture. This leaves it free to evolve with emerging CLP and Prolog implementation technology, especially in the area of multi-processing CLP languages in andparallel and Prolog in or-parallel. Ke ywords: logic programming, parallelism, deduction, control, systems programming, knowledge base
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Knowledge versus Data.
Gio Wiederhold
- 01 Jan 1985
TL;DR: In this article, the authors define the terms knowledge and data as complements of each other and define a distinction between general concepts and specific instances, which is visible in most systems where general concepts are used to control or abstract object instances.
25
Selecting the Backtrack Literal in the AND/OR Model.
Nam Sung Woo,Kwang-Moo Choe +1 more
- 01 Jan 1986
6
Coupling committed and trail binding resolution engines
Hamish Taylor
- 01 Mar 1991
TL;DR: This paper proposes suitable interfaces and methods for realising forms of coupling for sustaining both knowledge base querying and systems management capabilities within a single logic programming scheme.
2
References
Communicating sequential processes
TL;DR: It is suggested that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method.
A framework for representing knowledge
Marvin Minsky
- 01 Jun 1974
TL;DR: The enormous problem of the volume of background common sense knowledge required to understand even very simple natural language texts is discussed and it is suggested that networks of frames are a reasonable approach to represent such knowledge.
A relational model of data for large shared data banks
TL;DR: In this article, a model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced, and certain operations on relations are discussed and applied to the problems of redundancy and consistency in the user's model.
A Machine-Oriented Logic Based on the Resolution Principle
TL;DR: The paper concludes with a discussion of several principles which are applicable to the design of efficient proof-procedures employing resolution as the basle logical process.
4.4K
Related Papers (5)
Yu-Wen Tung
- 01 Jun 1986
Paul W. Horstmann,Edward P. Stabler +1 more
- 25 Jun 1984
Stefano Ceri,Georg Gottlob,Letizia Tanca +2 more
- 01 Jan 1990