Now showing items 1-4 of 4
3-Col problem modelling using simple kernel P systems [Article]
(Taylor and Francis, 2013)
This paper presents the newly introduced class of (simple) kernel P systems ((s)kP systems) and investigates through a 3-colouring problem case study the expressive power and efficiency of kernel P systems. It describes ...
On spiking neural P systems [Article]
This work deals with several aspects concerning the formal verification of SN P systems and the computing power of some variants. A methodology based on the information given by the transition diagram associated with an ...
A verified Common Lisp implementation of Buchberger's algorithm in ACL2 [Article]
In this article, 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 ACL2, a system which provides ...
Formal proofs about rewriting using ACL2 [Article]
We present an application of the ACL2 theorem prover to reason about rewrite systems theory. We describe the formalization and representation aspects of our work using the firstorder, quantifier-free logic of ACL2 and ...