Vasco M. Manquinho

According to our database1, Vasco M. Manquinho authored at least 64 papers between 1997 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
SQUARES : A SQL Synthesizer Using Query Reverse Engineering.
Proc. VLDB Endow., 2020

2019
Virtual machine consolidation using constraint-based multi-objective optimization.
J. Heuristics, 2019

Reflections on "Incremental Cardinality Constraints for MaxSAT".
CoRR, 2019

Integrating Pseudo-Boolean Constraint Reasoning in Multi-Objective Evolutionary Algorithms.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Encodings for Enumeration-Based Program Synthesis.
Proceedings of the Principles and Practice of Constraint Programming, 2019

Constraint-Based Techniques in Stochastic Local Search MaxSAT Solving.
Proceedings of the Principles and Practice of Constraint Programming, 2019

Concurrency Debugging with MaxSMT.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Stable States of Boolean Regulatory Networks Composed Over Hexagonal Grids.
Electron. Notes Theor. Comput. Sci., 2018

Multi-Objective Optimization Through Pareto Minimal Correction Subsets.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Stratification for Constraint-Based Multi-Objective Combinatorial Optimization.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Enhancing Constraint-Based Multi-Objective Combinatorial Optimization.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Parallel Maximum Satisfiability.
Proceedings of the Handbook of Parallel Constraint Reasoning., 2018

2017
Introducing Pareto Minimal Correction Subsets.
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.
Proceedings of the Progress in Artificial Intelligence, 2017

On the Quest for an Acyclic Graph.
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.
Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

On Incremental Core-Guided MaxSAT Solving.
Proceedings of the Principles and Practice of Constraint Programming, 2016

2015
Improving linear search algorithms with model-based approaches for MaxSAT solving.
J. Exp. Theor. Artif. Intell., 2015

Deterministic Parallel MaxSAT Solving.
Int. J. Artif. Intell. Tools, 2015

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

Exploiting Resolution-Based Representations for MaxSAT Solving.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Generalized Totalizer Encoding for Pseudo-Boolean Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2015

2014
On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving.
J. Satisf. Boolean Model. Comput., 2014

Inferring phylogenetic trees using pseudo-Boolean optimization.
AI Commun., 2014

Open-WBO: A Modular MaxSAT Solver, .
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

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

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

Incremental Cardinality Constraints for MaxSAT.
Proceedings of the Principles and Practice of Constraint Programming, 2014

2013
Community-Based Partitioning for MaxSAT Solving.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

2012
PackUp: Tools for Package Upgradability Solving.
J. Satisf. Boolean Model. Comput., 2012

On When and How to use SAT to Mine Frequent Itemsets
CoRR, 2012

An overview of parallel SAT solving.
Constraints An Int. J., 2012

Parallel search for maximum satisfiability.
AI Commun., 2012

Clause Sharing in Parallel MaxSAT.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

On Partitioning for Maximum Satisfiability.
Proceedings of the ECAI 2012, 2012

2011
Exploiting Cardinality Encodings in Parallel Maximum Satisfiability.
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.
IEEE Trans. Very Large Scale Integr. Syst., 2010

Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes.
J. Comput. Biol., 2010

Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability
CoRR, 2010

Improving Unsatisfiability-Based Algorithms for Boolean Optimization.
Proceedings of the Theory and Applications of Satisfiability Testing, 2010

Improving Search Space Splitting for Parallel SAT Solving.
Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence, 2010

2009
Pseudo-Boolean and Cardinality Constraints.
Proceedings of the Handbook of Satisfiability, 2009

Algorithms for Weighted Boolean Optimization.
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.
Proceedings of the Comparative Genomics, International Workshop, 2009

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

Guest Editors Conclusion.
J. Satisf. Boolean Model. Comput., 2008

Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms.
Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Learning Techniques for Pseudo-Boolean Solving.
Proceedings of the LPAR 2008 Workshops, 2008

Symmetry Breaking for Maximum Satisfiability.
Proceedings of the Logic for Programming, 2008

On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization.
Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, 2008

2006
On Using Cutting Planes in Pseudo-Boolean Optimization.
J. Satisf. Boolean Model. Comput., 2006

The First Evaluation of Pseudo-Boolean Solvers (PB'05).
J. Satisf. Boolean Model. Comput., 2006

Counting Models in Integer Domains.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

2005
On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Satisfiability-Based Algorithms for Pseudo-Boolean Optimization Using Gomory Cuts and Search Restarts.
Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2005), 2005

Effective Lower Bounding Techniques for Pseudo-Boolean Optimization.
Proceedings of the 2005 Design, 2005

2004
Satisfiability-Based Algorithms for Boolean Optimization.
Ann. Math. Artif. Intell., 2004

Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization.
Proceedings of the SAT 2004, 2004

Integration of Lower Bound Estimates in Pseudo-Boolean Optimization.
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.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2002

2000
Search Pruning Conditions for Boolean Optimization.
Proceedings of the ECAI 2000, 2000

On Using Satisfiability-Based Pruning Techniques in Covering Algorithms.
Proceedings of the 2000 Design, 2000

On Solving Boolean Optimization with Satisfiability-Based Algorithms.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2000

1997
Prime Implicant Computation Using Satisfiability Algorithms.
Proceedings of the 9th International Conference on Tools with Artificial Intelligence, 1997


  Loading...