The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

João P. Marques Silva: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vasco M. Manquinho, João P. Marques Silva
    On Solving Boolean Optimization with Satisfiability-Based Algorithms. [Citation Graph (0, 0)][DBLP]
    AMAI, 2000, pp:- [Conf]
  2. João P. Marques Silva
    Integer Programming Models for Optimization Problems in Test Generation. [Citation Graph (0, 0)][DBLP]
    ASP-DAC, 1998, pp:481-487 [Conf]
  3. João P. Marques Silva, Karem A. Sakallah
    Invited Tutorial: Boolean Satisfiability Algorithms and Applications in Electronic Design Automation. [Citation Graph (0, 0)][DBLP]
    CAV, 2000, pp:3- [Conf]
  4. João P. Marques Silva
    Improvements to the Implementation of Interpolant-Based Model Checking. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:367-370 [Conf]
  5. Inês Lynce, João P. Marques Silva
    The Effect of Nogood Recording in DPLL-CBJ SAT Algorithms. [Citation Graph (0, 0)][DBLP]
    International Workshop on Constraint Solving and Constraint Logic Programming, 2002, pp:144-158 [Conf]
  6. Luís Baptista, João P. Marques Silva
    Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability. [Citation Graph (0, 0)][DBLP]
    CP, 2000, pp:489-494 [Conf]
  7. Inês Lynce, João P. Marques Silva
    Improving SAT Algorithms by Using Search Pruning Techniques. [Citation Graph (0, 0)][DBLP]
    CP, 2001, pp:770- [Conf]
  8. Inês Lynce, João P. Marques Silva
    Tuning Randomization in Backtrack Search SAT Algorithms. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:769- [Conf]
  9. João P. Marques Silva
    Algebraic Simplification Techniques for Propositional Satisfiability. [Citation Graph (0, 0)][DBLP]
    CP, 2000, pp:537-542 [Conf]
  10. João P. Marques Silva, Karem A. Sakallah
    Boolean satisfiability in electronic design automation. [Citation Graph (0, 0)][DBLP]
    DAC, 2000, pp:675-680 [Conf]
  11. João P. Marques Silva, Karem A. Sakallah
    Dynamic Search-Space Pruning Techniques in Path Sensitization. [Citation Graph (0, 0)][DBLP]
    DAC, 1994, pp:705-711 [Conf]
  12. Joonyoung Kim, Jesse Whittemore, Karem A. Sakallah, João P. Marques Silva
    On Applying Incremental Satisfiability to Delay Fault Testing. [Citation Graph (0, 0)][DBLP]
    DATE, 2000, pp:380-384 [Conf]
  13. Vasco M. Manquinho, João P. Marques Silva
    Effective Lower Bounding Techniques for Pseudo-Boolean Optimization. [Citation Graph (0, 0)][DBLP]
    DATE, 2005, pp:660-665 [Conf]
  14. Vasco M. Manquinho, João P. Marques Silva
    On Using Satisfiability-Based Pruning Techniques in Covering Algorithms. [Citation Graph (0, 0)][DBLP]
    DATE, 2000, pp:356-363 [Conf]
  15. João P. Marques Silva, Thomas Glass
    Combinational Equivalence Checking Using Satisfiability and Recursive Learning. [Citation Graph (0, 0)][DBLP]
    DATE, 1999, pp:145-149 [Conf]
  16. Karem A. Sakallah, Fadi A. Aloul, João P. Marques Silva
    An Experimental Study of Satisfiability Search Heuristics. [Citation Graph (0, 0)][DBLP]
    DATE, 2000, pp:745- [Conf]
  17. Luís Guerra e Silva, Luis Miguel Silveira, João P. Marques Silva
    Algorithms for Solving Boolean Satisfiability in Combinational Circuits. [Citation Graph (0, 0)][DBLP]
    DATE, 1999, pp:526-530 [Conf]
  18. Inês Lynce, João P. Marques Silva
    Building State-of-the-Art SAT Solvers. [Citation Graph (0, 0)][DBLP]
    ECAI, 2002, pp:166-170 [Conf]
  19. Vasco M. Manquinho, João P. Marques Silva
    Search Pruning Conditions for Boolean Optimization. [Citation Graph (0, 0)][DBLP]
    ECAI, 2000, pp:103-107 [Conf]
  20. Ateet Bhalla, Inês Lynce, José T. de Sousa, João P. Marques Silva
    Heuristic-Based Backtracking for Propositional Satisfiability. [Citation Graph (0, 0)][DBLP]
    EPIA, 2003, pp:116-130 [Conf]
  21. Inês Lynce, Luís Baptista, João P. Marques Silva
    Towards Provably Complete Stochastic Search Algorithms for Satisfiability. [Citation Graph (0, 0)][DBLP]
    EPIA, 2001, pp:363-370 [Conf]
  22. João P. Marques Silva
    The Impact of Branching Heuristics in Propositional Satisfiability Algorithms. [Citation Graph (0, 0)][DBLP]
    EPIA, 1999, pp:62-74 [Conf]
  23. João P. Marques Silva, Karem A. Sakallah
    Robust Search Algorithms for Test Pattern Generation. [Citation Graph (0, 0)][DBLP]
    FTCS, 1997, pp:152-161 [Conf]
  24. Paulo F. Flores, Horácio C. Neto, João P. Marques Silva
    On Applying Set Covering Models to Test Set Compaction. [Citation Graph (0, 0)][DBLP]
    Great Lakes Symposium on VLSI, 1999, pp:8-11 [Conf]
  25. João P. Marques Silva, Karem A. Sakallah
    GRASP - a new search algorithm for satisfiability. [Citation Graph (0, 0)][DBLP]
    ICCAD, 1996, pp:220-227 [Conf]
  26. João P. Marques Silva, Karem A. Sakallah, Luís M. Vidigal
    FPD - An Environment for Exact Timing Analysis. [Citation Graph (0, 0)][DBLP]
    ICCAD, 1991, pp:212-215 [Conf]
  27. 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. [Citation Graph (0, 0)][DBLP]
    ICCD, 1993, pp:361-364 [Conf]
  28. João P. Marques Silva, Karem A. Sakallah
    An Analysis of Path Sensitization Criteria. [Citation Graph (0, 0)][DBLP]
    ICCD, 1993, pp:68-72 [Conf]
  29. Vasco M. Manquinho, João P. Marques Silva
    Integration of Lower Bound Estimates in Pseudo-Boolean Optimization. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2004, pp:742-748 [Conf]
  30. Inês Lynce, João P. Marques Silva
    Hidden Structure in Unsatisfiable Random 3-SAT: An Empirical Study. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2004, pp:246-251 [Conf]
  31. Inês Lynce, João P. Marques Silva
    Probing-Based Preprocessing Techniques for Propositional Satisfiability. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2003, pp:105-0 [Conf]
  32. Vasco M. Manquinho, João P. Marques Silva
    Satisfiability-Based Algorithms for Pseudo-Boolean Optimization Using Gomory Cuts and Search Restarts. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2005, pp:150-155 [Conf]
  33. Vasco M. Manquinho, Paulo F. Flores, João P. Marques Silva, Arlindo L. Oliveira
    Prime Implicant Computation Using Satisfiability Algorithms. [Citation Graph (0, 0)][DBLP]
    ICTAI, 1997, pp:232-239 [Conf]
  34. A. Morgado, João P. Marques Silva
    Good Learning and Implicit Model Enumeration. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2005, pp:131-136 [Conf]
  35. João P. Marques Silva, Karem A. Sakallah
    Conflict Analysis in Search Algorithms for Satisfiability. [Citation Graph (0, 0)][DBLP]
    ICTAI, 1996, pp:467-469 [Conf]
  36. Joonyoung Kim, João P. Marques Silva, Karem A. Sakallah
    Satisfiability-Based Functional Delay Fault Testing. [Citation Graph (0, 0)][DBLP]
    VLSI, 1999, pp:362-372 [Conf]
  37. João P. Marques Silva, Karem A. Sakallah
    Efficient and Robust Test Generation-Based Timing Analysis. [Citation Graph (0, 0)][DBLP]
    ISCAS, 1994, pp:303-306 [Conf]
  38. Paulo F. Flores, Horácio C. Neto, K. Chakrabarty, João P. Marques Silva
    Test pattern generation for width compression in BIST. [Citation Graph (0, 0)][DBLP]
    ISCAS (1), 1999, pp:114-118 [Conf]
  39. Ateet Bhalla, Inês Lynce, José T. de Sousa, João P. Marques Silva
    Heuristic Backtracking Algorithms for SAT. [Citation Graph (0, 0)][DBLP]
    MTV, 2003, pp:69-74 [Conf]
  40. João P. Marques Silva, Paulo Guedes
    Ship Hull Hydrodynamic Analysis Using Distributed Shared Memory. [Citation Graph (0, 0)][DBLP]
    PARA, 2000, pp:366-372 [Conf]
  41. António Morgado, Paulo J. Matos, Vasco M. Manquinho, João P. Marques Silva
    Counting Models in Integer Domains. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:410-423 [Conf]
  42. Elsa Carvalho, João P. Marques Silva
    Using Rewarding Mechanisms for Improving Branching Heuristics. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  43. Inês Lynce, João P. Marques Silva
    On Computing Minimum Unsatisfiable Cores. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  44. Vasco M. Manquinho, João P. Marques Silva
    Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  45. Vasco M. Manquinho, João P. Marques Silva
    On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:451-458 [Conf]
  46. 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. [Citation Graph (0, 0)][DBLP]
    SAT, 2005, pp:467-474 [Conf]
  47. Arlindo L. Oliveira, João P. Marques Silva
    Efficient Search Techniques for the Inference of Minimum Size Finite Automata. [Citation Graph (0, 0)][DBLP]
    SPIRE, 1998, pp:81-89 [Conf]
  48. 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. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1999, pp:37-41 [Conf]
  49. Inês Lynce, João P. Marques Silva
    Efficient data structures for backtrack search SAT solvers. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:137-152 [Journal]
  50. Inês Lynce, João P. Marques Silva
    An Overview of Backtrack Search Satisfiability Algorithms. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2003, v:37, n:3, pp:307-326 [Journal]
  51. Vasco M. Manquinho, João P. Marques Silva
    Satisfiability-Based Algorithms for Boolean Optimization. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2004, v:40, n:3-4, pp:353-372 [Journal]
  52. João P. Marques Silva, Luís Guerra e Silva
    Solving Satisfiability in Combinational Circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Design & Test of Computers, 2003, v:20, n:4, pp:16-21 [Journal]
  53. Arlindo L. Oliveira, João P. Marques Silva
    Efficient Algorithms for the Inference of Minimum Size DFAs. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2001, v:44, n:1/2, pp:93-119 [Journal]
  54. João P. Marques Silva, Karem A. Sakallah
    GRAPS: A Search Algorithm for Propositional Satisfiability. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1999, v:48, n:5, pp:506-521 [Journal]
  55. Vasco M. Manquinho, João P. Marques Silva
    Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2002, v:21, n:5, pp:505-516 [Journal]
  56. Paulo F. Flores, Horácio C. Neto, João P. Marques Silva
    An exact solution to the minimum size test pattern problem. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Design Autom. Electr. Syst., 2001, v:6, n:4, pp:629-644 [Journal]
  57. Luís Guerra e Silva, João P. Marques Silva, Luis Miguel Silveira, Karem A. Sakallah
    Satisfiability models and algorithms for circuit delay computation. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Design Autom. Electr. Syst., 2002, v:7, n:1, pp:137-158 [Journal]
  58. João P. Marques Silva, Inês Lynce
    Towards Robust CNF Encodings of Cardinality Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2007, pp:483-497 [Conf]
  59. Inês Lynce, João P. Marques Silva
    Breaking Symmetries in SAT Matrix Models. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:22-27 [Conf]
  60. Inês Lynce, João P. Marques Silva
    Random backtracking in backtrack search algorithms for satisfiability. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:12, pp:1604-1612 [Journal]
  61. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. VLSI Syst., 1996, v:4, n:1, pp:113-129 [Journal]

  62. Spatial and temporal design debug using partial MaxSAT. [Citation Graph (, )][DBLP]


  63. A Lazy Unbounded Model Checker for Event-B. [Citation Graph (, )][DBLP]


  64. On Solving Boolean Multilevel Optimization Problemse. [Citation Graph (, )][DBLP]


  65. Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper). [Citation Graph (, )][DBLP]


  66. Algorithms for Weighted Boolean Optimization. [Citation Graph (, )][DBLP]


  67. How to Complete an Interactive Configuration Process? [Citation Graph (, )][DBLP]


  68. A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem [Citation Graph (, )][DBLP]


  69. Algorithms for Weighted Boolean Optimization [Citation Graph (, )][DBLP]


  70. On Solving Boolean Multilevel Optimization Problems [Citation Graph (, )][DBLP]


  71. SMT-Based Bounded Model Checking for Embedded ANSI-C Software [Citation Graph (, )][DBLP]


  72. Industrial-Strength Formally Certified SAT Solving [Citation Graph (, )][DBLP]


  73. Continuous Verification of Large Embedded Software using SMT-Based Bounded Model Checking [Citation Graph (, )][DBLP]


  74. Solving Linux Upgradeability Problems Using Boolean Optimization [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002