Sistemas Informáticos y Computación

2007

1. A Distributed Implementation of Mobile Maude

   Electronic Notes in Theoretical Computer Science, Vol. 176, Núm. 4, pp. 113-131

2. A Formal Specification of the Memorization Process

   International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), Vol. 1, Núm. 4, pp. 47-60

3. A Fully Sound Goal Solving Calculus for the Cooperation of Solvers in the C F L P Scheme

   Electronic Notes in Theoretical Computer Science, Vol. 177, Núm. 1, pp. 235-252

4. A Proposal for the Cooperation of Solvers in Constraint Functional Logic Programming

   Electronic Notes in Theoretical Computer Science, Vol. 188, pp. 37-51

5. A comparison between two logical formalisms for rewriting

   Theory and Practice of Logic Programming, Vol. 7, Núm. 1-2, pp. 183-213

6. Binary search trees, recurrent properties and wave equations

   Fundamenta Informaticae, Vol. 81, Núm. 4, pp. 409-439

7. Christiansen grammar evolution: Grammatical evolution with semantics

   IEEE Transactions on Evolutionary Computation, Vol. 11, Núm. 1, pp. 77-90

8. Coding Mobile Synchronizing Petri Nets into Rewriting Logic

   Electronic Notes in Theoretical Computer Science, Vol. 174, Núm. 1, pp. 83-98

9. Cognitive Processes by Using Finite State Machines

   International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), Vol. 1, Núm. 3, pp. 52-65

10. Constraint functional logic programming over finite domains

    Theory and Practice of Logic Programming, Vol. 7, Núm. 5, pp. 537-582

11. Deduction, Strategies, and Rewriting

    Electronic Notes in Theoretical Computer Science, Vol. 174, Núm. 11 SPEC. ISS., pp. 3-25

12. Effective invariants of braid monodromy

    Transactions of the American Mathematical Society, Vol. 359, Núm. 1, pp. 165-183

13. Equivalence of Two Formal Semantics for Functional Logic Programs

    Electronic Notes in Theoretical Computer Science, Vol. 188, pp. 117-142

14. Experiments in Cost Analysis of Java Bytecode

    Electronic Notes in Theoretical Computer Science, Vol. 190, Núm. 1 SPEC. ISS., pp. 67-83

15. Extra Variables Can Be Eliminated from Functional Logic Programs

    Electronic Notes in Theoretical Computer Science, Vol. 188, pp. 3-19

16. From theoretical e-barter models to two alternative implementations based on web services

    Journal of Universal Computer Science, Vol. 13, Núm. 13, pp. 2035-2075

17. Implementing Dynamic-Cut in TOY

    Electronic Notes in Theoretical Computer Science, Vol. 177, Núm. 1, pp. 153-168

18. Improving the Decompilation of Java Bytecode to Prolog by Partial Evaluation

    Electronic Notes in Theoretical Computer Science, Vol. 190, Núm. 1 SPEC. ISS., pp. 85-101

19. Modular Structural Operational Semantics with Strategies

    Electronic Notes in Theoretical Computer Science, Vol. 175, Núm. 1, pp. 3-17

20. On the Expressiveness of Mobile Synchronizing Petri Nets

    Electronic Notes in Theoretical Computer Science, Vol. 180, Núm. 1, pp. 77-94