Search the dblp DataBase

Publications of Author

1. Inês Lynce, João Marques-Silva
   Efficient Haplotype Inference with Boolean Satisfiability. [Citation Graph (0, 0)][DBLP]
   AAAI, 2006, pp:- [Conf]
   
2. Oliver Kullmann, Inês Lynce, João Marques-Silva
   Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel. [Citation Graph (0, 0)][DBLP]
   SAT, 2006, pp:22-35 [Conf]
   
3. Inês Lynce, João Marques-Silva
   SAT in Bioinformatics: Making the Case with Haplotype Inference. [Citation Graph (0, 0)][DBLP]
   SAT, 2006, pp:136-141 [Conf]
   
4. João Marques-Silva
   Interpolant Learning and Reuse in SAT-Based Model Checking. [Citation Graph (0, 0)][DBLP]
   Electr. Notes Theor. Comput. Sci., 2007, v:174, n:3, pp:31-43 [Journal]
   
5. Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva
   Heuristic-Based Backtracking Relaxation for Propositional Satisfiability. [Citation Graph (0, 0)][DBLP]
   J. Autom. Reasoning, 2005, v:35, n:1-3, pp:3-24 [Journal]
   
6. João Marques-Silva, Inês Lynce, Ana Graça, Arlindo L. Oliveira
   Efficient and Tight Upper Bounds for Haplotype Inference by Pure Parsimony Using Delayed Haplotype Selection. [Citation Graph (0, 0)][DBLP]
   EPIA Workshops, 2007, pp:621-632 [Conf]
   
7. Nicola Bombieri, Franco Fummi, Graziano Pravadelli, João Marques-Silva
   Towards Equivalence Checking Between TLM and RTL Models. [Citation Graph (0, 0)][DBLP]
   MEMOCODE, 2007, pp:113-122 [Conf]
   
8. Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira
   Efficient Haplotype Inference with Pseudo-boolean Optimization. [Citation Graph (0, 0)][DBLP]
   AB, 2007, pp:125-139 [Conf]
   
9. 
   Model Checking Event-B by Encoding into Alloy. [Citation Graph (, )][DBLP]
   
   
10. 
    Efficient Haplotype Inference with Combined CP and OR Techniques. [Citation Graph (, )][DBLP]
    
    
11. 
    Algorithms for Maximum Satisfiability using Unsatisfiable Cores. [Citation Graph (, )][DBLP]
    
    
12. 
    A MAX-SAT Algorithm Portfolio. [Citation Graph (, )][DBLP]
    
    
13. 
    On Computing Backbones of Propositional Theories. [Citation Graph (, )][DBLP]
    
    
14. 
    Continuous Verification of Large Embedded Software Using SMT-Based Bounded Model Checking. [Citation Graph (, )][DBLP]
    
    
15. 
    On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization. [Citation Graph (, )][DBLP]
    
    
16. 
    Industrial-Strength Certified SAT Solving through Verified SAT Proof Checking. [Citation Graph (, )][DBLP]
    
    
17. 
    Haplotype Inference with Boolean Constraint Solving: An Overview. [Citation Graph (, )][DBLP]
    
    
18. 
    Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription. [Citation Graph (, )][DBLP]
    
    
19. 
    SMT-Based Bounded Model Checking for Embedded ANSI-C Software. [Citation Graph (, )][DBLP]
    
    
20. 
    Symmetry Breaking for Maximum Satisfiability. [Citation Graph (, )][DBLP]
    
    
21. 
    Improvements to Hybrid Incremental SAT Algorithms. [Citation Graph (, )][DBLP]
    
    
22. 
    Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms. [Citation Graph (, )][DBLP]
    
    
23. 
    Boosting Haplotype Inference with Local Search. [Citation Graph (, )][DBLP]
    
    
24. 
    A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas. [Citation Graph (, )][DBLP]
    
    
25. 
    On Using Unsatisfiability for Solving Maximum Satisfiability [Citation Graph (, )][DBLP]
    
    
26. 
    Symmetry Breaking for Maximum Satisfiability [Citation Graph (, )][DBLP]
    
    
27. 
    Model Checking Event-B by Encoding into Alloy [Citation Graph (, )][DBLP]
    
    
28. 
    Algorithms for finding dispensable variables [Citation Graph (, )][DBLP]
    
    
29. 
    How to Complete an Interactive Configuration Process? [Citation Graph (, )][DBLP]
    
    
30. 
    Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription [Citation Graph (, )][DBLP]