Álvaro Fernández Díaz, Clara Benac Earle, and Lars-Åke Fredlund. Adding distribution and fault tolerance to Jason. In Workshop on Programming based on Actors, Agents, and Decentralized Control 2012(AGERE! 2012), Tucson, Arizona (USA), October 21-22 2012. [ bib | .pdf ]
In this paper we describe an extension of the multiagent system programming language Jason with constructs for distribution and fault tolerance. The standard Java-based Jason implementation already does provide a distribution mechanism, which is implemented using the JADE library, but to use it effectively some Java programming is often required. Moreover, there is no support for fault tolerance. In contrast this paper develops constructs for distribution and fault tolerance wholly integrated in Jason, permitting the Jason programmer to implement complex distributed systems entirely in Jason itself. The fault tolerance techniques implemented allow the agents to detect, and hence react accordingly, when other agents have stopped working for some reason (e.g., due to a software or a hardware failure) or cannot anymore by reached due to a communication link failure. The introduction of distribution and fault tolerance in Jason represent a step forward towards the coherent integration of successful distributed software techniques, into the agent based software paradigm. The proposed extension to Jason has been implemented in eJason, an Erlang-based implementation of Jason. In fact, in this work we essentially import the distribution and fault tolerance mechanisms from the Erlang programming language into Jason, a task which requires adaptation of the basic primitives due to the difference between a process based functional programming language (Erlang) and a language for programming BDI (Belief-Desire-Intention) agent based systems (Jason).

Sinan Eğilmez. A sound and efficient approach for the similarity concept in fuzzy logic. Master's thesis, Facultad de Informática, Universidad Politécnica de Madrid, October 2012. Advisors: Susana Muñoz Hernández and Víctor Pablos Ceruelo, Calificación: Sobresaliente (9.5/10). [ bib | .html ]
Álvaro Fernández Díaz, Christel Baier, Clara Benac Earle, and Lars-Åke Fredlund. Static partial order reduction for probabilistic concurrent systems. In 9th International Conference on Quantitative Evaluation of SysTems (QEST) 2012, London, United Kingdom, September 17-20 2012. [ bib | .pdf ]
Sound criteria for partial order reduction for probabilistic concurrent systems have been presented in the literature. Their realization relies on a depth-first search-based approach for generating the reduced model. The drawback of this dynamic approach is that it can hardly be combined with other techniques to tackle the state explosion problem, e.g., symbolic probabilistic model checking with multi-terminal variants of binary decision diagrams. Following the approach presented by Kurshan et al. for non-probabilistic systems, we study partial order reduction techniques for probabilistic concurrent systems that can be realized by a static analysis. The idea is to inject the reduction criteria into the control flow graphs of the processes of the system to be analyzed. We provide the theoretical foundations of static partial order reduction for probabilistic concurrent systems and present algorithms to realize them. Finally, we report on some experimental results.

Álvaro Fernández Díaz, Clara Benac Earle, and Lars-Åke Fredlund. Erlang as an implementation platform for BDI languages. In Eleventh ACM SIGPLAN Erlang Workshop 2012(Erlang 12), Copenhagen, Denmark, September 14 2012. [ bib | .pdf ]
In this paper we report on our experiences using Erlang to implement a subset of the agent-oriented programming language Jason. The principal existing implementation of Jason is written in Java, but suffers from a number of drawbacks, i.e., has severe limitations concerning the number of agents that can execute in parallel. Basing a Jason implementation on Erlang itself has the potential of improving such aspects of the resulting multi-agent platform. To evaluate Erlang as a programming language implementation platform the paper describes our experiences in mapping Jason to Erlang, highlighting the positive and negative aspects of Erlang for this task. Moreover, the paper contains a number of benchmarks to evaluate the quantitative aspects of the resulting Jason implementation, especially with respect to support large multi-agent systems.

