Buscar
Mostrando ítems 31-33 de 33
Ponencia
Deductive Databases and P Systems
(Fénix Editora, 2004)
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 ...
Ponencia
Verified Computer Algebra in ACL2 (Gröbner Bases Computation)
(Springer, 2004)
In this paper, we present the formal verification of a Common Lisp implementation of Buchberger’s algorithm for computing Gröbner bases of polynomial ideals. This work is carried out in the Acl2 system and shows how ...
Capítulo de Libro
Computing Partial Recursive Functions by Transition P Systems
(Springer, 2004)
In this paper a variant of transition P systems with external output designed to compute partial functions on natural numbers is presented. These P systems are stable under composition, iteration and unbounded minimization ...