Inês Lynce

Proceedings of the Progress in Artificial Intelligence, 2017

2016

Non-Portfolio Approaches for Distributed Maximum Satisfiability.

[BibT_eX]

[DOI]

Miguel Terra-Neves

Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 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

Algorithms for computing backbones of propositional formulae.

[BibT_eX]

[DOI]

Mikolás Janota

AI Commun., 2015

Exploiting Resolution-Based Representations for MaxSAT Solving.

[BibT_eX]

[DOI]

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

2014

On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving.

[BibT_eX]

[DOI]

J. Satisf. Boolean Model. Comput., 2014

An ontology-based approach to conflict resolution in Home and Building Automation Systems.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2014

Inferring phylogenetic trees using pseudo-Boolean optimization.

[BibT_eX]

[DOI]

Miguel Miranda

AI Commun., 2014

Algorithms for computing minimal equivalent subformulas.

[BibT_eX]

[DOI]

Artif. Intell., 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

SAT Solvers.

[BibT_eX]

[DOI]

Proceedings of the Tractability: Practical Approaches to Hard Problems, 2014

2013

Community-Based Partitioning for MaxSAT Solving.

[BibT_eX]

[DOI]

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

2012

Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT.

[BibT_eX]

[DOI]

J. Multiple Valued Log. Soft Comput., 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

Towards efficient MUS extraction.

[BibT_eX]

[DOI]

Anton Belov

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

