prof. Ricardo T Oliveira

Ricardo Tavares de Oliveira

Professor Adjunto da Universidade Tecnológica Federal
do Paraná (UTFPR) - Campus Toledo / COENC

Doutor em Ciência da Computação pelo PPGInf
Bacharel em Ciência da Computação pela UFPR
Currículo Lattes / Google Scholar
COENC, sala E-201, UTFPR-Toledo
E-mail: ricardotoliveir at utfpr dot edu dot br
"Computer science is no more about computers than astronomy is about telescopes."
-- Edsger Dijkstra

2024/2

2024/1

2023/2

2023/1

2022/2

2022/1

2021/2

2021/1

2020/2

2020/1

2019/2

2019/1

2018/2

2017/2 (UFPR)

2017/1 (UFPR)

2016/2 (UFPR)

2016/1 (UFPR)

2013/1 (UTFPR-CT)

Doctor in Computer Science at Universidade Federal do Paraná (UFPR), in Curitiba, Brazil. Studied at LIAMF - Laboratório de Inteligência Artifical e Métodos Formais (Artificial Inteligence and Formal Methods Lab).
Studies in the fields of Algorithms and Artificial Inteligence, with focus on reductions and equivalences in problems from both areas (mainly NP problems and their SAT and MaxSAT encodings).
Currículo Lattes / Google Scholar

Publications:

  • Ricardo Tavares de Oliveira and Fabiano Silva. On a Relative MaxSAT Encoding for the Steiner Tree Problem in Graphs. Mexican International Conference on Artificial Intelligence (MICAI 2015). Lecture Notes in Computer Science. 9414: 422-434. Springer-Verlang, 2015. [PDF | The final publication is available at http://www.springerlink.com | DOI]

    In this paper we apply two techniques to improve the Parental-based MaxSAT encodng.
    All source codes used in this work can be downloaded here. Also, the random instances used in our experiments can be downloaded here.

  • Ricardo Tavares de Oliveira and Fabiano Silva. SAT and MaxSAT Encodings for Trees Applied to the Steiner Tree Problem. Brazilian Conference on Intelligent Systems (BRACIS 2014). 192-197. 2014. [PDF | DOI]

    In this paper we present some encodings for trees to SAT and MaxSAT, and use them to solve the Steiner Tree Problem.
    The source code of all presented reductions can be downloaded here. The random instances used in our experiments can be downloaded here.

  • Ricardo Tavares de Oliveira, Fabiano Silva, Bruno Ribas, and Marcos Castilho. On Modeling Connectedness in Reductions from Graph Problems to Extended Satisfiability. 13th Ibero-American Conference on Artifical Inteligence (IBERAMIA 2012). Lecture Notes in Artificial Intelligence. 7637: 442-451. Springer-Verlag, 2012. [PDF | The final publication is available at http://www.springerlink.com | DOI]

    In this paper we present reductions from graph problems to MaxSAT.
    The reductors' source code can be downloaded here.