João P. Marques Silva

João Marques-Silva

	2009
99		Yibin Chen, Sean Safarpour, Andreas G. Veneris, João P. Marques Silva: Spatial and temporal design debug using partial MaxSAT. ACM Great Lakes Symposium on VLSI 2009: 345-350
98		Josep Argelich, Inês Lynce, João P. Marques Silva: On Solving Boolean Multilevel Optimization Problemse. IJCAI 2009: 393-398
97		Vasco M. Manquinho, João P. Marques Silva, Jordi Planes: Algorithms for Weighted Boolean Optimization. SAT 2009: 495-508
96		João P. Marques Silva, Inês Lynce, Sharad Malik: Conflict-Driven Clause Learning SAT Solvers. Handbook of Satisfiability 2009: 131-153
95		Vasco M. Manquinho, João P. Marques Silva, Jordi Planes: Algorithms for Weighted Boolean Optimization CoRR abs/0903.0843: (2009)
94		Josep Argelich, Inês Lynce, João P. Marques Silva: On Solving Boolean Multilevel Optimization Problems CoRR abs/0904.0019: (2009)
93		Lucas Cordeiro, Bernd Fischer, João P. Marques Silva: SMT-Based Bounded Model Checking for Embedded ANSI-C Software CoRR abs/0907.2072: (2009)
92		Mikolás Janota, João Marques-Silva, Radu Grigore: Algorithms for finding dispensable variables CoRR abs/0910.0013: (2009)
91		Mikolás Janota, Goetz Botterweck, Radu Grigore, João Marques-Silva: How to Complete an Interactive Configuration Process? CoRR abs/0910.3913: (2009)
90		Mark H. Liffiton, Maher N. Mneimneh, Inês Lynce, Zaher S. Andraus, João Marques-Silva, Karem A. Sakallah: A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas. Constraints 14(4): 415-442 (2009)
	2008
89		Paulo J. Matos, João Marques-Silva: Model Checking Event-B by Encoding into Alloy. ABZ 2008: 346
88		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		João Marques-Silva, Jordi Planes: Algorithms for Maximum Satisfiability using Unsatisfiable Cores. DATE 2008: 408-413
86		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		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		João Marques-Silva, Inês Lynce, Vasco M. Manquinho: Symmetry Breaking for Maximum Satisfiability. LPAR 2008: 1-15
82		Florian Letombe, João Marques-Silva: Improvements to Hybrid Incremental SAT Algorithms. SAT 2008: 168-181
81		João Marques-Silva, Vasco M. Manquinho: Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms. SAT 2008: 225-230
80		Inês Lynce, Vasco M. Manquinho, João Marques-Silva: Backtracking. Wiley Encyclopedia of Computer Science and Engineering 2008
79		João Marques-Silva, Inês Lynce, Vasco M. Manquinho: Symmetry Breaking for Maximum Satisfiability CoRR abs/0804.0599: (2008)
78		António Morgado, João P. Marques Silva: A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem CoRR abs/0805.0202: (2008)
77		Paulo J. Matos, João Marques-Silva: Model Checking Event-B by Encoding into Alloy CoRR abs/0805.3256: (2008)
76		Inês Lynce, João Marques-Silva, Steven David Prestwich: Boosting Haplotype Inference with Local Search. Constraints 13(1-2): 155-179 (2008)
75		Inês Lynce, João Marques-Silva: Haplotype Inference with Boolean Satisfiability. International Journal on Artificial Intelligence Tools 17(2): 355-387 (2008)
74		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		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		João P. Marques Silva, Inês Lynce: Towards Robust CNF Encodings of Cardinality Constraints. CP 2007: 483-497
70		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		Nicola Bombieri, Franco Fummi, Graziano Pravadelli, João Marques-Silva: Towards Equivalence Checking Between TLM and RTL Models. MEMOCODE 2007: 113-122
68		Inês Lynce, João P. Marques Silva: Breaking Symmetries in SAT Matrix Models. SAT 2007: 22-27
67		João Marques-Silva, Jordi Planes: On Using Unsatisfiability for Solving Maximum Satisfiability CoRR abs/0712.1097: (2007)
66		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		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		Inês Lynce, João Marques-Silva: SAT in Bioinformatics: Making the Case with Haplotype Inference. SAT 2006: 136-141
62		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		António Morgado, Paulo J. Matos, Vasco M. Manquinho, João P. Marques Silva: Counting Models in Integer Domains. SAT 2006: 410-423
60		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		João P. Marques Silva: Improvements to the Implementation of Interpolant-Based Model Checking. CHARME 2005: 367-370
58		Vasco M. Manquinho, João P. Marques Silva: Effective Lower Bounding Techniques for Pseudo-Boolean Optimization. DATE 2005: 660-665
57		António Morgado, João P. Marques Silva: Good Learning and Implicit Model Enumeration. ICTAI 2005: 131-136
56		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		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		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		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		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		Inês Lynce, João P. Marques Silva: Hidden Structure in Unsatisfiable Random 3-SAT: An Empirical Study. ICTAI 2004: 246-251
50		Vasco M. Manquinho, João P. Marques Silva: Integration of Lower Bound Estimates in Pseudo-Boolean Optimization. ICTAI 2004: 742-748
49		Inês Lynce, João P. Marques Silva: On Computing Minimum Unsatisfiable Cores. SAT 2004
48		Vasco M. Manquinho, João P. Marques Silva: Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization. SAT 2004
47		Elsa Carvalho, João P. Marques Silva: Using Rewarding Mechanisms for Improving Branching Heuristics. SAT 2004
46		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		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		Inês Lynce, João P. Marques Silva: Probing-Based Preprocessing Techniques for Propositional Satisfiability. ICTAI 2003: 105-
43		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		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		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		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		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		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		Inês Lynce, João P. Marques Silva: Improving SAT Algorithms by Using Search Pruning Techniques. CP 2001: 770
34		Inês Lynce, Luís Baptista, João P. Marques Silva: Towards Provably Complete Stochastic Search Algorithms for Satisfiability. EPIA 2001: 363-370
33		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		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		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		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		João P. Marques Silva: Algebraic Simplification Techniques for Propositional Satisfiability. CP 2000: 537-542
26		João P. Marques Silva, Karem A. Sakallah: Boolean satisfiability in electronic design automation. DAC 2000: 675-680
25		Vasco M. Manquinho, João P. Marques Silva: On Using Satisfiability-Based Pruning Techniques in Covering Algorithms. DATE 2000: 356-363
24		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		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		João P. Marques Silva, Paulo Guedes: Ship Hull Hydrodynamic Analysis Using Distributed Shared Memory. PARA 2000: 366-372
	1999
