Add to ORKGIn computational processes based on backwards chaining, a rule of the type A Ã B1; : : : ;Bn is seen as a procedure which points that the problem A can be split into the problems B1; : : : ;Bn. In classical devices, the subproblems B1; : : : ;Bn are solved sequentially. In this paper we present some questions that circulated during the Second Brainstorming Week related to the application of the parallelism of P systems to computation based on backwards chaining, and we illustrate them with the example of inferential deductive process.Ministerio de Ciencia y Tecnología TIC2002-04220-C03-0
Ho-Fung Leung.Thesis (M.Ph.)--Chinese University of Hong Kong, 1988.Bibliography: leaves [2-6], 3rd ...
We survey the well-known algebraic laws of sequential programming, and extend them with some less fa...
This paper presents a taxonomy of parallel theorem-proving methods based on the control of search (e...
The research conducted has dealt with rule-based expert systems. The algorithms that may lead to eff...
In this paper we present a general analysis of the parallelization of deduction strategies. We clas...
In this paper, a new model to parallelize the backward-chaining inference technique in production sy...
In this work, two approaches of backward chaining inference implementation were compared. The first ...
. Forward chaining is an algorithm that is particularly simple, and therefore used in many inference...
On the one hand, one of the concepts which lies at the basis of membrane computing is the multiset ...
There is a tension between the objectives of avoiding irrelevant computation and extracting parallel...
The effects of bases of two-input boolean functions are characterised in terms of their impact on so...
technical reportA denotational model for networks of parallel processes is presented which generaliz...
This paper presents some brief considerations on the role of Computational Logic in the construction...
AbstractLogic programming languages based on linear logic are of both theoretical and practical inte...
This paper describes a methodology for parallel theorem proving in a distributed environment,called ...
Ho-Fung Leung.Thesis (M.Ph.)--Chinese University of Hong Kong, 1988.Bibliography: leaves [2-6], 3rd ...
We survey the well-known algebraic laws of sequential programming, and extend them with some less fa...
This paper presents a taxonomy of parallel theorem-proving methods based on the control of search (e...
The research conducted has dealt with rule-based expert systems. The algorithms that may lead to eff...
In this paper we present a general analysis of the parallelization of deduction strategies. We clas...
In this paper, a new model to parallelize the backward-chaining inference technique in production sy...
In this work, two approaches of backward chaining inference implementation were compared. The first ...
. Forward chaining is an algorithm that is particularly simple, and therefore used in many inference...
On the one hand, one of the concepts which lies at the basis of membrane computing is the multiset ...
There is a tension between the objectives of avoiding irrelevant computation and extracting parallel...
The effects of bases of two-input boolean functions are characterised in terms of their impact on so...
technical reportA denotational model for networks of parallel processes is presented which generaliz...
This paper presents some brief considerations on the role of Computational Logic in the construction...
AbstractLogic programming languages based on linear logic are of both theoretical and practical inte...
This paper describes a methodology for parallel theorem proving in a distributed environment,called ...
Ho-Fung Leung.Thesis (M.Ph.)--Chinese University of Hong Kong, 1988.Bibliography: leaves [2-6], 3rd ...
We survey the well-known algebraic laws of sequential programming, and extend them with some less fa...
This paper presents a taxonomy of parallel theorem-proving methods based on the control of search (e...