Logic, Language and Computability Research Group

Members

Director

Santiago Figueira
Ph.D. in Computer Science (University of Buenos Aires). Professor (Adjunto) at the Computer Science Department (University of Buenos Aires). His research area is theoretical computer science, computability theory, algorithmic randomness and Kolmogorov complexity. He is also interested in modal logics.
[Home page]

Researchers

	José Castaño Ph.D. in Computer Science. Professor (Adjunto) at the Computer Science Department (University of Buenos Aires). Post-Doc Researcher at Brandeis University , Waltham, MA, Computer Science, Department. 2004 - 2007, Assistant Professor at Brandeis University (2006). His research area is computational linguistics and information extraction.
	Daniel Gorín Ph.D. in Computer Science (cotutelle between University of Buenos Aires and University Henri Poincaré) and teaching assistant at the Computer Science Department (University of Buenos Aires). His research field is inference and reasoning techniques for hybrid logics. [Home page]
	Agustín Gravano Ph.D. in Computer Science (Columbia University, New York). Researcher at the Computer Science Department (University of Buenos Aires). His main area of research is computational linguistics, specifically the relationship between intonation and discourse. His current interests include speech synthesis, and intonation variation in spoken dialogue systems. [Home page]
	Sergio Mera Ph.D. in Computer Science (cotutelle between University of Buenos Aires and University Henri Poincaré) and lecturer at the Computer Science Department (University of Buenos Aires). His research field is the study of fragments of first order logic with good computational behaviour. More specifically, modal and hybrid logics and their properties. [Home page]

PhD students

Gabriel Ignacio Senno
MSc. in Computer Science and Teaching Assistant at the Computer Science Department (both of the University of Buenos Aires). His MSc. thesis was about upper bounds for the lenght of bad sequences in some well quasi-orders. He is interested in logical and computer theoretical aspects of quantum computing.
[Home page]

Other members

Daniel Koile
MSc. in Computer Science. He has recently finished his Master's thesis on the Computational complexity of sub-boolean hybrid logics (supervisors: Carlos Areces and Daniel Gorín). He is interested in modal and hybrid logics.
You can read his Master's thesis (in Spanish) here [Master's Thesis].

Master's thesis students

The following students are working on their CS degree thesis with us. This degree is commonly accepted as a MSc.

Carolina Bruzzoni. A model maintenance system (supervisors: Carlos Areces, Santiago Figueira and Daniel Gorín). Description Logics (DL) are an outstanding example of logics with computational success. There are many advanced tools for these logics that allow the construction, administration and querying of logical theories (e.g. RACER, Fact++, Pellet). One of the many uses of these systems has been the representation of knowledge for dialogue systems. It has been observed, nevertheless, that logical theories may not be the most convenient way to represent partial representations of the world for a certain agent. In this thesis we investigate the use of underspecified models as an alternative for knowledge representation and aim to build a tool with administration and querying capabilities resembling those in DL systems.
Lucía Cavatorta
Esteban Lanzarotti. Handling SAT-solving timeouts using heuristics over BCP (supervisors: Juan Pablo Galeotti and Sergio Mera). In this thesis we investigate an extension for the DLL (Davis-Putnam-Logemann-Loveland) algorithm that will permit the identification of clauses with "bad" behaviour for the sat-solver. This will alow to provide feedback when the sat solving process is aborted, returning a set of clauses with good probabilities of being unsatisfiable. The expected result will be a set of heuristics that work over data collected during the Boolean Constraint Propagation process that will define a set of "hard" clauses.
Mariano Pérez Rodríguez
Diego Rubinstein. Shared-memory parallel theorem proving for hybrid logics using resolution (supervisors: Santiago Figueira and Daniel Gorín). The aim of this thesis is to investigate parallel theorem proving techniques for hybrid logics. This requires solving several matters, such as finding proper ways of splitting the search space and dynamically allocating nodes to new clauses, or developing new algorithms, from distributed satisfiability checking to parallel clause subsumption checking. As an outcome of this thesis, we expect to have a new version of the HyLoRes theorem prover, which shall exploit the capabilities of modern multi-core architectures.