Susana Muñoz Hernández. Socializing label translation for real multilingual software applications. In 17th Annual LRC Internationalisation & Localisation Conference: Social Localisation, University of Limerick, September 2012. [ bib | .pdf ]
Álvaro García-Pérez and Pablo Nogueira. Enfoque normal y enfoque spine para reducción en el cálculo lambda puro. In María del Mar Gallardo, Mateu Villaret, and José M. Gómez, editors, Actas de las XII Jornadas sobre Programación y Lenguajes - PROLE'12, pages 265--266, Almería, September 2012. Sistedes, Universidad de Almería. [ bib | .pdf ]
El enfoque tradicional para la reducción en el cálculo lambda puro considera estrategias estándar, que nunca contraen un redex que esté a la izquierda del contracto de algún otro redex previamente contraído. La estrategia normal order representa dicho enfoque---al que nos referimos como enfoque normal---, contrayendo el redex situado más a la izquierda hasta que se alcanza una forma normal. Normal order elimina todos los redices presentes en el término, incluso aquellos que se encuentran en el cuerpo de una abstracción o a la derecha de una variable libre. Normal order es una estrategia completa, ya que encuentra la forma normal de un término si ésta existe, o diverge en caso contrario. Normal order es una estrategia híbrida, donde su definición big-step utiliza a la estrategia call-by-name de forma subsidiaria. A diferencia de normal order, call-by-name no contrae ningún redex que se encuentre bajo lambda ni a la derecha de una variable libre, produciendo formas normales weak-head. Normal order utiliza call-by-name para localizar el redex más exterior, contrayendo primero el redex (λx.B)N en vez de contraer prematuramente algún redex en B. Existe un enfoque alternativo que recorre la espina del término (penetrando en el cuerpo de las abstracciones) antes de contraer el redex más exterior. Denominamos a éste enfoque spine. Las estrategia spine order reduce bajo lambda y devuelve formas normales, utilizando head spine como estrategia subsidiaria. Head spine reduce los cuerpos de las abstracciones pero nunca a la derecha de una variable libre, produciendo formas normales head. Spine order utiliza un esquema de hibridación similar al de normal order, tomando head spine como subsidiaria. Spine order contraerá primero el redex (λx.B)N---donde B es una forma normal head---en vez de contraer prematuramente algún redex situado a la derecha de una variable libre dentro de B. ?`Cuáles son las estrategias normal y spine en el cálculo lambda value? Dichas estrategias deben ser análogas a normal order y spine order, es decir, deben ser completas y deben devolver formas normales, utilizando el enfoque normal o spine respectivamente. La respuesta es value normal order y value spine order respectivamente. En este trabajo damos una definición precisa de estrategias híbridas, construimos value normal order y value spine order a partir de consideraciones meta-teóricas y generalizamos el Teorema de Estandarización de Plotkin, demostrando un teorema análogo al Teorema de Reducción Quasi-Leftmost, sustentando así el enfoque spine en el cálculo lambda value.

Pablo Nogueira. Los cálculos lambda y lambda-value y sus estrategias de reducción. In María del Mar Gallardo, Mateu Villaret, and José M. Gómez, editors, Actas de las XII Jornadas sobre Programación y Lenguajes - PROLE'12, page 261, Almería, September 2012. Sistedes, Universidad de Almería. [ bib | .pdf ]
El cálculo lambda es el núcleo de los lenguajes funcionales. El cálculo lambda puro es la versión clásica más basica. Menos conocidos son el cálculo lambda-value de Plotkin y la generalización de ambos, el cálculo lambda-paramétrico de Paolini y Ronchi della Rocca. En este seminario me gustaría dar a conocer dichos cálculos, los conceptos fundamentales (conversión, reducción, estrategias de reducción small-step y big-step, compleción, estandarización, solvability, etc.) y por qué son útiles para el estudio de los lenguajes de programación funcional.

Juan José Moreno Navarro. Evolution of science in spain by subject areas. Technical Report UPM-BABEL-2012-001, Babel Group, Universidad Politécnica de Madrid, September 2012. [ bib ]
Emilio Jesús Gallego Arias. Relational and Allegorical Semantics for Constraint Logic Programming. PhD thesis, Facultad de Informática, Universidad Politécnica de Madrid, July 2012. Advisors: Jim Lipton and Julio Mariño. [ bib ]
Álvaro Fernández Díaz, Clara Benac Earle, and Lars-Åke Fredlund. ejason: an implementation of Jason in Erlang. In 10th International Workshop on Programming Multi-Agent Systems (ProMAS 2012), Valencia, Spain, June 5 2012. Under evaluation to be included in LNCS. [ bib | .pdf ]
In this paper we describe eJason, a prototype implementation of Jason, the well-known agent-oriented programming language, in Erlang, a concurrent functional programming language. The reason for choosing Erlang as the implementation vehicle is the surprising number of similarities between Jason and Erlang, e.g., both have their syntactical roots in logic programming, and share an actor-based process and communication model. Moreover, the Erlang runtime system implements lightweight processes and fast message passing between processes. Thus, by mapping Jason agents and agent-to-agent communication onto Erlang processes and Erlang process-to-process communication, we can create a very high-performing Jason implementation, potentially capable of supporting up to a hundred thousand concurrent actors. In this paper we describe in detail the implementation of Jason in Erlang, and provide early feedback on the performance of the implementation.

Clara Benac Earle and Lars-Åke Fredlund. Verification of timed Erlang programs using McErlang. In 14th IFIP WG 6.1 International Conference FMOODS 2012 and 32nd IFIP WG 6.1 International Conference FORTE 2012, Stockholm, Sweden, 13-16 June, 2012, volume 7273 of IFIP-LNCS, June 2012. [ bib ]
Susana Muñoz-Hernández. Conferencia “experiencia en el uso de las tecnologías de la información y las comunicaciones para dar sostenibilidad a una universidad en ngozi, burundi”. III Jornadas de Enfermedades Tropicales y Salud Internacional de la Facultad de Medicina de la Universidad de Alcalá, February 2012. [ bib ]
María Auxiliadora Montes, Miguel Ángel Peña, and Susana Muñoz-Hernández. Distribution of municipal services access points over a territory in a scenario with restricted information. In Proceedings of the Second International Conference on Social Eco-Informatics (SOTICS 2012), Octubre 21-26, 2012, Venecia, Italia, 2012. [ bib ]
Susana Muñoz-Hernández and Máximo Ramírez Robles. A software supported loan system for sustainability in education. In Proceedings of the 7th International Conference on ICT for Development, Education and Training, Mayo 23-25, 2012, Cotonou, Benin, 2012. [ bib ]
Susana Muñoz-Hernández and Máximo Ramírez Robles. Uburyo: Open source software for managing micro-credits in education. In Proceedings of the International Conference EDUCON 20121. Collaborative Learning and New Pedagogic Approaches in Engineering Education. IEEE Catalog Number: CFP12EDU-USB, Abril 17-20, 2012, Marrakesh, Marruecos, 2012. Premio al mejor artículo en la categoría de "Métodos educativos y menanismos de enseñanza en ingeniería". [ bib ]
Susana Muñoz-Hernández and Máximo Ramírez Robles. Sustainable loans system: motivation,engagement besides an opportunity of education. In Proceedings of IDLELO 5 (Free and Open Source Foundation For Africa Conference)Theme: "Open Source Solutions for achieving Millenium Development Goals", Marzo 19-23, 2012, Abuja, Nigeria, 2012. [ bib ]
Susana Muñoz-Hernández and Máximo Ramírez Robles. Evaluation of an application for managing microcredits in education. In Proceedings of the ACM DEV 2012 (the second annual Symposium on Computing for Development), Marzo 11-12, 2012, Atlanta, GA, EEUU, page 22. ACM, 2012. [ bib | DOI ]
Rubén Monjaraz and Julio Mariño. From the π-calculus to flat ghc. In Schreye et al. [SJK12], pages 163--172. [ bib ]
Danny De Schreye, Gerda Janssens, and Andy King, editors. Principles and Practice of Declarative Programming, PPDP'12, Leuven, Belgium - September 19 - 21, 2012. ACM, 2012. [ bib ]
Emilio Jesús Gallego Arias and James Lipton. Logic programming in tabular allegories. In Agostino Dovier and Vítor Santos Costa, editors, Technical Communications of the 28th International Conference on Logic Programming, ICLP 2012, September 4-8, 2012, Budapest, Hungary, volume 17 of LIPIcs, pages 334--347. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012. [ bib ]
Jeremy Gibbons and Pablo Nogueira, editors. Proceedings of the 11th International Conference on Mathematics of Program Construction, 25--27 June 2012, Madrid, Spain, volume 7342 of Lecture Notes in Computer Science. Springer, 2012. [ bib | DOI | http ]
Ana María Fernández-Soriano, Julio Mariño, and Ángel Herranz. A tool for the integration of constraint programming in spreadsheets. Electronic Notes in Theoretical Computer Science, 282(0):35--45, 2012. Proceedings of the XI Spanish Conference on Programming and Languages, PROLE 2011. [ bib | DOI | http ]
Spreadsheets have become widely used tools, but they are applied to increasingly complex problems, far beyond the kind of tasks for which they were originally conceived. This often results in large, hard to maintain sheets, with little guarantee about their correctness. Potential errors are due in part to unskilled users and also to the spreadsheet systems' own limitations. This contribution presents a tool that aims at improving the usual working flow when filling in a spreadsheet. The tool integrates a constraint solver based on transformations of the cell content into equality and inequality systems over rationals. The transformed systems are then solved using constraint logic programs and the obtained solutions are presented to the user in an understandable way. One of the practical benefits of this solution based on constraint logic programming is backwards execution: our tool is able to find out the required input values to reach the desired outputs depending on aggregation formulae written in the cells. Also, the constraint model offers a simple and sound solution to the problem of circular references in cell formulas.

Murdoch J. Gabbay and Aleksandar Nanevski. Denotation of syntax and metaprogramming in contextual modal type theory. Submitted to the Journal of Applied Logic, 2012. [ bib ]
Murdoch J. Gabbay. Meta-variables as infinite lists in nominal terms unification and rewriting. Logic Journal of the IGPL, 2012. In press. [ bib ]
Ángel Herranz and Julio Mariño. A verified implementation of priority monitors in Java. In Bernhard Beckert, Ferruccio Damiani, and Dilian Gurov, editors, Proceedings 2nd. International Conference on Formal Verification of Object-Oriented Software (FoVeOOS'11), Revised Lectures, volume 7421 of Lecture Notes in Computer Science. Springer, 2012. [ bib ]
Kurosh Madani, António Dourado Correia, Agostinho C. Rosa, and Joaquim Filipe, editors. Computational Intelligence - Revised and Selected Papers of the International Joint Conference, IJCCI 2010, Valencia, Spain, October 2010, volume 399 of Studies in Computational Intelligence. Springer, 2012. [ bib | DOI | http ]

This file was generated by bibtex2html 1.98.