Satisfiability: where Theory meets Practice (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic (CSL'12), 2012

Reasoning over Biological Networks Using Maximum Satisfiability.

[BibT_eX]

[DOI]

João Guerra

Proceedings of the Principles and Practice of Constraint Programming, 2012

On Computing Minimal Equivalent Subformulas.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

2011

Restoring CSP Satisfiability with MaxSAT.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Haplotype inference with pseudo-Boolean optimization.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2011

Boolean lexicographic optimization: algorithms & applications.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2011

On Improving MUS Extraction Algorithms.

[BibT_eX]

[DOI]

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

Exploiting Cardinality Encodings in Parallel Maximum Satisfiability.

[BibT_eX]

[DOI]

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

Haplotype Inference Using Propositional Satisfiability.

[BibT_eX]

[DOI]

Ana Graça

Proceedings of the Mathematical Approaches to Polymer Sequence Analysis and Related Problems, 2011

2010

Haplotype Inference by Pure Parsimony: A Survey.

[BibT_eX]

[DOI]

J. Comput. Biol., 2010

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

[BibT_eX]

[DOI]

João Delgado

J. Comput. Biol., 2010

Solving Linux Upgradeability Problems Using Boolean Optimization

[BibT_eX]

[DOI]

Proceedings of the Proceedings First International Workshop on Logics for Component Configuration, 2010

The Seventh QBF Solvers Evaluation (QBFEVAL'10).

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2010

Improving Unsatisfiability-Based Algorithms for Boolean Optimization.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2010

Apt-pbo: solving the software dependency problem using pseudo-boolean optimization.

[BibT_eX]

[DOI]

Paulo Trezentos

Arlindo L. Oliveira

Proceedings of the ASE 2010, 2010

New Insights into Encodings from MaxCSP into Partial MaxSAT.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Symposium on Multiple-Valued Logic, 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

On Computing Backbones of Propositional Theories.

[BibT_eX]

[DOI]

Mikolás Janota

Proceedings of the ECAI 2010, 2010

Boolean Lexicographic Optimization.

[BibT_eX]

[DOI]

Proceedings of the 17th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2010

Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree Information.

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Numeric Biology - 4th International Conference, 2010

2009

Conflict-Driven Clause Learning SAT Solvers.

[BibT_eX]

[DOI]

Sharad Malik

Proceedings of the Handbook of Satisfiability, 2009

On Improving Local Search for Unsatisfiability

[BibT_eX]

[DOI]

David Pereira

Steven D. Prestwich

Proceedings of the Proceedings 6th International Workshop on Local Search Techniques in Constraint Satisfaction, 2009

On Solving Boolean Multilevel Optimization Problems

[BibT_eX]

[DOI]

Josep Argelich

CoRR, 2009

A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas.

[BibT_eX]

[DOI]

Constraints An Int. J., 2009

Sequential Encodings from Max-CSP into Partial Max-SAT.

[BibT_eX]

[DOI]

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

Regular Encodings from Max-CSP into Partial Max-SAT.

[BibT_eX]

[DOI]

Proceedings of the ISMVL 2009, 2009

On Solving Boolean Multilevel Optimization Problemse.

[BibT_eX]

[DOI]

Josep Argelich

Proceedings of the IJCAI 2009, 2009

2008

Backtracking.

[BibT_eX]

[DOI]

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

Haplotype Inference with Boolean Satisfiability.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 2008

Boosting Haplotype Inference with Local Search.

[BibT_eX]

[DOI]

Steve Prestwich

Constraints An Int. J., 2008

Modelling Max-CSP as Partial Max-SAT.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2008

CNF Instances from the Software Package Installation Problem.

[BibT_eX]

[DOI]

Josep Argelich

Proceedings of the 15th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2008

Symmetry Breaking for Maximum Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2008

Encoding Max-CSP into Partial Max-SAT.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), 2008

Haplotype Inference with Boolean Constraint Solving: An Overview.

[BibT_eX]

[DOI]

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

Efficient Haplotype Inference with Combined CP and OR Techniques.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

2007

Random backtracking in backtrack search algorithms for satisfiability.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Report on the SAT 2007 Conference on Theory and Applications of Satisfiability Testing.

[BibT_eX]

[DOI]

Karem A. Sakallah

AI Mag., 2007

Search in the patience game 'Black Hole'.

[BibT_eX]

[DOI]

Ian P. Gent

Christopher Jefferson

AI Commun., 2007

Breaking Symmetries in SAT Matrix Models.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Efficient and Tight Upper Bounds for Haplotype Inference by Pure Parsimony Using Delayed Haplotype Selection.

[BibT_eX]

[DOI]

Proceedings of the Progress in Artificial Intelligence, 2007

Towards Robust CNF Encodings of Cardinality Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2007

Efficient Haplotype Inference with Pseudo-boolean Optimization.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Biology, Second International Conference, 2007

Refutation by Randomised General Resolution.

[BibT_eX]

[DOI]

Steven D. Prestwich

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

Propositional satisfiability: Techniques, algorithms and applications.

[BibT_eX]

[DOI]

AI Commun., 2006

Local Search for Unsatisfiability.

[BibT_eX]

[DOI]

Steven D. Prestwich

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

SAT in Bioinformatics: Making the Case with Haplotype Inference.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel.

[BibT_eX]

[DOI]

Oliver Kullmann

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Sudoku as a SAT Problem.

[BibT_eX]

[DOI]

Joël Ouaknine

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

Efficient Haplotype Inference with Boolean Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

2005

Heuristic-Based Backtracking Relaxation for Propositional Satisfiability.

[BibT_eX]

[DOI]

J. Autom. Reason., 2005

Efficient data structures for backtrack search SAT solvers.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2005

A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

2004

On Computing Minimum Unsatisfiable Cores.

[BibT_eX]

[DOI]

Proceedings of the SAT 2004, 2004

Hidden Structure in Unsatisfiable Random 3-SAT: An Empirical Study.

[BibT_eX]

[DOI]

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

2003

An Overview of Backtrack Search Satisfiability Algorithms.

[BibT_eX]

[DOI]

João P. Marques Silva

Ann. Math. Artif. Intell., 2003

Heuristic Backtracking Algorithms for SAT.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Workshop on Microprocessor Test and Verification, 2003

Probing-Based Preprocessing Techniques for Propositional Satisfiability.

[BibT_eX]

[DOI]

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

Heuristic-Based Backtracking for Propositional Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Progress in Artificial Intelligence, 2003

2002

Building State-of-the-Art SAT Solvers.

[BibT_eX]

Proceedings of the 15th European Conference on Artificial Intelligence, 2002

Tuning Randomization in Backtrack Search SAT Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2002

The Effect of Nogood Recording in DPLL-CBJ SAT Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Constraints, 2002

2001

Stochastic Systematic Search Algorithms for Satisfiability.

[BibT_eX]

[DOI]

Luís Baptista

Electron. Notes Discret. Math., 2001

Towards Provably Complete Stochastic Search Algorithms for Satisfiability.

[BibT_eX]

[DOI]

Luís Baptista

Proceedings of the Progress in Artificial Intelligence, 2001

Improving SAT Algorithms by Using Search Pruning Techniques.

[BibT_eX]

[DOI]