◀ Click to filter

Total displayed: 200

Order by:
  • VLSI-SoC: Advanced Research for Systems on Chip
    Huan Chen, Joao Marques Silva
    Improvements to Satisfiability-Based Boolean Function Bi-Decomposition, Springer, http://link.springer.com/book/10.1007/978-3-642-32
    2012
  • Advanced Techniques in Logic Synthesis, Optimizations and Applications
    Joao Marques Silva, Jordi Planes
    Algorithms for Maximum Satisfiability Using Unsatisfiable Cores, Springer, http://www.springer.com/engineering/circuits+%26+s
    2011
  • Handbook of Satisfiability
    Joao Marques Silva, Inês Lynce, Sharad Malik
    Conflict-Driven Clause Learning SAT Solvers, IOS Press,
    2009
  • Encyclopedia of Computer Science and Engineering
    Inês Lynce, Vasco Manquinho, Joao Marques Silva
    Backtracking, Wiley InterScience,
    2009
  • The Best of ICCAD -- 20 Years of Excellence in Computer Aided Design The Best of ICCAD: 20 Years of Excellence in Compu
    Joao Marques Silva, Karem A. Sakallah
    GRASP - A New Search Algorithm for Satisfiability, Kluwer Academic Publishers,
    2003
  • Logic Synthesis and Verication
    W. Kunz, Joao Marques Silva, S. Malik
    SAT and ATPG: Algorithms for Boolean Decision Problems, Kluwer Academic Publishers,
    2001
  • Expansion-based QBF solving versus Q-resolution
    Mikolás Janota, Joao Marques Silva
    Theoretical Computer Science vol. 577, n. 0, DOI 10.1016/j.tcs.2015.01.048
    2015
  • Algorithms for computing backbones of propositional formulae
    Mikolás Janota, Inês Lynce, Joao Marques Silva
    AI Communications vol. 28, n. 2, DOI 10.3233/AIC-140640
    2015
  • MaxSAT-based encodings for Group MaxSAT
    Federico Heras, António José dos Reis Morgado, Joao Marques Silva
    AI Communications vol. 28, n. 2, DOI 10.3233/AIC-140636
    2015
  • Algorithms for computing minimal equivalent subformulas
    Anton Belov, Mikolás Janota, Inês Lynce, Joao Marques Silva
    Artificial Intelligence vol. 216, n. 0, DOI 10.1016/j.artint.2014.07.011
    2014
  • A Two-Variable Model for SAT-Based ATPG
    Huan Chen, Joao Marques Silva
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems vol. 32, DOI 10.1109/TCAD.2013.2275254
    2013
  • Iterative and core-guided MaxSAT solving: A survey and assessment
    António José dos Reis Morgado, Federico Heras, Mark Liffiton, Jordi Planes, Joao Marques Silva
    Constraints vol. 18, DOI 10.1007/s10601-013-9146-2
    2013
  • MUSer2: An Efficient MUS Extractor
    Anton Belov, Joao Marques Silva
    Journal on Satisfiability, Boolean Modeling and Computation vol. 8, n. 1,
    2012
  • Hybrid Incremental Algorithms for Boolean Satisfiability
    Florian Letombe, Joao Marques Silva
    International Journal on Artificial Intelligence Tools vol. 21, n. 6, DOI 10.1142/S021821301250025X
    2012
  • SMT-Based Bounded Model Checking for Embedded ANSI-C Software
    Lucas Cordeiro, Bernd Fischer, Joao Marques Silva
    IEEE Transactions on Software Engineering vol. 38, n. 4, DOI 10.1109/TSE.2011.59
    2012
  • Towards Efficient MUS Extraction
    Anton Belov, Inês Lynce, Joao Marques Silva
    AI Communications vol. 25, n. 2, DOI http://dx.doi.org/10.3233/AIC-2012-0523
    2012
  • TG-Pro: A SAT-based ATPG System
    Huan Chen, Joao Marques Silva
    Journal on Satisfiability, Boolean Modeling and Computation vol. 8, n. 1,
    2012
  • Computing Minimally Unsatisfiable Subformulas: State of the Art and Future Directions
    Joao Marques Silva
    Journal of Multiple-Valued Logic and Soft Computing vol. 19, n. 1,
    2012
  • PackUp: Tools for Package Upgradability Solving
    Mikolás Janota, Inês Lynce, Vasco Manquinho, Joao Marques Silva
    Journal on Satisfiability, Boolean Modeling and Computation vol. 8, n. 1,
    2012
  • Restoring CSP Satisfiability with MaxSAT
    Inês Lynce, Joao Marques Silva
    Fundamenta Informaticae vol. 107, n. 2,
    2011
  • Boolean lexicographic optimization: algorithms & applications
    Joao Marques Silva, Josep Argelich, Ana Sofia Graça, Inês Lynce
    Annals of Mathematics and Artificial Intelligence vol. 62, n. 3,
    2011
  • Anatomy and Empirical Evaluation of Modern SAT Solvers.
    Karem A. Sakallah, Joao Marques Silva
    Bulletin of the EATCS vol. 103, n. 2,
    2011
  • Haplotype inference with pseudo-Boolean optimization
    Ana Sofia Graça, Joao Marques Silva, Inês Lynce, Arlindo L. Oliveira
    Annals of Operations Research vol. 184, n. 1, DOI 10.1007/s10479-009-0675-4
    2011
  • Haplotype Inference by Pure Parsimony: a Survey
    Ana Sofia Graça, Inês Lynce, Joao Marques Silva, Arlindo L. Oliveira
    Journal of Computational Biology vol. 17, n. 8, DOI 10.1089/cmb.2009.0101
    2010
  • Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
    Antonio Morgado, Joao Marques Silva
    Fundamenta Informaticae vol. 102, n. 3, DOI 10.3233/FI-2010-311
    2010
  • A Branch and Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Subformulas
    Mark Liffiton, Maher Mneimneh, Inês Lynce, Zaher Andraus, Joao Marques Silva, Karem A. Sakallah
    Constraints Journal vol. 14, n. 4, DOI 10.1007/s10601-008-9058-8
    2009
  • Haplotype Inference with Boolean Satisfiability
    Inês Lynce, Joao Marques Silva
    International Journal on Artificial Intelligence Tools vol. 17, n. 2,
    2008
  • Report on the SAT 2007 Conference on Theory and Applications of Satisfiability Testing
    Joao Marques Silva, Karem A. Sakallah, Inês Lynce
    AI Magazine vol. 28, n. 4,
    2007
  • Heuristic-Based Backtracking Relaxation for Propositional Satisfiability
    Ateet Bhalla, Inês Lynce, José T. de Sousa, Joao Marques Silva
    Journal of Automated Resoning vol. 35, n. 1,
    2005
  • Satisfiability-Based Algorithms for Boolean Optimization
    Vasco Manquinho, Joao Marques Silva
    Annals of Mathematics and Artificial Intelligence vol. 20, n. 2,
    2004
  • Solving Satisfiability in Combinational Circuits
    Joao Marques Silva, Luis Guerra e Silva
    IEEE Design and Test of Computers
    2003
  • Satisfiability Models and Algorithms for Circuit Delay Computation
    Luis Guerra e Silva, Joao Marques Silva, L. Miguel Silveira, Karem A. Sakallah
    ACM Transactions on Design Automation of Electronic Systems vol. 7, n. 1,
    2002
  • An exact solution to the minimum-size test pattern problem
    Paulo Flores, Horácio C. Neto, Joao Marques Silva
    ACM Transactions on Design Automation of Electronic Systems (TODAES) vol. 6, n. 4,
    2001
  • Efficient Algorithms For The Inference Of Minimum Size DFAs
    Arlindo L. Oliveira, Joao Marques Silva
    Machine Learning vol. 44, n. 1, DOI 10.1023/A:1010828029885
    2001
  • Ravel-XL: A Hardware Accelerator for Assigned-Delay Compiled-Code Logic Gate Simulation
    Michael A. Riepe, Joao Marques Silva, Karem A. Sakallah, Richard B. Brown
    IEEE Transactions on VLSI Systems vol. 4, n. 1,
    1996
  • MILP for the Multi-objective VM Reassignment Problem
    Takfarinas Saber, Anthony Ventresque, James Thorburn, Liam Murphy, Joao Marques Silva
    International Conferences on Tools with AI, IEEE, IEEE, Italy
    2015
  • Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing
    M. Fareed Arif, Carlos Mencia, Joao Marques Silva
    Theory and Applications of Satisfiability Testing, LNCS, Springer, Springer, Austin, TX, USA
    2015
  • SAT-Based Horn Least Upper Bounds
    Carlos Mencia, Alessandro Previti, Joao Marques Silva
    Theory and Applications of Satisfiability Testing, LNCS, Springer, Springer, Austin, TX, USA
    2015
  • Computing Maximal Autarkies with Few and Simple Oracle Queries
    Oliver Kullmann, Joao Marques Silva
    Theory and Applications of Satisfiability Testing, LNCS, Springer, Springer, Austin, TX, USA
    2015
  • SAT-Based Formula Simplification
    Alexey S. Ignatiev, Alessandro Previti, Joao Marques Silva
    Theory and Applications of Satisfiability Testing, LNCS, Springer, Springer, Austin, TX, USA
    2015
  • Efficient Axiom Pinpointing with EL2MCS
    M. Fareed Arif, Carlos Mencia, Joao Marques Silva
    Annual German Conference on AI, LNCS, Springer, Springer, Dresden, Germany
    2015
  • Smallest MUS Extraction with Minimal Hitting Set Dualization
    Alexey S. Ignatiev, Alessandro Previti, Joao Marques Silva
    Principles and Practice of Constraint Programming, LNCS, Springer, Springer, Cork, Ireland
    2015
  • Solving QBF by Clause Selection
    Mikolás Janota, Joao Marques Silva
    International Joint Conference on Artificial Intelligence, AAAI Press, AAAI Press, Buenos Aires, Argentina
    2015
  • Literal-Based MCS Extraction.
    Carlos Mencia, Alessandro Previti, Joao Marques Silva
    International Joint Conference on Artificial Intelligence, AAAI Press, AAAI Press, Buenos Aires, Argentina
    2015
  • Efficient Model Based Diagnosis with Maximum Satisfiability
    Joao Marques Silva, Mikolás Janota, Alexey S. Ignatiev, António José dos Reis Morgado
    International Joint Conference on Artificial Intelligence, AAAI Press, AAAI Press, Buenos Aires, Argentina
    2015
  • Prime Compilation of Non-Clausal Formulae
    Alessandro Previti, Alexey S. Ignatiev, António José dos Reis Morgado, Joao Marques Silva
    International Joint Conference on Artificial Intelligence, AAAI Press, AAAI Press, Buenos Aires, Argentina
    2015
  • Efficient Relaxations of Over-constrained CSPs
    Carlos Mencia, Joao Marques Silva
    International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Press, IEEE Press, Cyprus
    2014
  • Core-Guided MaxSAT with Soft Cardinality Constraints
    António José dos Reis Morgado, Carmine Dodaro, Joao Marques Silva
    Principles and Practice of Constraint Programming (CP), LNCS, Springer, Springer,
    2014
  • Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form
    Saïd Jabbour, Joao Marques Silva, Lakhdar Sais, Yakoub Salhi
    European Conference on Logics in Artificial Intelligence, LNCS, Springer, Springer,
    2014
  • Timeout-Sensitive Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems
    Yuri Malitsky, Barry O'Sullivan, Alessandro Previti, Joao Marques Silva
    European Conference on Logics in Artificial Intelligence (ECAI), IOS Press, IOS Press,
    2014
  • On Reducing Maximum Independent Set to Minimum Satisfiability
    Alexey S. Ignatiev, António José dos Reis Morgado, Joao Marques Silva
    Theory and Applications of Satisfiability Testing (SAT), LNCS, Springer, Springer, http://dx.doi.org/10.1007/978-3-319-09284-3_9
    2014
  • MUS Extraction Using Clausal Proofs
    Anton Belov, Marijn Heule, Joao Marques Silva
    Theory and Applications of Satisfiability Testing (SAT), LNCS, Springer, Springer, http://dx.doi.org/10.1007/978-3-319-09284-3_5
    2014
  • On Computing Preferred MUSes and MCSes
    Joao Marques Silva, Alessandro Previti
    Theory and Applications of Satisfiability Testing (SAT), LNCS, Springer, Springer, http://dx.doi.org/10.1007/978-3-319-09284-3_6
    2014
  • Towards efficient optimization in package management systems
    Alexey S. Ignatiev, Mikolás Janota, Joao Marques Silva
    International Conference on Software Engineering (ICSE), ACM, ACM, http://doi.acm.org/10.1145/2568225.2568306
    2014
  • Efficient Autarkies
    Joao Marques Silva, Alexey S. Ignatiev, António José dos Reis Morgado, Vasco Manquinho, Inês Lynce
    ECAI 2014 - 21st European Conference on Artificial Intelligence, IOS Press, vol. 263, IOS Press,
  • A Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems
    Yuri Malitsky, Barry O'Sullivan, Alessandro Previti, Joao Marques Silva
    Integration of AI and OR Techniques in Constraint Programming, LNCS, Springer, Springer, http://dx.doi.org/10.1007/978-3-319-07046-9_26
    2014
  • Progression in Maximum Satisfiability
    Alexey S. Ignatiev, António José dos Reis Morgado, Vasco Manquinho, Inês Lynce, Joao Marques Silva
    ECAI 2014 - 21st European Conference on Artificial Intelligence, IOS Press, vol. 263, IOS Press,
  • Synthesizing Safe Bit-Precise Invariants
    Arie Gurfinkel, Anton Belov, Joao Marques Silva
    Tools and Algorithms for the Construction and Analysis of Systems (TACAS), LNCS, Springer, Springer, http://dx.doi.org/10.1007/978-3-642-54862-8_7
    2014
  • On lazy and eager interactive reconfiguration
    Mikolás Janota, Goetz Botterweck, Joao Marques Silva
    Workshop on Variability Modelling of Software-intensive Systems (VaMoS), ACM, ACM, http://doi.acm.org/10.1145/2556624.2556644
    2014
  • On QBF Proofs and Preprocessing
    Mikolás Janota, Radu Grigore, Joao Marques Silva
    Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), LNCS, Springer, Springer, http://dx.doi.org/10.1007/978-3-642-45221-5_32
    2013
  • Maximal Falsifiability: Definitions, Algorithms, and Applications
    Alexey S. Ignatiev, António José dos Reis Morgado, Jordi Planes, Joao Marques Silva
    Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), LNCS, Springer, Springer, http://dx.doi.org/10.1007/978-3-642-45221-5_30
    2013
  • SAT-Based Preprocessing for MaxSAT
    Anton Belov, António José dos Reis Morgado, Joao Marques Silva
    Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), LNCS, Springer, Springer, http://dx.doi.org/10.1007/978-3-642-45221-5_7
    2013
  • Solving QBF with Free Variables
    William Klieber, Mikolás Janota, Joao Marques Silva, Edmund M. Clarke
    Principles and Practice of Constraint Programming (CP), LNCS, Springer, Springer, http://dx.doi.org/10.1007/978-3-642-40627-0_33
    2013
  • Model-Guided Approaches for MaxSAT Solving
    António José dos Reis Morgado, Federico Heras, Joao Marques Silva
    International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Press, IEEE Press,
    2013
  • On Computing Minimal Correction Subsets.
    Joao Marques Silva, Federico Heras, Mikolás Janota, Alessandro Previti, Anton Belov
    International Joint Conference on Artificial Intelligence (IJCAI), AAAI Press, AAAI Press, http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/pa
    2013
  • Quantified Maximum Satisfiability: A Core-Guided Approach
    Alexey S. Ignatiev, Mikolás Janota, Joao Marques Silva
    Theory and Applications of Satisfiability Testing (SAT), LNCS, Springer, Springer, http://dx.doi.org/10.1007/978-3-642-39071-5_19
    2013
  • Partial MUS Enumeration
    Alessandro Previti, Joao Marques Silva
    AAAI Conference on Artificial Intelligence (AAAI), AAAI Press, AAAI Press, http://www.aaai.org/ocs/index.php/AAAI/AAAI13/pape
    2013
  • Parallel MUS Extraction
    Anton Belov, Norbert Manthey, Joao Marques Silva
    Theory and Applications of Satisfiability Testing (SAT), LNCS, Springer, Springer, http://dx.doi.org/10.1007/978-3-642-39071-5_11
    2013
  • Minimal Sets over Monotone Predicates in Boolean Formulae
    Joao Marques Silva, Mikolás Janota, Anton Belov
    Computer-Aided Verification (CAV), LNCS, Springer, Springer, http://dx.doi.org/10.1007/978-3-642-39799-8_39
    2013
  • On Propositional QBF Expansions and Q-Resolution
    Mikolás Janota, Joao Marques Silva
    Theory and Applications of Satisfiability Testing (SAT), LNCS, Springer, Springer, http://dx.doi.org/10.1007/978-3-642-39071-5_7
    2013
  • Core minimization in SAT-based abstraction
    Anton Belov, Huan Chen, Alan Mishchenko, Joao Marques Silva
    Design, Automation and Test in Europe (DATE), ACM, ACM, http://dl.acm.org/citation.cfm?id=2485624
    2013
  • Formula Preprocessing in MUS Extraction
    Anton Belov, Matti Jarvisalo, Joao Marques Silva
    Tools and Algorithms for the Construction and Analysis of Systems (TACAS), LNCS, Springer, Springer, http://dx.doi.org/10.1007/978-3-642-36742-7_8
    2013
  • MaxSAT-Based MCS Enumeration
    Antonio Morgado, Mark H. Liffiton, Joao Marques Silva
    Haifa Verification Conference (HVC 2012), Springer, Springer,
  • Iterative SAT Solving for Minimum Satisfiability
    Federico Heras, Antonio Morgado, Jordi Planes, Joao Marques Silva
    International Conference on Tools with Artificial Intelligence (ICTAI 2012), IEEE, IEEE,
  • On Computing Minimal Equivalent Subformulas
    Anton Belov, Mikolás Janota, Inês Lynce, Joao Marques Silva
    International Conference on Principles and Practice of Constraint Programming, LNCS, Springer, Springer,
    2012
  • Experimental Analysis of Backbone Computation Algorithms
    Mikolás Janota, Inês Lynce, Joao Marques Silva
    RCRA International Workshop on Experimental Evaluation of Algorithms for solving problems with combinatorial explosion,
    2012
  • On Unit-Refutation Complete Formulae with Existentially Quantified Variables
    Lucas Bordeaux, Mikolás Janota, Joao Marques Silva, Pierre Marquis
    Principles of Knowledge Representation and Reasoning (KR 2012), AAAI, AAAI, http://www.aaai.org/ocs/index.php/KR/KR12/paper/vi
  • Solving QBF with Counterexample Guided Refinement
    Mikolás Janota, William Klieber, Joao Marques Silva, Edmund M. Clarke
    Theory and Applications of Satisfiability Testing (SAT 2012), Springer, Springer, http://dx.doi.org/10.1007/978-3-642-31612-8_10
  • On Efficient Computation of Variable MUSes
    Anton Belov, Alexander Ivrii, Arie Matsliah, Joao Marques Silva
    Theory and Applications of Satisfiability Testing (SAT 2012), Springer, Springer, http://dx.doi.org/10.1007/978-3-642-31612-8_23
  • An Empirical Study of Encodings for Group MaxSAT
    Federico Heras, Antonio Morgado, Joao Marques Silva
    Canadian Conference on Artificial Intelligence (AAI 2012), Springer, Springer, http://dx.doi.org/10.1007/978-3-642-30353-1_8
  • New & improved models for SAT-based bi-decomposition
    Huan Chen, Joao Marques Silva
    Great Lakes Symposium on VLSI (GLS VLSI 2012), ACM, ACM, http://doi.acm.org/10.1145/2206781.2206817
  • QBF-based boolean function bi-decomposition
    Huan Chen, Mikolás Janota, Joao Marques Silva
    Design, Automation & Test in Europe Conference & Exhibition (DATE 2012), IEEE, IEEE, http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arn
  • Knowledge Compilation with Empowerment
    Lucas Bordeaux, Joao Marques Silva
    Current Trends in Theory and Practice of Computer Science (SOFSEM 2012), Springer, Springer, http://dx.doi.org/10.1007/978-3-642-27660-6_50
  • Lower Bounds and Upper Bounds for MaxSAT
    Federico Heras, Antonio Morgado, Joao Marques Silva
    Learning and Intelligent Optimization (LION 2012), Springer, Springer, http://dx.doi.org/10.1007/978-3-642-34413-8_35
  • On Validating Boolean Optimizers
    Antonio Morgado, Joao Marques Silva
    International Conference on Tools with Artificial Intelligence (ICTAI 2011), IEEE, IEEE, http://doi.ieeecomputersociety.org/10.1109/ICTAI.2
  • Improvements to satisfiability-based boolean function bi-decomposition
    Huan Chen, Joao Marques Silva
    International Conference on VLSI and System-on-Chip (VLSI SoC 2011), IEEE, IEEE, http://dx.doi.org/10.1109/VLSISoC.2011.6081636
  • On Deciding MUS Membership with QBF
    Mikolás Janota, Joao Marques Silva
    Principles and Practice of Constraint Programming (CP 2011), LNCS, Springer, Springer, Perugia, Italy
  • Accelerating MUS extraction with recursive model rotation
    Anton Belov, Joao Marques Silva
    Formal Methods in Computer-Aided Design (FMCAD 2011), ACM, ACM, http://dl.acm.org/citation.cfm?id=2157663
  • Read-Once Resolution for Unsatisfiability-Based Max-SAT Algorithms
    Federico Heras, Joao Marques Silva
    International Joint Conference on Artificial Intelligence (IJCAI 2011), AAAI, AAAI, http://ijcai.org/papers11/Papers/IJCAI11-103.pdf
  • On Improving MUS Extraction Algorithms
    Joao Marques Silva, Inês Lynce
    Theory and Applications of Satisfiability Testing (SAT 2011), LNCS, Springer, Springer, Ann Arbor, MI, USA
  • Empirical Study of the Anatomy of Modern Sat Solvers
    Hadi Katebi, Karem A. Sakallah, Joao Marques Silva
    Theory and Applications of Satisfiability Testing (SAT 2011), Springer, Springer, http://dx.doi.org/10.1007/978-3-642-21581-0_27
  • Minimally Unsatisfiable Boolean Circuits
    Anton Belov, Joao Marques Silva
    Theory and Applications of Satisfiability Testing (SAT 2011), Springer, Springer, http://dx.doi.org/10.1007/978-3-642-21581-0_13
  • Abstraction-Based Algorithm for 2QBF
    Mikolás Janota, Joao Marques Silva
    Theory and Applications of Satisfiability Testing (SAT 2011), LNCS, Springer, Springer, Ann Arbor, MI, USA
  • cmMUS: A Tool for Circumscription-Based MUS Membership Testing
    Mikolás Janota, Joao Marques Silva
    Logic Programming and Nonmonotonic Reasoning (LPNMR 2011), LNCS, Springer, Springer, Vancouver, Canada
  • Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription
    Mikolás Janota, Radu Grigore, Joao Marques Silva
    12th European Conference on Logics in Artificial Intelligence (JELIA10), LNAI 6341, Springer, Springer,
    2010
  • Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree Information
    Ana Sofia Graça, Inês Lynce, Joao Marques Silva, Arlindo L. Oliveira
    Algebraic and Numeric Biology (ANB10),
    2010
  • On Computing Backbones of Propositional Theories
    Joao Marques Silva, Mikolás Janota, Inês Lynce
    9th European Conference on Artificial Intelligence (ECAI10), IOS Press, IOS Press,
    2010
  • Solving Linux Upgradeability Problems Using Boolean Optimization
    Josep Argelich, Daniel Le Berre, Inês Lynce, Joao Marques Silva, Pascal Rapicault
    First International Workshop on Logics for Component Configuration (LoCoCo), EPTCS 29,
    2010
  • Boolean Lexicographic Optimization
    Joao Marques Silva, Josep Argelich, Ana Sofia Graça, Inês Lynce
    7th RCRA International Workshop on Experimental evaluation of algorithms for solving problems with combinatorial explosion (RCRA10),
    2010
  • Restoring CSP Satisfiability with MaxSAT
    Inês Lynce, Joao Marques Silva
    Portuguese Conference on Artificial Inteligence (EPIA),
    2009
  • Haplotype Inference Combining Pedigrees and Unrelated Individuals
    Ana Sofia Graça, Inês Lynce, Joao Marques Silva, Arlindo L. Oliveira
    CP Workshop on Constraint Based Methods for Bioinformatics (WCB),
    2009
  • Algorithms for Weighted Boolean Optimization
    Vasco Manquinho, Joao Marques Silva, Jordi Planes
    International Conference on Theory and Applications of Satisfiability Testing (SAT),
    2009
  • Symmetry Breaking for Maximum Satisfiability
    Joao Marques Silva, Inês Lynce, Vasco Manquinho
    International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 08), LNAI, Springer, Springer,
    2008
  • Haplotype Inference with Boolean Constraint Solving: an Overview
    Inês Lynce, Ana Sofia Graça, Joao Marques Silva, Arlindo L. Oliveira
    20th IEEE International Conference on Tools with Artificial Intelligence, IEEE, IEEE,
    2008
  • Generic ILP vs Specialized 0-1 ILP for Haplotype Inference
    Ana Sofia Graça, Inês Lynce, Joao Marques Silva, Arlindo L. Oliveira
    Workshop on Constraint Based Methods for Bioinformatics,
    2008
  • On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization
    Federico Heras, Vasco Manquinho, Joao Marques Silva
    AAAI Conference of the Florida Artificial Intelligence Research Society (FLAIRS),
    2008
  • Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
    Joao Marques Silva, Vasco Manquinho
    International Conference on Theory and Applications of Satisfiability Testing (SAT),
    2008
  • Efficient Haplotype Inference with Combined CP and OR Techniques
    Ana Sofia Graça, Joao Marques Silva, Inês Lynce, Arlindo L. Oliveira
    Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, LNCS, Springer, vol. 5015, Springer,
    2008
  • Efficient and Tight Upper Bounds for Haplotype Inference by Pure Parsimony
    Joao Marques Silva, Inês Lynce, Ana Sofia Graça, Arlindo L. Oliveira
    13th Portuguese Conference on Aritficial Intelligence (EPIA 07), LNAI, Springer, vol. 4874, Springer,
    2007
  • Towards Robust CNF Encodings of Cardinality Constraints
    Joao Marques Silva, Inês Lynce
    International Conference on Principles and Practice of Constraint Programming, LNCS, Springer, Springer, Providence, RI
    2007
  • Efficient Haplotype Inference with Pseudo-Boolean Optimization
    Ana Sofia Graça, Joao Marques Silva, Inês Lynce, Arlindo L. Oliveira
    Algebraic Biology, LNCS, Springer, vol. 4545, Springer,
    2007
  • Breaking Symmetries in SAT Matrix Models
    Inês Lynce, Joao Marques Silva
    10th International Conference on Theory and Applications of Satisfiability Testing, Springer, Springer,
    2007
  • Counting Models in Integer Domains
    António José dos Reis Morgado, Paulo Jorge de Oliveira Cantante de Matos, Vasco Manquinho, Joao Marques Silva
    International Conference on Theory and Applications of Satisfiability Testing, LNCS, Springer, Springer,
    2006
  • Categorisation of clauses in conjunctive normal forms: Minimally unsatisfiable sub-clause-sets and the lean kernel
    Oliver Kullmann, Inês Lynce, Joao Marques Silva
    9th International Conference on Theory and Applications of Satisfiability Testing, Lecture Notes in Computer Science, Springer, Springer, Seattle
    2006
  • SAT in Bioinformatics: Making the Case with Haplotype Inference
    Inês Lynce, Joao Marques Silva
    9th International Conference on Theory and Applications of Satisfiability Testing, Lecture Notes in Computer Science, Springer, Springer, Seattle
    2006
  • Efficient Haplotype Inference with Boolean Satisfiability
    Inês Lynce, Joao Marques Silva
    Twenty-First National Conference on Artificial Intelligence, AAAI Press, AAAI Press, Boston
    2006
  • Good Learning and Implicit Model Enumeration
    António José dos Reis Morgado, Joao Marques Silva
    International Conference on Tools with Artificial Intelligence, IEEE, IEEE,
    2005
  • Improvements to the Implementation of Interpolant-Based Model Checking
    Joao Marques Silva
    Correct Hardware Design and Verification Methods, LNCS 3725, Springer Verlag, Springer Verlag, Saarbrucken, Germany
    2005
  • A Branch and Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
    Maher Mneimneh, Inês Lynce, Zaher Andraus, Joao Marques Silva, Karem A. Sakallah
    8th International Conference on Theory and Applications of Satisfiability Testing, LNCS, Springer Verlag, vol. 3569, Springer Verlag, St. Andrews
    2005
  • On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization
    Vasco Manquinho, Joao Marques Silva
    8th International Conference on Theory and Applications of Satisfiability Testing, LNCS 3569, Springer Verlag, Springer Verlag, St Andrews
    2005
  • Effective Lower Bounding Techniques for Pseudo-Boolean Optimization
    Vasco Manquinho, Joao Marques Silva
    Design Automation and Test in Europe (DATE), ACM, ACM, Munich, Germany
    2005
  • Hidden Structure in Unsatisfiable Random 3-SAT: an Empirical Study
    Inês Lynce, Joao Marques Silva
    16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI-04), IEEE Computer Society, IEEE Computer Society,
    2004
  • Integration of Lower Bound Estimates in Pseudo-Boolean Optimization
    Vasco Manquinho, Joao Marques Silva
    16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04), IEEE Computer Society, IEEE Computer Society,
    2004
  • Using Rewarding Mechanisms for Improving Branching Heuristics
    Elsa Cristina Batista Bento Carvalho, Joao Marques Silva
    7th International Conference on Theory and Applications of Satisfiability Testing (SAT'04), Vancouver
    2004
  • On Computing Minimum Unsatisfiable Cores
    Inês Lynce, Joao Marques Silva
    7th International Conference on Theory and Applications of Satisfiability Testing (SAT'04), Vancouver
    2004
  • Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization
    Vasco Manquinho, Joao Marques Silva
    7th International Conference on Theory and Applications of Satisfiability Testing (SAT'04), Vancouver
    2004
  • The CQuest SAT Solver
    Inês Lynce, Joao Marques Silva
    7th International Conference on Theory and Applications of Satisfiability Testing (SAT'04), Vancouver
    2004
  • Heuristic-Based Backtracking for Propositional Satisfiability
    Ateet Bhalla, Inês Lynce, José T. de Sousa, Joao Marques Silva
    11th Portuguese Conference on Artificial Intelligence (EPIA'03),
    2003
  • Heuristic-Based Backtracking for Propositional Satisfiability
    Ateet Bhalla, Inês Lynce, José T. de Sousa, Joao Marques Silva
    11th Portuguese Conference on Artificial Intelligence (EPIA'03), LNAI, Springer, vol. 2902, Springer, Beja, Portugal
    2003
  • Probing-Based Preprocessing Techniques for Propositional Satisfiability
    Inês Lynce, Joao Marques Silva
    15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI-03), IEEE Computer Society, IEEE Computer Society, Sacramento, California, USA
    2003
  • Propositional Satisfiability Algorithms based on Inference of Constraints
    Inês Lynce, Joao Marques Silva
    Eighth International Joint Conference on Artificial Intelligence, Doctoral Consortium,
    2003
  • Heuristic Backtracking Algorithms for SAT
    Ateet Bhalla, Inês Lynce, José T. de Sousa, Joao Marques Silva
    Proceedings IEEE 4th International Workshop on Microprocessor Test and Verification (MTV),
    2003
  • OpenSAT: An Open Source SAT Software Project
    Gilles Audemard, Daniel Le Berre, Olivier Roussel, Inês Lynce, Joao Marques Silva
    Sixth International Conference on Theory and Applications of Satisfiability Testing,
    2003
  • Heuristic Backtracking Algorithms for SAT
    Ateet Bhalla, Inês Lynce, José T. de Sousa, Joao Marques Silva
    4th International Workshop on Microprocessor Test and Verification (MTV'03), IEEE Computer Society, IEEE Computer Society, Austin, Texas, USA
    2003
  • On Implementing More Efficient SAT Data Structures
    Inês Lynce, Joao Marques Silva
    Sixth International Conference on Theory and Applications of Satisfiability Testing,
    2003
  • The Effect of Nogood Recording in DPLL-CBJ SAT Algorithms
    Inês Lynce, Joao Marques Silva
    Recent Advances in Constraints, LNAI, LNAI,
    2003
  • Building State-of-the-Art SAT solvers
    Inês Lynce, Joao Marques Silva
    European Conference on Artificial Intelligence,
    2002
  • The Effect of Nogood Recording in MAC-CBJ SAT Algorithms
    Inês Lynce, Joao Marques Silva
    ERCIM Workshop on Constraint Solving and Constraint Logic Programming,
    2002
  • Complete unrestricted backtracking algorithms for Satisfiability
    Inês Lynce, Joao Marques Silva
    Fifth International Symposium on the Theory and Applications of Satisfiability Testing,
    2002
  • Comparing SAT preprocessing techniques
    L. Drake, A. Frisch, Inês Lynce, Joao Marques Silva, T. Walsh
    Ninth Workshop on Automated Reasoning,
    2002
  • The puzzling role of simplification in propositional satisfiability
    Inês Lynce, Joao Marques Silva
    In Workshop on Constraint Satisfaction and Operational Research Techniques for Problem Solving,
    2001
  • Unrestricted backtracking algorithms for satisfiability
    Inês Lynce, Luís Manuel Tremoceiro Baptista, Joao Marques Silva
    AAAI Fall Symposium Using Uncertainty within Computation,
    2001
  • Integrating simplification techniques in SAT algorithms
    Inês Lynce, Joao Marques Silva
    In Logic in Computer Science (Short Paper Session),
    2001
  • A Configurable Hardware/Software Approach to SAT Solving
    José T. de Sousa, Joao Marques Silva, Miron Abramovici
    IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'01),
    2001
  • Lower bounding techniques for SAT-based boolean optimization
    Vasco Manquinho, Joao Marques Silva
    In Third International Workshop on Integration of AI and OR Techniques,
    2001
  • Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability
    Luís Manuel Tremoceiro Baptista, Joao Marques Silva
    6th International Conference on Principles and Practice of Constraint Programming (CP),
    2000
  • Algebraic Simplification Techniques for Propositional Satisfiability
    Joao Marques Silva
    6th International Conference on Principles and Practice of Constraint Programming (CP),
    2000
  • On Selecting Problem Instances for Evaluating Satisfiability Algorithms
    Joao Marques Silva
    in ECAI Workshop on Empirical Methods in Artificial Intelligence (ECAI-EMAI),
    2000
  • Conditions for Non-Chronological Backtracking in Boolean Optimization
    Vasco Manquinho, Joao Marques Silva
    AAAI Workshop on Integration of AI and OR Techniques for Combinatorial Optimization (AAAI-AIOR),
    2000
  • The Interplay of Randomization and Learning on Real-World Instances of Satisfiability
    Luís Manuel Tremoceiro Baptista, Joao Marques Silva
    AAAI Workshop on Leveraging Probability and Uncertainty in Computation (AAAI-LPUC),
    2000
  • Boolean Satisfiability in Electronic Design Automation
    Joao Marques Silva, Karem A. Sakallah
    IEEE/ACM Design Automation Conference (DAC),
    2000
  • On Using Satisfiability-Based Pruning Techniques in Covering Algorithms
    Vasco Manquinho, Joao Marques Silva
    IEEE/ACM Design, Automation and Test in Europe Conference (DATE),
    2000
  • On Applying Incremental Satisfiability to Delay Fault Testing
    Joonyoung Kim, Jesse Whittemore, Joao Marques Silva, Karem A. Sakallah
    IEEE/ACM Design, Automation and Test in Europe Conference (DATE),
    2000
  • On Solving Boolean Optimization with Satisfiability-Based Algorithms
    Vasco Manquinho, Joao Marques Silva
    Sixth International Symposium on Artificial Intelligence and Mathematics,
    2000
  • Test Pattern Generation for Width Compression in BIST
    Paulo Flores, Horácio C. Neto, Krishnendu Chakrabarty, Joao Marques Silva
    IEEE International Symposium on Circuits and Systems (ISCAS),
    1999
  • On Applying Set Covering Models to Test Set Compaction
    Paulo Flores, Horácio C. Neto, Joao Marques Silva
    IEEE Great Lakes Symposium on VLSI (GLS),
    1999
  • Assignment and Reordering of Incompletely Specified Pattern Sequences Targetting Minimum Power Dissipation
    Paulo Flores, José Carlos Campos Costa, Horácio C. Neto, José Monteiro, Joao Marques Silva
    IEEE/ACM International Conference on VLSI Design (VLSI), Goa, India
    1999
  • An Exact Solution to the Minimum-Size Test Pattern Problem
    Paulo Flores, Horácio C. Neto, Joao Marques Silva
    IEEE International Conference on Computer Design (ICCD), Austin, Texas, USA
    1998
  • Models and algorithms for computing minimum size prime implicants
    Vasco Manquinho, Arlindo L. Oliveira, Joao Marques Silva
    International Workshop on Boolean Problems, Freiberg, Germany
    1998
  • An Exact Solution to the Minimum-Size Test Pattern Problem
    Paulo Flores, Horácio C. Neto, Joao Marques Silva
    IEEE/ACM International Workshop on Logic Synthesis (IWLS,
    1998
  • Satisfiability-based algorithms for 0-1 integer programming
    Vasco Manquinho, Joao Marques Silva, Arlindo L. Oliveira, Karem A. Sakallah
    International Workshop on Logic Synthesis, Lake Tahoe, CA
    1998
  • A Model and Algorithm for Computing Minimum-Size Test Patterns
    Paulo Flores, Horácio C. Neto, Krishnendu Chakrabarty, Joao Marques Silva
    IEEE European Test Workshop (ETW),
    1998
  • Exploiting Don't Cares in Test Patterns to Reduce Power During BIST
    José Carlos Campos Costa, Paulo Flores, Horácio C. Neto, José Monteiro, Joao Marques Silva
    IEEE European Test Workshop,
    1998
  • Prime implicant computation using satisfiability algorithms
    Vasco Manquinho, Paulo Flores, Joao Marques Silva, Arlindo L. Oliveira
    9th IEEE International Conference on Tools with Artificial Intelligence, IEEE, IEEE, Monterey, CA
    1997
  • Testability Analysis of Circuits using Data-Dependent Power Management
    José Monteiro, Joao Marques Silva
    IX IFIP International Conference on Very Large Scale Integration,
    1997
  • Improving satisfiability algorithms with dominance and partioning
    Joao Marques Silva, Arlindo L. Oliveira
    International Workshop on Logic Synthesis, Lake Tahoe, CA
    1997
  • Test Pattern Generation for Circuits Using Power Management Techniques
    Joao Marques Silva, José Monteiro, Karem A. Sakallah
    IEEE European Test Workshop,
    1997
  • MSCG: Robust Core-Guided MaxSAT Solving (Extended System Description)
    António José dos Reis Morgado, Alexey S. Ignatiev, Joao Marques Silva
    n.18
    2015
  • Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription
    Mikolás Janota, Radu Grigore, Joao Marques Silva
    n.32
    2010
  • Practical Applications of Boolean-Based Optimization: A Bibliography
    Joao Marques Silva
    n.58
    2009
  • Symmetry Breaking for Maximum Satisfiability
    Joao Marques Silva, Inês Lynce, Vasco Manquinho
    n.39
    2008
  • Efficient and tight upper bounds for haplotype inference
    Joao Marques Silva, Inês Lynce, Ana Sofia Graça, Arlindo L. Oliveira
    n.16
    2006
  • Improved Lower Bounds for SAT-Based Haplotype Inference
    Joao Marques Silva, Inês Lynce, Arlindo L. Oliveira
    n.17
    2006
  • Assessing the efficacy of haplotype inference by pure parsimony on biological data
    Inês Lynce, Joao Marques Silva, Arlindo L. Oliveira
    n.12
    2006
  • Efficient Haplotype Inference with Boolean Satisfiability
    Inês Lynce, Joao Marques Silva
    n.2
    2006
  • Algorithms for Propositional Model Enumeration and Counting
    António José dos Reis Morgado, Joao Marques Silva
    n.39
    2005
  • On Computing Minimum Unsatisfiable Cores
    Inês Lynce, Joao Marques Silva
    n.30
    2004
  • The CQuest SAT Solver
    Inês Lynce, Joao Marques Silva
    n.23
    2004
  • On Computing Minimum Unsatisfiable Cores
    Inês Lynce, Joao Marques Silva
    n.48
    2003
  • Probing-Based Formula Manipulation Techniques for SAT
    Inês Lynce, Joao Marques Silva
    n.2
    2003
  • Building State-of-the-Art SAT Solvers - Technical Report RT/02/2002
    Inês Lynce, Joao Marques Silva
    n.26
    2002
  • Introdução aos Problemas NP-Completos - Technical Report RT/03/2002
    Joao Marques Silva
    n.25
    2002
  • The Effect of Nogood Recording in MAC-CBJ SAT Algorithms - Technical Report RT/04/2002
    Inês Lynce, Joao Marques Silva
    n.24
    2002
  • Hypothetical Reasoning in Propositional Satisfiability
    Inês Lynce, Joao Marques Silva
    n.37
    2002
  • Pattern-Based Simplification Techniques for Satisfiability
    Inês Lynce, Joao Marques Silva
    n.2
    2001
  • Efficient Data Structures for fast SAT Solvers
    Inês Lynce, Joao Marques Silva
    n.1
    2001
  • On Computing Minimum Size Test Patterns
    Paulo Flores, Horácio C. Neto, Joao Marques Silva
    n.8
    2000
  • Método e Sistema para a Inferência de Haplotipos por Parcimónia Pura usando Satisfação Proposicional
    Joao Marques Silva, Arlindo L. Oliveira, Inês Lynce
    2006

Keywords

Year Published

1996 - 2015

Type

All [off | on]
(7)
Chapter
(35)
Journal Paper
(143)
Conference Paper
(23)
Technical Report
(1)
Patent

Ranking

All [off | on]
(1)
Q3 / B
(174)
Other

Scope

All [off | on]
(175)
International
(31)
Nacional