Published February 23, 2016
| Version v1
Publication
Deductive Databases and P Systems
Description
In 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.
Abstract
Ministerio de Ciencia y Tecnología TIC2002-04220-C03-01
Additional details
- URL
- https://idus.us.es/handle/11441/36319
- URN
- urn:oai:idus.us.es:11441/36319
- Origin repository
- USE