Search Results for author: Ruben Martins

Found 8 papers, 2 papers with code

FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions

no code implementations28 Dec 2020 Margarida Ferreira, Miguel Terra-Neves, Miguel Ventura, Inês Lynce, Ruben Martins

Experimental results show that FOREST successfully returns the desired regular expression in 72% of the instances and outperforms REGEL, a state-of-the-art regular expression synthesizer.

Enumerative Search

SQUARES: A SQL Synthesizer Using Query Reverse Engineering

1 code implementation31 Aug 2020 Pedro Orvalho, Miguel Terra-Neves; Miguel Ventura, Ruben Martins, Vasco Manquinho

As a result, many of them can provide examples of data transformations but are unable to produce the desired query.

Enumerative Search SQL Synthesis

Reflections on "Incremental Cardinality Constraints for MaxSAT"

no code implementations10 Oct 2019 Ruben Martins, Saurabh Joshi, Vasco Manquinho, Ines Lynce

To celebrate the first 25 years of the International Conference on Principles and Practice of Constraint Programming (CP) the editors invited the authors of the most cited paper of each year to write a commentary on their paper.

Approximation Strategies for Incomplete MaxSAT

1 code implementation19 Jun 2018 Saurabh Joshi, Prateek Kumar, Ruben Martins, Sukrut Rao

Incomplete MaxSAT solving aims to quickly find a solution that attempts to minimize the sum of the weights of the unsatisfied soft clauses without providing any optimality guarantees.

Relating Complexity-theoretic Parameters with SAT Solver Performance

no code implementations26 Jun 2017 Edward Zulkoski, Ruben Martins, Christoph Wintersteiger, Robert Robere, Jia Liang, Krzysztof Czarnecki, Vijay Ganesh

Over the years complexity theorists have proposed many structural parameters to explain the surprising efficiency of conflict-driven clause-learning (CDCL) SAT solvers on a wide variety of large industrial Boolean instances.

Generalized Totalizer Encoding for Pseudo-Boolean Constraints

no code implementations21 Jul 2015 Saurabh Joshi, Ruben Martins, Vasco Manquinho

We show the superiority of GTE with respect to other encodings when large pseudo-Boolean constraints have low number of distinct coefficients.

Exploiting Resolution-based Representations for MaxSAT Solving

no code implementations10 May 2015 Miguel Neves, Ruben Martins, Mikoláš Janota, Inês Lynce, Vasco Manquinho

Usually, these MaxSAT algorithms perform better when small unsatisfiable subformulas are found early.

Incremental Cardinality Constraints for MaxSAT

no code implementations20 Aug 2014 Ruben Martins, Saurabh Joshi, Vasco Manquinho, Ines Lynce

In general, MaxSAT algorithms perform a succession of SAT solver calls to reach an optimum solution making extensive use of cardinality constraints.

Cannot find the paper you are looking for? You can Submit a new open access paper.