A computation rule determines the order of selecting premises during an inference process. In this paper we empirically analyse three particular computation rules in a tableau-based, parallel reasoning system for the ALC description logic, which is built in the relational programming model in the Oz language. The system is constructed in the lean deduction style, namely, it has the form of a small program containing only basic mechanisms, which assure soundness and completeness of reasoning. In consequence, the system can act as a convenient test-bed for comparing various inference algorithms and their elements. We take advantage of this property and evaluate the studied methods of selecting premises with regard to their efficiency and spee...
This thesis presents an axiomatic method for proving certain correctness properties of parallel pro...
Qualified cardinality restrictions are expressive language constructs which extend the basic descrip...
In this paper we present a general analysis of the parallelization of deduction strategies. We clas...
: Logic Programming has been recently extended to include abduction as an inference mechanism leadin...
The term "Logic Programming" refers to a variety of computer languages and execution models which ar...
The research conducted has dealt with rule-based expert systems. The algorithms that may lead to eff...
The term "Logic Programming" refers to a variety of computer languages and execution models which ar...
Ho-Fung Leung.Thesis (M.Ph.)--Chinese University of Hong Kong, 1988.Bibliography: leaves [2-6], 3rd ...
* This paper was made according to the program № 14 of fundamental scientific research of the Presid...
A simple but general parallel programming language is considered. The semantics of programs is defin...
Abstract. Although state-of-the-art description logic (DL) reasoners are equipped with a comprehensi...
Logic programs offer many opportunities for parallelism. We present an abstract model that exploits ...
Logic programs offer many opportunities for parallelism. We present an abstract model that exploits ...
We describe a new scheme for the abstract interpretation of logic programs. The scheme was developed...
There is a tension between the objectives of avoiding irrelevant computation and extracting parallel...
This thesis presents an axiomatic method for proving certain correctness properties of parallel pro...
Qualified cardinality restrictions are expressive language constructs which extend the basic descrip...
In this paper we present a general analysis of the parallelization of deduction strategies. We clas...
: Logic Programming has been recently extended to include abduction as an inference mechanism leadin...
The term "Logic Programming" refers to a variety of computer languages and execution models which ar...
The research conducted has dealt with rule-based expert systems. The algorithms that may lead to eff...
The term "Logic Programming" refers to a variety of computer languages and execution models which ar...
Ho-Fung Leung.Thesis (M.Ph.)--Chinese University of Hong Kong, 1988.Bibliography: leaves [2-6], 3rd ...
* This paper was made according to the program № 14 of fundamental scientific research of the Presid...
A simple but general parallel programming language is considered. The semantics of programs is defin...
Abstract. Although state-of-the-art description logic (DL) reasoners are equipped with a comprehensi...
Logic programs offer many opportunities for parallelism. We present an abstract model that exploits ...
Logic programs offer many opportunities for parallelism. We present an abstract model that exploits ...
We describe a new scheme for the abstract interpretation of logic programs. The scheme was developed...
There is a tension between the objectives of avoiding irrelevant computation and extracting parallel...
This thesis presents an axiomatic method for proving certain correctness properties of parallel pro...
Qualified cardinality restrictions are expressive language constructs which extend the basic descrip...
In this paper we present a general analysis of the parallelization of deduction strategies. We clas...