![]() | ![]() |
João Marques-Silva
List of publications from the DBLP Bibliography Server - FAQ
2009 | ||
---|---|---|
91 | EE | Vasco M. Manquinho, João P. Marques Silva, Jordi Planes: Algorithms for Weighted Boolean Optimization CoRR abs/0903.0843: (2009) |
90 | EE | Josep Argelich, Inês Lynce, João P. Marques Silva: On Solving Boolean Multilevel Optimization Problems CoRR abs/0904.0019: (2009) |
2008 | ||
89 | EE | Paulo J. Matos, João Marques-Silva: Model Checking Event-B by Encoding into Alloy. ABZ 2008: 346 |
88 | EE | Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira: Efficient Haplotype Inference with Combined CP and OR Techniques. CPAIOR 2008: 308-312 |
87 | EE | João Marques-Silva, Jordi Planes: Algorithms for Maximum Satisfiability using Unsatisfiable Cores. DATE 2008: 408-413 |
86 | EE | Paulo J. Matos, Jordi Planes, Florian Letombe, João Marques-Silva: A MAX-SAT Algorithm Portfolio. ECAI 2008: 911-912 |
85 | Federico Heras, Vasco M. Manquinho, João Marques-Silva: On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization. FLAIRS Conference 2008: 71-76 | |
84 | EE | Inês Lynce, Ana Graça, João Marques-Silva, Arlindo L. Oliveira: Haplotype Inference with Boolean Constraint Solving: An Overview. ICTAI (1) 2008: 92-100 |
83 | EE | João Marques-Silva, Inês Lynce, Vasco M. Manquinho: Symmetry Breaking for Maximum Satisfiability. LPAR 2008: 1-15 |
82 | EE | Florian Letombe, João Marques-Silva: Improvements to Hybrid Incremental SAT Algorithms. SAT 2008: 168-181 |
81 | EE | João Marques-Silva, Vasco M. Manquinho: Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms. SAT 2008: 225-230 |
80 | EE | Inês Lynce, Vasco M. Manquinho, João Marques-Silva: Backtracking. Wiley Encyclopedia of Computer Science and Engineering 2008 |
79 | EE | João Marques-Silva, Inês Lynce, Vasco M. Manquinho: Symmetry Breaking for Maximum Satisfiability CoRR abs/0804.0599: (2008) |
78 | EE | António Morgado, João P. Marques Silva: A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem CoRR abs/0805.0202: (2008) |
77 | EE | Paulo J. Matos, João Marques-Silva: Model Checking Event-B by Encoding into Alloy CoRR abs/0805.3256: (2008) |
76 | EE | Inês Lynce, João Marques-Silva, Steven David Prestwich: Boosting Haplotype Inference with Local Search. Constraints 13(1-2): 155-179 (2008) |
75 | EE | Inês Lynce, João Marques-Silva: Haplotype Inference with Boolean Satisfiability. International Journal on Artificial Intelligence Tools 17(2): 355-387 (2008) |
74 | EE | João Marques-Silva: Model checking with Boolean Satisfiability. J. Algorithms 63(1-3): 3-16 (2008) |
2007 | ||
73 | João Marques-Silva, Karem A. Sakallah: Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings Springer 2007 | |
72 | EE | Ana Graça, João Marques-Silva, Inês Lynce, Arlindo L. Oliveira: Efficient Haplotype Inference with Pseudo-boolean Optimization. AB 2007: 125-139 |
71 | EE | João P. Marques Silva, Inês Lynce: Towards Robust CNF Encodings of Cardinality Constraints. CP 2007: 483-497 |
70 | EE | 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. EPIA Workshops 2007: 621-632 |
69 | EE | Nicola Bombieri, Franco Fummi, Graziano Pravadelli, João Marques-Silva: Towards Equivalence Checking Between TLM and RTL Models. MEMOCODE 2007: 113-122 |
68 | EE | Inês Lynce, João P. Marques Silva: Breaking Symmetries in SAT Matrix Models. SAT 2007: 22-27 |
67 | EE | João Marques-Silva, Jordi Planes: On Using Unsatisfiability for Solving Maximum Satisfiability CoRR abs/0712.1097: (2007) |
66 | EE | Inês Lynce, João P. Marques Silva: Random backtracking in backtrack search algorithms for satisfiability. Discrete Applied Mathematics 155(12): 1604-1612 (2007) |
65 | EE | João Marques-Silva: Interpolant Learning and Reuse in SAT-Based Model Checking. Electr. Notes Theor. Comput. Sci. 174(3): 31-43 (2007) |
2006 | ||
64 | Inês Lynce, João Marques-Silva: Efficient Haplotype Inference with Boolean Satisfiability. AAAI 2006 | |
63 | EE | Inês Lynce, João Marques-Silva: SAT in Bioinformatics: Making the Case with Haplotype Inference. SAT 2006: 136-141 |
62 | EE | 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. SAT 2006: 22-35 |
61 | EE | António Morgado, Paulo J. Matos, Vasco M. Manquinho, João P. Marques Silva: Counting Models in Integer Domains. SAT 2006: 410-423 |
60 | EE | Vasco M. Manquinho, João P. Marques Silva: On Using Cutting Planes in Pseudo-Boolean Optimization. JSAT 2(1-4): 209-219 (2006) |
2005 | ||
59 | EE | João P. Marques Silva: Improvements to the Implementation of Interpolant-Based Model Checking. CHARME 2005: 367-370 |
58 | EE | Vasco M. Manquinho, João P. Marques Silva: Effective Lower Bounding Techniques for Pseudo-Boolean Optimization. DATE 2005: 660-665 |
57 | EE | António Morgado, João P. Marques Silva: Good Learning and Implicit Model Enumeration. ICTAI 2005: 131-136 |
56 | EE | Vasco M. Manquinho, João P. Marques Silva: Satisfiability-Based Algorithms for Pseudo-Boolean Optimization Using Gomory Cuts and Search Restarts. ICTAI 2005: 150-155 |
55 | EE | Vasco M. Manquinho, João P. Marques Silva: On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization. SAT 2005: 451-458 |
54 | EE | Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João P. Marques Silva, Karem A. Sakallah: A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas. SAT 2005: 467-474 |
53 | EE | Inês Lynce, João P. Marques Silva: Efficient data structures for backtrack search SAT solvers. Ann. Math. Artif. Intell. 43(1): 137-152 (2005) |
52 | EE | Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva: Heuristic-Based Backtracking Relaxation for Propositional Satisfiability. J. Autom. Reasoning 35(1-3): 3-24 (2005) |
2004 | ||
51 | EE | Inês Lynce, João P. Marques Silva: Hidden Structure in Unsatisfiable Random 3-SAT: An Empirical Study. ICTAI 2004: 246-251 |
50 | EE | Vasco M. Manquinho, João P. Marques Silva: Integration of Lower Bound Estimates in Pseudo-Boolean Optimization. ICTAI 2004: 742-748 |
49 | EE | Inês Lynce, João P. Marques Silva: On Computing Minimum Unsatisfiable Cores. SAT 2004 |
48 | EE | Vasco M. Manquinho, João P. Marques Silva: Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization. SAT 2004 |
47 | EE | Elsa Carvalho, João P. Marques Silva: Using Rewarding Mechanisms for Improving Branching Heuristics. SAT 2004 |
46 | EE | Vasco M. Manquinho, João P. Marques Silva: Satisfiability-Based Algorithms for Boolean Optimization. Ann. Math. Artif. Intell. 40(3-4): 353-372 (2004) |
2003 | ||
45 | EE | Ateet Bhalla, Inês Lynce, José T. de Sousa, João P. Marques Silva: Heuristic-Based Backtracking for Propositional Satisfiability. EPIA 2003: 116-130 |
44 | EE | Inês Lynce, João P. Marques Silva: Probing-Based Preprocessing Techniques for Propositional Satisfiability. ICTAI 2003: 105- |
43 | EE | Ateet Bhalla, Inês Lynce, José T. de Sousa, João P. Marques Silva: Heuristic Backtracking Algorithms for SAT. MTV 2003: 69-74 |
42 | Inês Lynce, João P. Marques Silva: An Overview of Backtrack Search Satisfiability Algorithms. Ann. Math. Artif. Intell. 37(3): 307-326 (2003) | |
41 | EE | João P. Marques Silva, Luís Guerra e Silva: Solving Satisfiability in Combinational Circuits. IEEE Design & Test of Computers 20(4): 16-21 (2003) |
2002 | ||
40 | EE | Inês Lynce, João P. Marques Silva: Tuning Randomization in Backtrack Search SAT Algorithms. CP 2002: 769 |
39 | Inês Lynce, João P. Marques Silva: Building State-of-the-Art SAT Solvers. ECAI 2002: 166-170 | |
38 | EE | Inês Lynce, João P. Marques Silva: The Effect of Nogood Recording in DPLL-CBJ SAT Algorithms. International Workshop on Constraint Solving and Constraint Logic Programming 2002: 144-158 |
37 | EE | Luís Guerra e Silva, João P. Marques Silva, Luis Miguel Silveira, Karem A. Sakallah: Satisfiability models and algorithms for circuit delay computation. ACM Trans. Design Autom. Electr. Syst. 7(1): 137-158 (2002) |
36 | EE | Vasco M. Manquinho, João P. Marques Silva: Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem. IEEE Trans. on CAD of Integrated Circuits and Systems 21(5): 505-516 (2002) |
2001 | ||
35 | EE | Inês Lynce, João P. Marques Silva: Improving SAT Algorithms by Using Search Pruning Techniques. CP 2001: 770 |
34 | EE | Inês Lynce, Luís Baptista, João P. Marques Silva: Towards Provably Complete Stochastic Search Algorithms for Satisfiability. EPIA 2001: 363-370 |
33 | EE | Paulo F. Flores, Horácio C. Neto, João P. Marques Silva: An exact solution to the minimum size test pattern problem. ACM Trans. Design Autom. Electr. Syst. 6(4): 629-644 (2001) |
32 | EE | Inês Lynce, Luís Baptista, João Marques-Silva: Stochastic Systematic Search Algorithms for Satisfiability. Electronic Notes in Discrete Mathematics 9: 190-204 (2001) |
31 | Arlindo L. Oliveira, João P. Marques Silva: Efficient Algorithms for the Inference of Minimum Size DFAs. Machine Learning 44(1/2): 93-119 (2001) | |
2000 | ||
30 | EE | Vasco M. Manquinho, João P. Marques Silva: On Solving Boolean Optimization with Satisfiability-Based Algorithms. AMAI 2000 |
29 | João P. Marques Silva, Karem A. Sakallah: Invited Tutorial: Boolean Satisfiability Algorithms and Applications in Electronic Design Automation. CAV 2000: 3 | |
28 | EE | Luís Baptista, João P. Marques Silva: Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability. CP 2000: 489-494 |
27 | EE | João P. Marques Silva: Algebraic Simplification Techniques for Propositional Satisfiability. CP 2000: 537-542 |
26 | EE | João P. Marques Silva, Karem A. Sakallah: Boolean satisfiability in electronic design automation. DAC 2000: 675-680 |
25 | EE | Vasco M. Manquinho, João P. Marques Silva: On Using Satisfiability-Based Pruning Techniques in Covering Algorithms. DATE 2000: 356-363 |
24 | EE | Joonyoung Kim, Jesse Whittemore, Karem A. Sakallah, João P. Marques Silva: On Applying Incremental Satisfiability to Delay Fault Testing. DATE 2000: 380-384 |
23 | EE | Karem A. Sakallah, Fadi A. Aloul, João P. Marques Silva: An Experimental Study of Satisfiability Search Heuristics. DATE 2000: 745 |
22 | Vasco M. Manquinho, João P. Marques Silva: Search Pruning Conditions for Boolean Optimization. ECAI 2000: 103-107 | |
21 | EE | João P. Marques Silva, Paulo Guedes: Ship Hull Hydrodynamic Analysis Using Distributed Shared Memory. PARA 2000: 366-372 |
1999 | ||
20 | EE | João P. Marques Silva, Thomas Glass: Combinational Equivalence Checking Using Satisfiability and Recursive Learning. DATE 1999: 145-149 |
19 | EE | Luís Guerra e Silva, Luis Miguel Silveira, João P. Marques Silva: Algorithms for Solving Boolean Satisfiability in Combinational Circuits. DATE 1999: 526-530 |
18 | João P. Marques Silva: The Impact of Branching Heuristics in Propositional Satisfiability Algorithms. EPIA 1999: 62-74 | |
17 | EE | Paulo F. Flores, Horácio C. Neto, João P. Marques Silva: On Applying Set Covering Models to Test Set Compaction. Great Lakes Symposium on VLSI 1999: 8-11 |
16 | EE | Paulo F. Flores, Horácio C. Neto, K. Chakrabarty, João P. Marques Silva: Test pattern generation for width compression in BIST. ISCAS (1) 1999: 114-118 |
15 | Joonyoung Kim, João P. Marques Silva, Karem A. Sakallah: Satisfiability-Based Functional Delay Fault Testing. VLSI 1999: 362-372 | |
14 | EE | Paulo F. Flores, José C. Costa, Horácio C. Neto, José C. Monteiro, João P. Marques Silva: Assignment and Reordering of Incompletely Specified Pattern Sequences Targetting Minimum Power Dissipation. VLSI Design 1999: 37-41 |
13 | João P. Marques Silva, Karem A. Sakallah: GRAPS: A Search Algorithm for Propositional Satisfiability. IEEE Trans. Computers 48(5): 506-521 (1999) | |
1998 | ||
12 | João P. Marques Silva: Integer Programming Models for Optimization Problems in Test Generation. ASP-DAC 1998: 481-487 | |
11 | Arlindo L. Oliveira, João P. Marques Silva: Efficient Search Techniques for the Inference of Minimum Size Finite Automata. SPIRE 1998: 81-89 | |
1997 | ||
10 | João P. Marques Silva, Karem A. Sakallah: Robust Search Algorithms for Test Pattern Generation. FTCS 1997: 152-161 | |
9 | EE | Vasco M. Manquinho, Paulo F. Flores, João P. Marques Silva, Arlindo L. Oliveira: Prime Implicant Computation Using Satisfiability Algorithms. ICTAI 1997: 232-239 |
1996 | ||
8 | EE | João P. Marques Silva, Karem A. Sakallah: GRASP - a new search algorithm for satisfiability. ICCAD 1996: 220-227 |
7 | João P. Marques Silva, Karem A. Sakallah: Conflict Analysis in Search Algorithms for Satisfiability. ICTAI 1996: 467-469 | |
6 | EE | Michael A. Riepe, João P. Marques Silva, Karem A. Sakallah, Richard B. Brown: Ravel-XL: a hardware accelerator for assigned-delay compiled-code logic gate simulation. IEEE Trans. VLSI Syst. 4(1): 113-129 (1996) |
1994 | ||
5 | EE | João P. Marques Silva, Karem A. Sakallah: Dynamic Search-Space Pruning Techniques in Path Sensitization. DAC 1994: 705-711 |
4 | João P. Marques Silva, Karem A. Sakallah: Efficient and Robust Test Generation-Based Timing Analysis. ISCAS 1994: 303-306 | |
1993 | ||
3 | Michael A. Riepe, João P. Marques Silva, Karem A. Sakallah, Richard B. Brown: Ravel-XL: A Hardware Accelerator for Assigned-Delay Compiled-Code Logic Gate Simulation. ICCD 1993: 361-364 | |
2 | João P. Marques Silva, Karem A. Sakallah: An Analysis of Path Sensitization Criteria. ICCD 1993: 68-72 | |
1991 | ||
1 | João P. Marques Silva, Karem A. Sakallah, Luís M. Vidigal: FPD - An Environment for Exact Timing Analysis. ICCAD 1991: 212-215 |