The following pages link to Inês Lynce (Q421450):
Displaying 46 items.
- Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- An overview of parallel SAT solving (Q487635) (← links)
- Haplotype inference with pseudo-Boolean optimization (Q545548) (← links)
- Heuristic-based backtracking relaxation for propositional satisfiability (Q862398) (← links)
- Boosting haplotype inference with local search (Q941674) (← links)
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642) (← links)
- Introducing Pareto minimal correction subsets (Q1680256) (← links)
- Efficient data structures for backtrack search SAT solvers (Q1777399) (← links)
- An overview of backtrack search satisfiability algorithms (Q1861908) (← links)
- Minimal perturbation in university timetabling with maximum satisfiability (Q2110422) (← links)
- ModRev -- model revision tool for Boolean logical models of biological regulatory networks (Q2110683) (← links)
- Stable states of Boolean regulatory networks composed over hexagonal grids (Q2130578) (← links)
- Random backtracking in backtrack search algorithms for satisfiability (Q2643305) (← links)
- Stochastic systematic search algorithms for satisfiability (Q2741524) (← links)
- PackUp: tools for package upgradability solving (Q2786910) (← links)
- Inferring phylogenetic trees using pseudo-Boolean optimization (Q2811226) (← links)
- Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree Information (Q2889700) (← links)
- On Computing Backbones of Propositional Theories (Q2999099) (← links)
- On Improving MUS Extraction Algorithms (Q3007681) (← links)
- Restoring CSP Satisfiability with MaxSAT (Q3100180) (← links)
- Towards efficient MUS extraction (Q3164969) (← links)
- Open-WBO: A Modular MaxSAT Solver, (Q3192090) (← links)
- Exploiting Resolution-Based Representations for MaxSAT Solving (Q3453232) (← links)
- Modelling Max-CSP as Partial Max-SAT (Q3502687) (← links)
- Towards Robust CNF Encodings of Cardinality Constraints (Q3523075) (← links)
- Sequential Encodings from Max-CSP into Partial Max-SAT (Q3637165) (← links)
- (Q4424861) (← links)
- (Q4475702) (← links)
- (Q4583677) (← links)
- Algorithms for computing backbones of propositional formulae (Q4589090) (← links)
- Satisfiability: where Theory meets Practice (Invited Talk). (Q4649533) (← links)
- (Q4736486) (← links)
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization (Q4930588) (← links)
- The Seventh QBF Solvers Evaluation (QBFEVAL’10) (Q4930592) (← links)
- On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving (Q5015594) (← links)
- Progress in Artificial Intelligence (Q5191554) (← links)
- (Q5283008) (← links)
- Community-Based Partitioning for MaxSAT Solving (Q5326461) (← links)
- Efficient Haplotype Inference with Pseudo-boolean Optimization (Q5429358) (← links)
- (Q5435012) (← links)
- Symmetry Breaking for Maximum Satisfiability (Q5505539) (← links)
- Theory and Applications of Satisfiability Testing (Q5713745) (← links)
- Local Search for Unsatisfiability (Q5756575) (← links)
- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel (Q5756578) (← links)
- New core-guided and hitting set algorithms for multi-objective combinatorial optimization (Q6536121) (← links)
