Vasco Manquinho

Rui Henriques

Proceedings of the 2021 SIAM International Conference on Data Mining, 2021

Replication of SOAR: A Synthesis Approach for Data Science API Refactoring.

[BibT_eX]

[DOI]

Proceedings of the 43rd IEEE/ACM International Conference on Software Engineering: Companion Proceedings, 2021

SOAR: A Synthesis Approach for Data Science API Refactoring.

[BibT_eX]

[DOI]

Proceedings of the 43rd IEEE/ACM International Conference on Software Engineering, 2021

The Seesaw Algorithm: Function Optimization Using Implicit Hitting Sets.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020

SQUARES : A SQL Synthesizer Using Query Reverse Engineering.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

UNCHARTIT: An Interactive Framework for Program Recovery from Charts.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE/ACM International Conference on Automated Software Engineering, 2020

2019

Virtual machine consolidation using constraint-based multi-objective optimization.

[BibT_eX]

[DOI]

J. Heuristics, 2019

Reflections on "Incremental Cardinality Constraints for MaxSAT".

[BibT_eX]

[DOI]

CoRR, 2019

Integrating Pseudo-Boolean Constraint Reasoning in Multi-Objective Evolutionary Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Encodings for Enumeration-Based Program Synthesis.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2019

Constraint-Based Techniques in Stochastic Local Search MaxSAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2019

Concurrency Debugging with MaxSMT.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Stable States of Boolean Regulatory Networks Composed Over Hexagonal Grids.

[BibT_eX]

[DOI]

Proceedings of SASB 2018, 2018

Multi-Objective Optimization Through Pareto Minimal Correction Subsets.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Stratification for Constraint-Based Multi-Objective Combinatorial Optimization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Enhancing Constraint-Based Multi-Objective Combinatorial Optimization.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Parallel Maximum Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Parallel Constraint Reasoning., 2018

2017

Introducing Pareto Minimal Correction Subsets.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Logic-Based Encodings for Ricochet Robots.

[BibT_eX]

[DOI]

Proceedings of the Progress in Artificial Intelligence, 2017

On the Quest for an Acyclic Graph.

[BibT_eX]

[DOI]

Mikolás Janota

Radu Grigore

Proceedings of the 24th RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion 2017 co-located with the 16th International Conference of the Italian Association for Artificial Intelligence (AI*IA 2017), 2017

2016

Non-Portfolio Approaches for Distributed Maximum Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

On Incremental Core-Guided MaxSAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2016

2015

Improving linear search algorithms with model-based approaches for MaxSAT solving.

[BibT_eX]

[DOI]

J. Exp. Theor. Artif. Intell., 2015

Deterministic Parallel MaxSAT Solving.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2015

DistMS: A Non-Portfolio Distributed Solver for Maximum Satisfiability.

[BibT_eX]

[DOI]

Miguel Neves

CoRR, 2015

Exploiting Resolution-Based Representations for MaxSAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Generalized Totalizer Encoding for Pseudo-Boolean Constraints.

[BibT_eX]

[DOI]

Saurabh Joshi

Proceedings of the Principles and Practice of Constraint Programming, 2015

2014

On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2014

Inferring phylogenetic trees using pseudo-Boolean optimization.

[BibT_eX]

[DOI]

Miguel Miranda

AI Commun., 2014

Open-WBO: A Modular MaxSAT Solver, .

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Efficient Autarkies.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Progression in Maximum Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Incremental Cardinality Constraints for MaxSAT.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2014

2013

Community-Based Partitioning for MaxSAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

2012

PackUp: Tools for Package Upgradability Solving.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2012

On When and How to use SAT to Mine Frequent Itemsets

[BibT_eX]

[DOI]

Rui Henriques

CoRR, 2012

An overview of parallel SAT solving.

[BibT_eX]

[DOI]

Constraints An Int. J., 2012

Parallel search for maximum satisfiability.

[BibT_eX]

[DOI]

AI Commun., 2012

Clause Sharing in Parallel MaxSAT.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

On Partitioning for Maximum Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2012, 2012

2011

Exploiting Cardinality Encodings in Parallel Maximum Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

2010

DFT and Minimum Leakage Pattern Generation for Static Power Reduction During Test and Burn-In.

[BibT_eX]

[DOI]

IEEE Trans. Very Large Scale Integr. Syst., 2010

Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes.

[BibT_eX]

[DOI]

João Delgado

J. Comput. Biol., 2010

Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability

[BibT_eX]

[DOI]

CoRR, 2010

Improving Unsatisfiability-Based Algorithms for Boolean Optimization.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2010

Improving Search Space Splitting for Parallel SAT Solving.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010

2009

Pseudo-Boolean and Cardinality Constraints.

[BibT_eX]

[DOI]

Olivier Roussel

Proceedings of the Handbook of Satisfiability, 2009

Algorithms for Weighted Boolean Optimization.

[BibT_eX]

[DOI]

Jordi Planes

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes Using Pseudo-Boolean Optimization.

[BibT_eX]

[DOI]

João Delgado

Proceedings of the Comparative Genomics, International Workshop, 2009

2008

Backtracking.

[BibT_eX]

[DOI]

Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Guest Editors Conclusion.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2008

Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms.

[BibT_eX]

[DOI]

José Faustino Fragoso Femenin dos Santos

Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Learning Techniques for Pseudo-Boolean Solving.

[BibT_eX]

[DOI]

Proceedings of the LPAR 2008 Workshops, 2008

Symmetry Breaking for Maximum Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2008

On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization.

[BibT_eX]

[DOI]

Federico Heras

Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, 2008

2006

On Using Cutting Planes in Pseudo-Boolean Optimization.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2006

The First Evaluation of Pseudo-Boolean Solvers (PB'05).

[BibT_eX]

[DOI]

Olivier Roussel

J. Satisf. Boolean Model. Comput., 2006

Counting Models in Integer Domains.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

2005

On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Satisfiability-Based Algorithms for Pseudo-Boolean Optimization Using Gomory Cuts and Search Restarts.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2005), 2005

Effective Lower Bounding Techniques for Pseudo-Boolean Optimization.

[BibT_eX]

[DOI]

Proceedings of the 2005 Design, 2005

2004

Satisfiability-Based Algorithms for Boolean Optimization.

[BibT_eX]

[DOI]

João P. Marques Silva

Ann. Math. Artif. Intell., 2004

Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization.

[BibT_eX]

[DOI]

Proceedings of the SAT 2004, 2004

Integration of Lower Bound Estimates in Pseudo-Boolean Optimization.

[BibT_eX]

[DOI]

Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004

2002

Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem.

[BibT_eX]

[DOI]

João P. Marques Silva

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2002

2000

Search Pruning Conditions for Boolean Optimization.

[BibT_eX]

Proceedings of the ECAI 2000, 2000

On Using Satisfiability-Based Pruning Techniques in Covering Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 2000 Design, 2000

On Solving Boolean Optimization with Satisfiability-Based Algorithms.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2000

1997

Prime Implicant Computation Using Satisfiability Algorithms.

[BibT_eX]

[DOI]