Deductive databases and P systems

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.

[1]  Nada Lavrač,et al.  An Introduction to Inductive Logic Programming , 2001 .

[2]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[3]  Ivan Bratko,et al.  Prolog Programming for Artificial Intelligence , 1986 .

[4]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[5]  J. van Leeuwen,et al.  Logic Programming , 2002, Lecture Notes in Computer Science.

[6]  Kees Doets,et al.  From logic to logic programming , 1994, Foundations of computing series.

[7]  Gheorghe Paun,et al.  Computing with Membranes , 2000, J. Comput. Syst. Sci..