Technical Reports
The technical reports are organized in reverse chronological order. Technical reports available via http/ftp are solely intended for research and educational purposes. Contact me for copies of the other reports.
- António Morgado and João P. Marques-Silva, Algorithms for Propositional Model Enumeration and Counting, Technical Report RT-004-05-CDIL, INESC-ID, Lisbon, Portugal, February 2005.
- Vasco Manquinho and João P. Marques-Silva, On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization, Technical Report RT-003-05-CDIL, INESC-ID, Lisbon, Portugal, February 2005.
- João P. Marques-Silva, Optimizing the Utilization of Interpolants in SAT-Based Model Checking, Technical Report RT-001-05-CDIL, INESC-ID, Lisbon, Portugal, January 2005.
- Inês Lynce and João P. Marques-Silva, The CQuest SAT Solver, Technical Report RT/2/2004, INESC-ID, Portugal, March 2004.
- Inês Lynce and João P. Marques-Silva, On Computing Minimum Unsatisfiable Cores, Technical Report RT/12/2003, INESC-ID, Portugal, October 2003.
- Inês Lynce and João P. Marques-Silva, Probing-Based Formula Manipulation Techniques for SAT, Technical Report RT/06/2003, INESC-ID, Portugal, June 2003.
- Inês Lynce and João P. Marques-Silva, Tuning Randomization in Backtrack Search SAT Algorithms, Technical Report RT/05/2002, INESC-ID, Portugal, June 2002.
- Inês Lynce and João P. Marques-Silva, The Effect of Nogood Recording in MAC-CBJ SAT Algorithms, Technical Report RT/04/2002, INESC-ID, Portugal, April 2002.
- I. Lynce and J. Marques Silva, "Building State-of-the-Art SAT Solvers," Technical Report RT/02/2002, INESC, Portugal, April 2002.
- I. Lynce and J. Marques Silva, "Hypothetical Reasoning in Propositional Satisfiability," Technical Report RT/01/2002, INESC, Portugal, March 2002.
- I. Lynce and J. Marques Silva, "Pattern-Based Simplification Techniques for Satisfiability," Technical Report RT/06/2001, INESC, Portugal, December 2001.
- I. Lynce and J. Marques Silva, "Efficient Data Structures for Fast SAT Solvers," Technical Report RT/05/2001, INESC, Portugal, November 2001.
- I. Lynce, L. Baptista and J. Marques Silva, "Unrestricted Backtrack Search for Propositional Satisfiability," Technical Report RT/03/2001, INESC, Portugal, July 2001.
- I. Lynce, L. Baptista and J. Marques Silva, "Stochastic Systematic Search Algorithms for Satisfiability," Technical Report RT/02/2001, INESC, Portugal, June 2001.
- Paulo F. Flores, Horácio C. Neto and João Marques-Silva, "An Exact Solution to the Minimum-Size Test Pattern Problem,", Technical Report RT/08/2000, INESC, Portugal, September 2000.
- Vasco M. Manquinho and João Marques-Silva, "Satisfiability-Based Algorithms for Boolean Optimization,", Technical Report RT/07/2000, INESC, Portugal, September 2000.
- Luís Guerra e Silva, João Marques-Silva, L. Miguel Silveira and Karem A. Sakallah, "Satisfiability Models and Algorithms for Circuit Delay Computation,", Technical Report RT/06/2000, INESC, Portugal, July 2000.
- Luís Baptista and João Marques-Silva, "Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability", Technical Report RT/02/2000, INESC, Portugal, March 2000.
- João P. Marques-Silva, "Algebraic Simplification Techniques for Propositional Satisfiability", Technical Report RT/01/2000, INESC, Portugal, March 2000.
- Vasco M. Manquinho and João P. Marques-Silva, "Improvements to Search Pruning Techniques in SAT-Based Branch-and-Bound Algorithms for the Binate Covering Problem", Technical Report RT/08/99, INESC, Portugal, December 1999.
- João P. Marques-Silva, "Minimization of Conflict Dependencies in Backtrack Search Boolean Satisfiability Algorithms", Technical Report RT/07/99, INESC, Portugal, December 1999.
- Inês Anselmo, M. João Carrilho and João P. Marques-Silva, "Solving Satisfiability with Backtrack Search and Recursive Learning", Technical Report RT/06/99, INESC, Portugal, December 1999.
- João P. Marques-Silva and Vasco M. Manquinho, "Search Pruning Techniques for Solving Covering Problems", Technical Report RT/06/98, INESC, Portugal, December 1998.
- Paulo F. Flores, João P. Marques-Silva, Horácio C. Neto and Krishnendu Chakrabarty, An Exact Solution to the Minimum-Size Test Pattern Problem, Technical Report RT/12/97, INESC, Portugal, December 1997.
- João P. Marques-Silva, José Carlos Monteiro and Karem A. Sakallah, Test Pattern Generation for Circuits Using Power Management Techniques, Technical Report RT/06/97, INESC, Portugal, April 1997.
- João P. Marques-Silva and Karem A. Sakallah, Robust Search Algorithms for Test Pattern Generation , Technical Report RT/02/97, INESC, Portugal, January 1997.
- João P. Marques-Silva, On Computing Minimum Size Test Sets in Combinational Circuits , Technical Report RT/01/97, INESC, Portugal, January 1997.
- João P. Marques-Silva and Karem A. Sakallah, Conflict Analysis in Search Algorithms for Propositional Satisfiability , Technical Report RT/04/96, INESC, Portugal, May 1996.
- João P. Marques-Silva and Karem A. Sakallah, GRASP -- A New Search Algorithm for Satisfiability, Technical Report CSE-TR-292-96, University of Michigan, April 1996.
- João P. Marques-Silva, Search Algorithms for Satisfiability Problems in Combinational Switching Circuits , Ph.D. Dissertation, EECS Department, University of Michigan, May 1995.
- João P. Marques-Silva and Karem A. Sakallah, "Search-Space Pruning Heuristics for Path Sensitization in Test Pattern Generation," Technical Report CSE-TR-178-93, University of Michigan, October 1993.
- João P. Marques-Silva, Karem A. Sakallah and Luís M. Vidigal, "Exact Timing Analysis of Combinational Circuits," Technical Report CSE-TR-103-91, University of Michigan, August 1991.
- João P. Marques-Silva, Análise Temporal Exacta de Circuitos Combinatórios VLSI, Master Thesis, Instituto Superior Técnico, Lisboa, Portugal, March 1991.
Joao Marques Silva