Person:
Caballero Roldán, Rafael

First Name

Rafael

Last Name

Caballero Roldán

URI

https://hdl.handle.net/20.500.14352/78654

Affiliation

Universidad Complutense de Madrid

Faculty / Institute

Informática

Department

Sistemas Informáticos y Computación

Area

Lenguajes y Sistemas Informáticos

Identifiers

Full item page

Search Results

Now showing 1 - 9 of 9

Two type extensions for the constraint modelling language MiniZinc
(Science of Computer Programming, 2015) Caballero Roldán, Rafael; Stuckey, Peter J.; Tenorio Fornés, Ámbar
In this paper we present two type extensions for the modelling language MiniZinc that allow the representation of some problems in a more natural way. The first proposal, called MiniZinc? , extends existing types with additional values. The user can specify both the extension of a predefined type with new values, and the behavior of the operations with relation to the new types. We illustrate the usage of MiniZinc? to model SQL-like problems with integer variables extended with NULL values. The second extension, MiniZinc+, introduces union types in the language. This allows defining recursive types such as trees, which are very useful for modelling problems that involve complex structures. A new case statement is introduced to select the different components of union type terms. The paper shows how a model defined using these extensions can be transformed into a MiniZinc model which is equivalent to the original model.
Project number: 32
Implementación de un entorno de aprendizaje colaborativo de lenguajes de programación mediante traducción
(2016) Caballero Roldán, Rafael; Martín Martín, Enrique; Montenegro Montes, Manuel; Riesco Rodríguez, Adrián; Tamarit Muñoz, Salvador
Memoria del PIMCD 32/2015, donde presentamos una herramienta colaborativa para aprender lenguajes de traducción mediante traducción llamada DuoCode.
Predicting students' knowledge after playing a serious game based on learning analytics data: A case study
(Journal of Computer Assisted Learning, 2019) Alonso Fernández, Cristina; Martínez Ortiz, Iván; Caballero Roldán, Rafael; Freire Morán, Manuel; Fernández Manjón, Baltasar
Serious games have proven to be a powerful tool in education to engage, motivate, and help students learn. However, the change in student knowledge after playing games is usually measured with traditional (paper) prequestionnaires–postquestionnaires. We propose a combination of game learning analytics and data mining techniques to predict knowledge change based on in-game student interactions. We have tested this approach in a case study for which we have conducted preexperiments–postexperiments with 227 students playing a previously validated serious game on first aid techniques. We collected student interaction data while students played, using a game learning analytics infrastructure and the standard data format Experience API for Serious Games. After data collection, we developed and tested prediction models to determine whether knowledge, given as posttest results, can be accurately predicted. Additionally, we compared models both with and without pretest information to determine the importance of previous knowledge when predicting postgame knowledge. The high accuracy of the obtained prediction models suggests that serious games can be used not only to teach but also to measure knowledge acquisition after playing. This will simplify serious games application for educational settings and especially in the classroom easing teachers' evaluation tasks.
Project number: 114
Mejora del aprendizaje de SQL con realimentación semántica
(2018) Sáenz Pérez, Fernando; Caballero Roldán, Rafael; García Ruiz, Yolanda; Garméndia Salvador, Luis
Digital activism masked: the Fridays for Future movement and the “Global Day of Climate Action”: testing social function and framing typologies of claims on Twitter
(Social Sciences, 2023) Fernández Zubieta, Ana; Guevara Gil, Juan Antonio; Caballero Roldán, Rafael; Robles Morales, José Manuel
This article analyzed the Fridays for Future (FFF) movement and its online mobilization around the Global Day of Climate Action on 25 September 2020. Due to the COVID-19 pandemic, this event is a unique opportunity to study digital activism as marchers were considered not appropriate. Using Twitter’s API with keywords “#climateStrike”, and “#FridaysForFuture”, we collected 111,844 unique tweets and retweets from 47,892 unique users. We used two typologies based on social media activism and framing literature to understand the main function of tweets (information, opinion, mobilization, and blame) and their framing (diagnosis, prognosis, and motivational). We also analyzed its relationship and tested its automated classification potential. To do so we manually coded a randomly selected sample of 950 tweets that were used as input for the automated classification process (SVM algorithm with balancing classification techniques). We found that the automated classification of the COVID-19 pandemic appeared to not increase the mobilization function of tweets, as the frequencies of mobilization tweets were low. We also found a balanced diversity of framing tasks, with an important number of tweets that envisaged solutions to legislation and policy changes. COVID-related tweets were less frequently prognostically framed. We found that both typologies were not independent. Tweets with a blaming function tended to be framed in a prognostic way and therefore were related to possible solutions. The automated data classification model performed well, especially across social function typology and the “other” category. This indicated that these tools could help researchers working with social media data to process the information across categories that are currently mainly processed manually
A unified framework for declarative debugging and testing
(2020) Tamarit, Salvador; Caballero Roldán, Rafael; Riesco Rodríguez, Adrián; Martín Martín, Enrique
Context: Debugging is the most challenging and time consuming task in software development. However, it is not properly integrated in the software development cycle, because the result of so much effort is not available in further iterations of the cycle, and the debugging process itself does not benefit from the outcome of other phases such as testing. Objective: We propose to integrate debugging and testing within a single unified framework where each phase generates useful information for the other and the outcomes of each phase are reused. Method: We consider a declarative debugging setting that employs tests to automatically entail the validity of some subcomputations, thus decreasing the time and effort needed to find a bug. Additionally, the debugger stores as new tests the information collected from the user during the debugging phase. This information becomes part of the program test suite, and can be used in future debugging sessions, and also as regression tests. Results: We define a general framework where declarative debugging establishes a bidirectional collaboration with testing. The new setting preserves the properties of the underlying declarative debugging framework (weak completeness and soundness) while generating test cases that can be used later in other debugging sessions or even in other cycles of the software development. The proposed framework is general enough to be instantiated to very different programming languages: Erlang (functional), Java (imperative, object-oriented), and SQL (data query); and the experimental results obtained for Erlang programs validate the effectiveness of the framework. Conclusion: We propose a general unified framework for debugging and testing that simplifies each phase and maximizes the reusability of the outcomes in the different phases of the software development cycle, therefore reducing the overall effort.
A core Erlang semantics for declarative debugging
(Journal of Logical and Algebraic Methods in Programming, 2019) Martin-Martin, Enrique; Tamarit, Salvador; Riesco Rodríguez, Adrián; Caballero Roldán, Rafael
One of the main advantages of declarative languages is their clearly established formal semantics, that allows programmers to reason about the properties of programs and to establish the correctness of tools. In particular, declarative debugging is a technique that analyses the proof trees of computations to locate bugs in programs. However, in the case of commercial declarative languages such as the functional language Erlang, sometimes the semantics is only informally defined, and this precludes these possibilities. Moreover, defining semantics for these languages is far from trivial because they include complex features needed in real applications, such as concurrency. In this paper we define a semantics for Core Erlang, the intermediate language underlying Erlang programs. We focus on the problem of concurrency and show how a medium-sized-step calculus, that avoids the details of small-step semantics but still captures the most common program errors, can be used to define an algorithmic debugger that is sound and complete.
Declarative debugging
(2011) Caballero Roldán, Rafael
Declarative debugging is a debugging technique that abstracts the execution details to focus on the semantic meaning of the program components. It was frst proposed in the feld of Logic Programming, but its general structure has been later extended to other programming paradigms, becoming an active area of research. The technique relies on a data structure, the computation tree, that represents some computation producing an unexpected result. This tree is traversed by asking questions to the user about the correction of the intermediate computation steps until the source of the bug has been found. We show how instances of this general technique can be defned for diferent programming paradigms simply adapting the defnition of computation tree. In particular we present the instances that have been developed by the Declarative Programming Group at the University Complutense of Madrid, which include functional-logic languages (Toy and Curry), object oriented languages (Java), deductive databases (Datalog) and SQL views. Bachelor's degree in Computer Science by the Universidad Politécnica de Madrid and Ph.D in Mathematics by the Universidad Complutense de Madrid. Currently Lecturer (Prof. Contratado Doctor) in the Computer Science Department at the Faculty of Computer Science. Research areas of interest: functional-logic programming, declarative and algorithmic debugging, qualifed declarative programming and in general declarative languages including uncertainty, SQL debugging and test-case generation, embedding of XML query languages in declarative languages, program transformation techniques for declarative languages.
Short term cloud nowcasting for a solar power plant based on irradiance historical Data
(Journal of computer science & technology, 2018) Caballero Roldán, Rafael; Zarzalejo Tirado, Luis Fernando; Otero Martín, Álvaro; Piñuel Moreno, Luis; Wilbert, Stefan
This work considers the problem of forecasting the normal solar irradiance with high spatial and temporal resolution (5 minutes). The forecasting is based on a dataset registered during one year from the high resolution radiometric network at a operational solar power plan at Almeria, Spain. In particular, we show a technique for forecasting the irradiance in the next few minutes from the irradiance values obtained on the previous hour. Our proposal employs a type of recurrent neural network known as LSTM, which can learn complex patterns and that has proven its usability for forecasting temporal series. The results show a reasonable improvement with respect to other prediction methods typically employed in the studies of temporal series.