20		João P. Marques Silva, Thomas Glass: Combinational Equivalence Checking Using Satisfiability and Recursive Learning. DATE 1999: 145-149
19		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		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		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		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		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		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		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		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

Coauthor Index

1	Fadi A. Aloul	[23]
2	Zaher S. Andraus	[54] [90]
3	Josep Argelich	[94] [98]
4	Luís Baptista	[28] [32] [34]
5	Ateet Bhalla	[43] [45] [52]
6	Nicola Bombieri	[69]
7	Goetz Botterweck	[91]
8	Richard B. Brown	[3] [6]
9	Elsa Carvalho	[47]
10	K. Chakrabarty	[16]
11	Yibin Chen	[99]
12	Lucas Cordeiro	[93]
13	José C. Costa	[14]
14	Bernd Fischer	[93]
15	Paulo F. Flores	[9] [14] [16] [17] [33]
16	Franco Fummi	[69]
17	Thomas Glass	[20]
18	Ana Graça	[70] [72] [84] [88]
19	Radu Grigore	[91] [92]
20	Paulo Guedes	[21]
21	Federico Heras	[85]
22	Mikolás Janota	[91] [92]
23	Joonyoung Kim	[15] [24]
24	Oliver Kullmann	[62]
25	Florian Letombe	[82] [86]
26	Mark H. Liffiton	[90]
27	Inês Lynce	[32] [34] [35] [38] [39] [40] [42] [43] [44] [45] [49] [51] [52] [53] [54] [62] [63] [64] [66] [68] [70] [71] [72] [75] [76] [79] [80] [83] [84] [88] [90] [94] [96] [98]
28	Sharad Malik	[96]
29	Vasco M. Manquinho	[9] [22] [25] [30] [36] [46] [48] [50] [55] [56] [58] [60] [61] [79] [80] [81] [83] [85] [95] [97]
30	Paulo J. Matos	[61] [77] [86] [89]
31	Maher N. Mneimneh	[54] [90]
32	José C. Monteiro (José Monteiro)	[14]
33	António Morgado	[57] [61] [78]
34	Horácio C. Neto	[14] [16] [17] [33]
35	Arlindo L. Oliveira	[9] [11] [31] [70] [72] [84] [88]
36	Jordi Planes	[67] [86] [87] [95] [97]
37	Graziano Pravadelli	[69]
38	Steven David Prestwich	[76]
39	Michael A. Riepe	[3] [6]
40	Sean Safarpour	[99]
41	Karem A. Sakallah	[1] [2] [3] [4] [5] [6] [7] [8] [10] [13] [15] [23] [24] [26] [29] [37] [54] [73] [90]
42	Luís Guerra e Silva	[19] [37] [41]
43	Luis Miguel Silveira (L. Miguel Silveira)	[19] [37]
44	José T. de Sousa	[43] [45] [52]
45	Andreas G. Veneris	[99]
46	Luís M. Vidigal	[1]
47	Jesse Whittemore	[24]

Colors in the list of coauthors