Wasmati: An Efficient Static Vulnerability Scanner for WebAssembly Tiago Brito, Pedro Lopes, Nuno Santos, José Fragoso Santos, Computers & Security, pages 102745, DOI https://doi.org/10.1016/j.cose.2022.102745, December 2022
Introducing UniCorT: A University Course Timetabling Tool Alexandre Lemos, Pedro T. Monteiro, Inês Lynce, Journal of Scheduling, DOI 10.1007/s10951-021-00695-6, December 2022
Route choice estimation in rail transit systems using smart card data: handling vehicle schedule and walking time uncertainties Thomas Tiam-Lee, Rui Miguel Carrasqueiro Henriques, European Transport and Research Review (ETRR), June 2022
Constraint-based Electoral Districting Using a New Compactness Measure: an application to Portugal Tiago Miguel Correia de Almeida, Vasco Manquinho, Computers and Operations Research, May 2022
Boolean function metrics can assist modelers to check and choose logical rules John Zobolas, Pedro T. Monteiro, Martin Kuiper, Asmund Flobak, Journal of Theoretical Biology, vol. 538, pages 111025, DOI 10.1016/j.jtbi.2022.111025, April 2022
Exact Hypervolume Subset Selection Through Incremental Computations Andreia Guerreiro, Vasco Manquinho, José Rui Figueira, Computers & Operations Research, vol. 136, pages 15, DOI https://doi.org/10.1016/j.cor.2021.105471, December 2021
Prediction and Boolean logical modelling of synergistic microRNA regulatory networks during reprogramming of male germline pluripotent stem cells Praveen Kumar Guttula, Pedro T. Monteiro, Mukesh Kumar Guptaa, Biosystems, vol. 207, DOI 10.1016/j.biosystems.2021.104453, September 2021
The Hypervolume Indicator: Computational Problems and Algorithms Andreia Guerreiro, Carlos M. Fonseca, Luís Paquete, Computing Surveys, vol. 54, n. 6, pages 42, DOI https://doi.org/10.1145/3453474, July 2021
Automated narrative planning model extension Julie Porteous, João F. Ferreira, Alan Lindsay, Marc Cavazza, Autonomous Agents and Multi-Agent Systems, vol. 35, n. 19, pages 1-29, DOI https://doi.org/10.1007/s10458-021-09501-1, May 2021
Disruptions in Timetables: A Case Study at Universidade de Lisboa Alexandre Lemos, Pedro T. Monteiro, Inês Lynce, Journal of Scheduling, vol. 24, n. 1, pages 35-48, February 2021
A Game AI Competition to foster Collaborative AI research and development Ana Salta, Rui Prada, Francisco S. Melo, IEEE Transactions on Games, vol. 13, n. 4, pages 398-409, DOI 10.1109/TG.2020.3024160, September 2020
A Boolean Logical model for Reprogramming of Testes-derived male Germline Stem Cells into Germline pluripotent stem cells Praveen Kumar Guttula, Pedro T. Monteiro, Mukesh Kumar Gupta, Computer Methods and Programs in Biomedicine, vol. 192, DOI 10.1016/j.cmpb.2020.105473, March 2020
Revision of Boolean models of regulatory networks using stable state observations Filipe Gouveia, Inês Lynce, Pedro T. Monteiro, Journal of Computational Biology, vol. 27, n. 2, pages 144-155, DOI 10.1089/cmb.2019.0289, February 2020
Impact of Changing Cell-Cell Communication Network in Models of Epithelial Pattern Formation Pedro Varela, Pedro T. Monteiro, Claudine Chaouiya, IFAC-PapersOnLine, vol. 52, n. 26, pages 38-44, DOI 10.1016/j.ifacol.2019.12.233, October 2019
Virtual machine consolidation using constraint-based multi-objective optimization Miguel Neves, Inês Lynce, Vasco Manquinho, Journal of Heuristics, vol. 25, n. 3, pages 339-375, DOI 10.1007/s10732-018-9400-2, June 2019
Room Usage Optimization in Timetabling: A Case Study at Universidade de Lisboa Alexandre Lemos, Francisco S. Melo, Pedro T. Monteiro, Inês Lynce, Operations Research Perspectives, vol. 6, pages 100092, DOI 10.1016/j.orp.2018.100092, May 2019
On Logical Bifurcation Diagrams Wassim Abou-Jaoudé, Pedro T. Monteiro, Journal of Theoretical Biology, vol. 466, pages 39-63, DOI 10.1016/j.jtbi.2019.01.008, April 2019
Repairing Boolean logical models from time-series data using Answer Set Programming Alexandre Lemos, Inês Lynce, Pedro T. Monteiro, Algorithms for Molecular Biology , vol. 14, pages 9, DOI 10.1186/s13015-019-0145-8, March 2019
On the Query Complexity of Selecting Minimal Sets for Monotone Predicates Mikolas Janota, Joao Marques-Silva, , vol. 233, pages 73-83, DOI 10.1016/j.artint.2016.01.002, April 2016
Improving linear search algorithms with model-based approaches for MaxSAT solving Ruben Carlos Gonçalves Martins, Vasco Manquinho, Inês Lynce, Journal of Experimental and Theoretical Artificial Intelligence, vol. 27, n. 5, pages 673-701, DOI 10.1080/0952813X.2014.993508, November 2015
Algorithms for computing backbones of propositional formulae Mikolas Janota, Inês Lynce, Joao Marques Silva, AI Communications, vol. 28, n. 2, pages 161-177, DOI 10.3233/AIC-140640, February 2015
Algorithms for computing minimal equivalent subformulas Anton Belov, Mikolas Janota, Inês Lynce, Joao Marques Silva, Artificial Intelligence, vol. 216, n. 0, pages 309-326, DOI 10.1016/j.artint.2014.07.011, November 2014
An ontology-based approach to conflict resolution in Home and Building Automation Systems Rui Camacho, Paulo Jorge Fernandes Carreira, Inês Lynce, Sílvia Resendes, Expert Systems with Applications, vol. 41, n. 14, pages 6161-6173, DOI http://dx.doi.org/10.1016/j.eswa.2014.04.017, October 2014
Inferring phylogenetic trees using pseudo-Boolean optimization Miguel Miranda, Inês Lynce, Vasco Manquinho, AI Communications, vol. 27, n. 3, pages 229-243, DOI 10.3233/AIC-140592, September 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, pages 1943 - 1956 , DOI 10.1109/TCAD.2013.2275254, December 2013
On the analysis of compensation correctness Cátia Vaz, C. Ferreira, Journal of Logic and Algebraic Programming, vol. 81, n. 5, pages 585-605, December 2012
MUSer2: An Efficient MUS Extractor Anton Belov, Joao Marques Silva, Journal on Satisfiability, Boolean Modeling and Computation, vol. 8, n. 1, pages 123-128, December 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, December 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, pages 957-974, DOI 10.1109/TSE.2011.59, July 2012
Towards Efficient MUS Extraction Anton Belov, Inês Lynce, Joao Marques Silva, AI Communications, vol. 25, n. 2, pages 97-116, DOI http://dx.doi.org/10.3233/AIC-2012-0523, June 2012
TG-Pro: A SAT-based ATPG System Huan Chen, Joao Marques Silva, Journal on Satisfiability, Boolean Modeling and Computation, vol. 8, n. 1, pages 83-88, January 2012
Efficient Encodings from CSP into SAT, and from MaxCSP into MaxSAT Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà, Journal of Multiple-Valued Logic and Soft Computing, vol. 19, n. 1, pages 3-23, January 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, pages 163-183, January 2012
Anatomy and Empirical Evaluation of Modern SAT Solvers. Karem A. Sakallah, Joao Marques Silva, Bulletin of the EATCS, vol. 103, n. 2, pages 96-121, February 2011
Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes João Delgado, Inês Lynce, Vasco Manquinho, Journal of Computational Biology, vol. 17, n. 9, pages 1243-1265, DOI 10.1089/cmb.2010.0098, September 2010
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem Antonio Morgado, Joao Marques Silva, Fundamenta Informaticae, vol. 102, n. 3, pages 363-389, DOI 10.3233/FI-2010-311, March 2010
Haplotype Inference with Boolean Satisfiability Inês Lynce, Joao Marques Silva, International Journal on Artificial Intelligence Tools, vol. 17, n. 2, pages 355-387, April 2008
Report on the SAT 2007 Conference on Theory and Applications of Satisfiability Testing Joao Marques Silva, Karem Sakallah, Inês Lynce, AI Magazine, vol. 28, n. 4, pages 135-136, December 2007
Random Backtracking in Backtrack Search Algorithms for Satisfiability Inês Lynce, Joao Marques Silva, Discrete Applied Mathematics, vol. 155, n. 12, pages 1604-1612, June 2007
Propositional Satisfiability: Techniques, Algorithms and Applications Inês Lynce, AI Communications, vol. 19, n. 2, pages 187-189, June 2006
On Using Cutting Planes in Pseudo-Boolean Optimization Vasco Manquinho, João Marques-Silva, Journal on Satisfiability, Boolean Modeling and Computation, vol. 2, pages 209-219, March 2006
Efficient data structures for backtrack search SAT solvers Inês Lynce, Joao Marques Silva, Annals of Mathematics and Artificial Intelligence, vol. 43, n. 1, pages 137-152, January 2005
Satisfiability-Based Algorithms for Boolean Optimization Vasco Manquinho, Joao Marques Silva, Annals of Mathematics and Artificial Intelligence, vol. 20, n. 2, pages 353-372, March 2004
An Overview of Backtrack Search Satisfiability Algorithms Inês Lynce, Joao Marques Silva, Annals of Mathematics and Artificial Intelligence, vol. 37, n. 3, pages 307-326, March 2003
Search Pruning Techniques in SAT-Based Branch-and-Bound Algorithms for the Binate Covering Problem Vasco Manquinho, Joao Marques Silva, IEEE Transactions on Computer-Aided Design, vol. 21, n. 5, pages 505-516, May 2002
GRASP: A Search Algorithm for Propositional Satisfiability Joao Marques Silva, Karem A. Sakallah, IEEE Transactions on Computers, vol. 48, n. 5, pages 506-521, May 1999
Are security commit messages informative? Not enough! Sofia Oliveira Reis, Rui Abreu, Corina Pasareanu, International Conference on Evaluation and Assessment in Software Engineering, December 2023
UpMax: User partitioning for MaxSAT Pedro Orvalho, Vasco Manquinho, Ruben Martins, International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 2023
Community structure in transcriptional regulatory networks of yeast species Fábio Cruz, Pedro T. Monteiro, Andreia Sofia Teixeira, International Conference on Complex Networks (CompleNet), April 2023
New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization Joao Cortes, Inês Lynce, Vasco Manquinho, Tools and Algorithms for Construction and Analysis of Systems (TACAS), April 2023
Extending EcoAndroid with Automated Detection of Resource Leaks Ricardo Pereira, João F. Ferreira, Alexandra Mendes, Rui Abreu, 9th IEEE/ACM International Conference on Mobile Software Engineering and Systems 2022, December 2022
MultIPAs : Applying Program Transformations to Introductory Programming Assignments for Data Augmentation Pedro Orvalho, Mikolas Janota, Vasco Manquinho, 30th Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) (ESEC/FSE 2022), November 2022
TestSelector: Automatic Test Suite Selection for Student Projects Filipe Marques, António Morgado, José Fragoso Santos, Mikolas Janota, Runtime Verification, Lecture Notes in Computer Science, Springer, vol. 13498, pages 283--292, Springer, Tbilisi, Georgia, September 2022
Automatic Generation of Neural Architecture Search Spaces David António Cóias Calhas, Vasco Manquinho, Inês Lynce, AAAI-2022 Workshop on Combining Learning and Reasoning: Programming Languages, Formalisms, and Representations (CLeaR), February 2022
Functional characterization of transcriptional regulatory networks of yeast species Paulo Dias, Pedro T. Monteiro, Andreia Sofia Teixeira, International School and Conference on Network Science (NetSciX'22), LNCS, vol. 13197, February 2022
Supervised Learning for Test Suit Selection in Continuous Integration Ricardo Martins, Rui Abreu, Manuel Lopes, João Nadkarni, 2021 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW), December 2021
Automatic Repair of Java Code with Timing Side-Channel Vulnerabilities Rui Lima, João F. Ferreira, Alexandra Mendes, International Workshop on Refactoring (IWoR 21), November 2021
Where are the Passengers? Individual Passenger Route Choice Estimation from Gate Information in Urban Rail Transit Systems Thomas Tiam-Lee, Rui Miguel Carrasqueiro Henriques, European Transport Conference (ETC), September 2021
Minimal Perturbation in University Timetabling with Maximum Satisfiability Alexandre Lemos, Pedro T. Monteiro, Inês Lynce, 17th Intl. Conf. on Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR'20), LNCS, vol. 12296, pages 1-17, September 2020
ModRev - Model Revision tool for Boolean logical models of biological regulatory networks Filipe Gouveia, Inês Lynce, Pedro T. Monteiro, 18th Intl. Conf. on Computational Methods in Systems Biology (CMSB'20), LNBI, vol. 12314, pages 1-10, September 2020
ITC 2019: University Course Timetabling with MaxSAT Alexandre Lemos, Pedro T. Monteiro, Inês Lynce, Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2021:, vol. 1, pages 105-128, August 2020
SAT-Based Encodings for Optimal Decision Trees with Explicit Paths. Mikolas Janota, António José dos Reis Morgado, Theory and Applications of Satisfiability Testing - {SAT} 2020, Lecture Notes in Computer Science, Springer, vol. 12178, pages 501--518, Springer, July 2020
Constraint-Based Techniques in Stochastic Local Search MaxSAT Solving Andreia Guerreiro, Miguel Neves, Inês Lynce, José Rui Figueira, Vasco Manquinho, 25th International Conference Principles and Practice of Constraint Programming, CP 2019, Springer, pages 232-250, Springer, October 2019
Solving Motion and Action Planning for a Cooperative Agent Problem Using Geometry Friends Ana Salta, Rui Prada, Francisco S. Melo, EPIA Conference on Artificial Intelligence, Lecture Notes in Computer Science, Springer, vol. 11804, pages 86-97, Springer, September 2019
Integrating Constraint Reasoning in Multi-Objective Evolutionary Algorithms Miguel Neves, Inês Lynce, Vasco Manquinho, 28th International Joint Conference on Artificial Intelligence, IJCAI 2019, May 2019
Model revision of Boolean regulatory networks at stable state Filipe Gouveia, Inês Lynce, Pedro T. Monteiro, International Symposium on Bioinformatics Research and Applications, Lecture Notes in Computer Science, vol. 11490, pages 100-112, May 2019
Stratification for Constraint-Based Multi-Objective Combinatorial Optimization Miguel Neves, Inês Lynce, Vasco Manquinho, Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 2018
PySAT: {A} Python Toolkit for Prototyping with {SAT} Oracles Alexey Ignatiev, António José dos Reis Morgado, Joao Marques-Silva, Theory and Applications of Satisfiability Testing , Lecture Notes in Computer Science, Springer, vol. 10929, pages 428--437, Springer, July 2018
Multi-Objective Optimization Through Pareto Minimal Correction Subsets Miguel Neves, Inês Lynce, Vasco Manquinho, Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 2018
Model Revision of Logical Regulatory Networks Using Logic-Based Tools Filipe Gouveia, Inês Lynce, Pedro T. Monteiro, Technical Communications of the 34th International Conference on Logic Programming, ICLP 2018, July 2018
Towards Generalization in QBF Solving via Machine Learning Mikolas Janota, Thirty-Second AAAI Conference on Artificial Intelligence , April 2018
Introducing Pareto Minimal Correction Subsets Miguel Neves, Inês Lynce, Vasco Manquinho, International Conference on Theory and Applications of Satisfiability Testing (SAT), Lecture Notes in Computer Science, Springer, pages 195-211, Springer, August 2017
Using Spark and MapReduce to Parallelize Large Scale Simulations Over Host Contact Networks Andreia Sofia Teixeira, Pedro T. Monteiro, João Carriço, Francisco C. Santos, A. P. Francisco, , In: Ibrahim S., Choo KK., Yan Z., Pedrycz W. (eds). Proc. of, Lecture Notes in Computer Science, Springer, vol. 10393, Lecture Notes in Computer Science, Springer, July 2017
Leafactor: Improving energy efficiency of android apps via automatic refactoring Rui Abreu, Luís Cruz, 2017 IEEE/ACM 4th International Conference on Mobile Software Engineering and Systems (MOBILESoft), IEEE, pages 205-206, IEEE, May 2017
Performance-based guidelines for energy efficient mobile applications Rui Abreu, Luís Cruz, 2017 IEEE/ACM 4th International Conference on Mobile Software Engineering and Systems (MOBILESoft), pages 46-57, May 2017
A test-suite diagnosability metric for spectrum-based fault localization approaches Rui Abreu, Alexandre Perez, Proceedings of the 39th International Conference on Software Engineering (ICSE), pages 654-664, May 2017
Prevalence of single-fault fixes and its impact on fault localization Rui Abreu, Alexandre Perez, Marcelo D'Amorim, IEEE International Conference on Software Testing, Verification and Validation (ICST), pages 12-22, April 2017
Non-Portfolio Approaches for Distributed Maximum Satisfiability Miguel Neves, Inês Lynce, Vasco Manquinho, IEEE International Conference on Tools with Artificial Intelligence, IEEE Press, pages 436-443, IEEE Press, November 2016
On Incremental Core-Guided MaxSAT Solving Xujie Si, Xin Zhang, Vasco Manquinho, Mikolas Janota, Alexey S. Ignatiev, Mayur Naik, International Conference Principles and Practice of Constraint Programming (CP 2016), Lecture Notes in Computer Science, Springer, pages 473-482, Springer, September 2016
On the number and structure of Boolean functions compatible with a regulatory network topology Pedro T. Monteiro, José E.R. Cury, Claudine Chaouiya, [Abstract and Presentation at] 10th European Conference on Mathematical and Theoretical Biology (ECMTB), Nottingham, UK, July 2016
On Q-Resolution and CDCL QBF Solving Mikolas Janota, Theory and Applications of Satisfiability Testing – SAT 2016, June 2016
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, pages 324-342, Springer, Austin, TX, USA, September 2015
SAT-Based Horn Least Upper Bounds Carlos Mencia, Alessandro Previti, Joao Marques Silva, Theory and Applications of Satisfiability Testing, LNCS, Springer, pages 423-433, Springer, Austin, TX, USA, September 2015
Computing Maximal Autarkies with Few and Simple Oracle Queries Oliver Kullmann, Joao Marques Silva, Theory and Applications of Satisfiability Testing, LNCS, Springer, pages 138-155, Springer, Austin, TX, USA, September 2015
SAT-Based Formula Simplification Alexey S. Ignatiev, Alessandro Previti, Joao Marques Silva, Theory and Applications of Satisfiability Testing, LNCS, Springer, pages 287-298, Springer, Austin, TX, USA, September 2015
Efficient Axiom Pinpointing with EL2MCS M. Fareed Arif, Carlos Mencia, Joao Marques Silva, Annual German Conference on AI, LNCS, Springer, pages 225-233, Springer, Dresden, Germany, September 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, pages 173-182, Springer, Cork, Ireland, August 2015
Generalized Totalizer Encoding for Pseudo-Boolean Constraints Saurabh Joshi, Ruben Carlos Gonçalves Martins, Vasco Manquinho, International Conference Principles and Practice of Constraint Programming (CP 2015), LNCS, Springer, vol. 9255, pages 200-209, Springer, August 2015
Solving QBF by Clause Selection Mikolas Janota, Joao Marques Silva, International Joint Conference on Artificial Intelligence, AAAI Press, pages 325-331, AAAI Press, Buenos Aires, Argentina, July 2015
Literal-Based MCS Extraction. Carlos Mencia, Alessandro Previti, Joao Marques Silva, International Joint Conference on Artificial Intelligence, AAAI Press, pages 1973-1979, AAAI Press, Buenos Aires, Argentina, July 2015
A computational framework for the logical modelling of epithelial patterning Pedro Varela, Adrien Fauré, Claudine Chaouiya, Pedro T. Monteiro, [Presentation and Poster at] 12th Basel Computational Biology Conference ([BC]2'15), Basel, Switzerland, June 2015
Proof Complexity of Resolution-based QBF Calculi Olaf Beyersdorff, Leroy Chew, Mikolas Janota, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, vol. 30, pages 76--89, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, February 2015
Efficient Relaxations of Over-constrained CSPs Carlos Mencia, Joao Marques Silva, International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Press, pages 725-732, IEEE Press, Cyprus, November 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, pages 152-165, Springer, September 2014
GINsim: a software tool for the modelling and analysis of logical regulatory networks Aurélien Naldi, Pedro T. Monteiro, Denis Thieffry, Claudine Chaouiya, [Poster at] 13th European Conference on Computational Biology (ECCB'14), Strasbourg, France, September 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, pages 1065-1066, IOS Press, August 2014
On Unification of QBF Resolution-Based Calculi Mikolas Janota, Olaf Beyersdorff, Leroy Chew, Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Springer Berlin Heidelberg, vol. 8635, pages 81-93, Springer Berlin Heidelberg, August 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, pages 103-120, Springer, http://dx.doi.org/10.1007/978-3-319-09284-3_9, July 2014
Towards a Plant Experimental Assay Ontology Nuno D. Mendes, Pedro T. Monteiro, Cátia Vaz, Inês Chaves, [Poster at] 10th International Conference on Data Integration in the Life Sciences (DILS'14), Lisbon, Portugal, July 2014
YEASTRACT-NET: extracting and visualizing transcription regulatory networks in S. cerevisiae Pedro T. Monteiro, Miguel C. Teixeira, A. P. Francisco, Isabel Sá-Correia, [Poster and oral presentation] at XX Jornadas de leveduras Professor Nicolau van Uden, Lisboa, Portugal, July 2014
MUS Extraction Using Clausal Proofs Anton Belov, Marijn Heule, Joao Marques Silva, Theory and Applications of Satisfiability Testing (SAT), LNCS, Springer, pages 48-57, Springer, http://dx.doi.org/10.1007/978-3-319-09284-3_5, July 2014
On Computing Preferred MUSes and MCSes Joao Marques Silva, Alessandro Previti, Theory and Applications of Satisfiability Testing (SAT), LNCS, Springer, pages 58-74, Springer, http://dx.doi.org/10.1007/978-3-319-09284-3_6, July 2014
Towards efficient optimization in package management systems Alexey S. Ignatiev, Mikolas Janota, Joao Marques Silva, International Conference on Software Engineering (ICSE), ACM, pages 745-755, ACM, http://doi.acm.org/10.1145/2568225.2568306, May 2014
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, pages 368-376, Springer, http://dx.doi.org/10.1007/978-3-319-07046-9_26, May 2014
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, pages 93-108, Springer, http://dx.doi.org/10.1007/978-3-642-54862-8_7, March 2014
On lazy and eager interactive reconfiguration Mikolas 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, January 2014
On QBF Proofs and Preprocessing Mikolas Janota, Radu Grigore, Joao Marques Silva, Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), LNCS, Springer, pages 473-489, Springer, http://dx.doi.org/10.1007/978-3-642-45221-5_32, December 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, pages 439-456, Springer, http://dx.doi.org/10.1007/978-3-642-45221-5_30, December 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, pages 96-111, Springer, http://dx.doi.org/10.1007/978-3-642-45221-5_7, December 2013
Solving QBF with Free Variables William Klieber, Mikolas Janota, Joao Marques Silva, Edmund M. Clarke, Principles and Practice of Constraint Programming (CP), LNCS, Springer, pages 415-431, Springer, http://dx.doi.org/10.1007/978-3-642-40627-0_33, October 2013
Quantified Maximum Satisfiability: A Core-Guided Approach Alexey S. Ignatiev, Mikolas Janota, Joao Marques Silva, Theory and Applications of Satisfiability Testing (SAT), LNCS, Springer, pages 250-266, Springer, http://dx.doi.org/10.1007/978-3-642-39071-5_19, July 2013
Model-based Partitioning for MaxSAT Solving Ruben Carlos Gonçalves Martins, Vasco Manquinho, Inês Lynce, RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA'13), July 2013
Parallel MUS Extraction Anton Belov, Norbert Manthey, Joao Marques Silva, Theory and Applications of Satisfiability Testing (SAT), LNCS, Springer, pages 133-149, Springer, http://dx.doi.org/10.1007/978-3-642-39071-5_11, July 2013
Community-Based Partitioning for MaxSAT Solving Ruben Carlos Gonçalves Martins, Vasco Manquinho, Inês Lynce, 16th International Conference on Theory and Applications of Satisfiability Testing, LNCS, Springer, vol. 7962, pages 182-191, Springer, Helsinki, Finland, July 2013
On Propositional QBF Expansions and Q-Resolution Mikolas Janota, Joao Marques Silva, Theory and Applications of Satisfiability Testing (SAT), LNCS, Springer, pages 67-82, Springer, http://dx.doi.org/10.1007/978-3-642-39071-5_7, July 2013
Core minimization in SAT-based abstraction Anton Belov, Huan Chen, Alan Mishchenko, Joao Marques Silva, Design, Automation and Test in Europe (DATE), ACM, pages 1411-1416, ACM, http://dl.acm.org/citation.cfm?id=2485624, March 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, pages 108-123, Springer, http://dx.doi.org/10.1007/978-3-642-36742-7_8, March 2013
Reasoning over Biological Networks Using Maximum Satisfiability João Guerra, Inês Lynce, International Conference on Principles and Practice of Constraint Programming, LNCS, Springer, pages 941-956, Springer, November 2012
Efficient handling of large signalling-regulatory networks by focusing on their core control Aurélien Naldi, Pedro T. Monteiro, Claudine Chaouiya, 10th Intl. Conf. on Computational Methods in Systems Biology (CMSB'12), October 2012
On Computing Minimal Equivalent Subformulas Anton Belov, Mikolas Janota, Inês Lynce, Joao Marques Silva, International Conference on Principles and Practice of Constraint Programming, LNCS, Springer, pages 158-174, Springer, October 2012
Clause Sharing in Deterministic Parallel Maximum Satisfiability Ruben Carlos Gonçalves Martins, Vasco Manquinho, Inês Lynce, RCRA International Workshop on Experimental Evaluation of Algorithms for solving problems with combinatorial explosion, June 2012
Improvements to Core-Guided Binary Search for MaxSAT Antonio Morgado, Federico Heras, Joao Marques Silva, Theory and Applications of Satisfiability Testing (SAT 2012), Springer, pages 284-297, Springer, http://dx.doi.org/10.1007/978-3-642-31612-8_22, June 2012
Experimental Analysis of Backbone Computation Algorithms Mikolas Janota, Inês Lynce, Joao Marques Silva, RCRA International Workshop on Experimental Evaluation of Algorithms for solving problems with combinatorial explosion, June 2012
On Unit-Refutation Complete Formulae with Existentially Quantified Variables Lucas Bordeaux, Mikolas 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, June 2012
Solving QBF with Counterexample Guided Refinement Mikolas Janota, William Klieber, Joao Marques Silva, Edmund M. Clarke, Theory and Applications of Satisfiability Testing (SAT 2012), Springer, pages 114-128, Springer, http://dx.doi.org/10.1007/978-3-642-31612-8_10, June 2012
On Efficient Computation of Variable MUSes Anton Belov, Alexander Ivrii, Arie Matsliah, Joao Marques Silva, Theory and Applications of Satisfiability Testing (SAT 2012), Springer, pages 298-311, Springer, http://dx.doi.org/10.1007/978-3-642-31612-8_23, June 2012
An Empirical Study of Encodings for Group MaxSAT Federico Heras, Antonio Morgado, Joao Marques Silva, Canadian Conference on Artificial Intelligence (AAI 2012), Springer, pages 85-96, Springer, http://dx.doi.org/10.1007/978-3-642-30353-1_8, May 2012
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, May 2012
Efficient verification for logical models of regulatory networks Pedro T. Monteiro, Claudine Chaouiya, 6th Intl. Conf. on Practical Applications on Computational Biology & Bioinformatics (PACBB'12), March 2012
QBF-based boolean function bi-decomposition Huan Chen, Mikolas Janota, Joao Marques Silva, Design, Automation & Test in Europe Conference & Exhibition (DATE 2012), IEEE, pages 816-819, IEEE, http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arn, March 2012
Knowledge Compilation with Empowerment Lucas Bordeaux, Joao Marques Silva, Current Trends in Theory and Practice of Computer Science (SOFSEM 2012), Springer, pages 612-624, Springer, http://dx.doi.org/10.1007/978-3-642-27660-6_50, January 2012
Lower Bounds and Upper Bounds for MaxSAT Federico Heras, Antonio Morgado, Joao Marques Silva, Learning and Intelligent Optimization (LION 2012), Springer, pages 402-407, Springer, http://dx.doi.org/10.1007/978-3-642-34413-8_35, January 2012
On Validating Boolean Optimizers Antonio Morgado, Joao Marques Silva, International Conference on Tools with Artificial Intelligence (ICTAI 2011), IEEE, pages 924-926, IEEE, http://doi.ieeecomputersociety.org/10.1109/ICTAI.2, November 2011
Exploiting Cardinality Encodings in Parallel Maximum Satisfiability Ruben Carlos Gonçalves Martins, Vasco Manquinho, Inês Lynce, IEEE 23rd International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Press, pages 313-320, IEEE Press, Boca Raton, FL, USA, November 2011
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, pages 142-147, IEEE, http://dx.doi.org/10.1109/VLSISoC.2011.6081636, October 2011
On Deciding MUS Membership with QBF Mikolas Janota, Joao Marques Silva, Principles and Practice of Constraint Programming (CP 2011), LNCS, Springer, pages 414-428, Springer, Perugia, Italy, September 2011
Accelerating MUS extraction with recursive model rotation Anton Belov, Joao Marques Silva, Formal Methods in Computer-Aided Design (FMCAD 2011), ACM, pages 37-40, ACM, http://dl.acm.org/citation.cfm?id=2157663, September 2011
Core-Guided Binary Search Algorithms for Maximum Satisfiability Federico Heras, António José dos Reis Morgado, Joao Marques Silva, Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2011), AAAI Press, AAAI Press, San Francisco, CA, USA, August 2011
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, July 2011
Parallel Search for Boolean Optimization Ruben Carlos Gonçalves Martins, Vasco Manquinho, Inês Lynce, RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, Barcelona, Spain, July 2011
On Improving MUS Extraction Algorithms Joao Marques Silva, Inês Lynce, Theory and Applications of Satisfiability Testing (SAT 2011), LNCS, Springer, pages 159-173, Springer, Ann Arbor, MI, USA, June 2011
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, pages 343-356, Springer, http://dx.doi.org/10.1007/978-3-642-21581-0_27, June 2011
Minimally Unsatisfiable Boolean Circuits Anton Belov, Joao Marques Silva, Theory and Applications of Satisfiability Testing (SAT 2011), Springer, pages 145-158, Springer, http://dx.doi.org/10.1007/978-3-642-21581-0_13, June 2011
Abstraction-Based Algorithm for 2QBF Mikolas Janota, Joao Marques Silva, Theory and Applications of Satisfiability Testing (SAT 2011), LNCS, Springer, pages 230-244, Springer, Ann Arbor, MI, USA, June 2011
cmMUS: A Tool for Circumscription-Based MUS Membership Testing Mikolas Janota, Joao Marques Silva, Logic Programming and Nonmonotonic Reasoning (LPNMR 2011), LNCS, Springer, pages 266-271, Springer, Vancouver, Canada, May 2011
Improving Search Space Splitting for Parallel SAT Solving Ruben Carlos Gonçalves Martins, Vasco Manquinho, Inês Lynce, 22th IEEE International Conference on Tools with Artificial Intelligence (ICTAI10), IEEE, vol. 1, pages 336-343, IEEE, October 2010
Apt-pbo: Solving the Software Dependency Problem using Pseudo-Boolean Optimization Paulo Trezentos, Inês Lynce, Arlindo L. Oliveira, 25th IEEE/ACM International Conference on Automated Software Engineering, ACM, pages 427-436, ACM, September 2010
Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription Mikolas Janota, Radu Grigore, Joao Marques Silva, 12th European Conference on Logics in Artificial Intelligence (JELIA10), LNAI 6341, Springer, pages 195-207, Springer, September 2010
On Computing Backbones of Propositional Theories Joao Marques Silva, Mikolas Janota, Inês Lynce, 9th European Conference on Artificial Intelligence (ECAI10), IOS Press, pages 15-20, IOS Press, August 2010
Phyloviz: Visualizing epidemiological information on phylogenetic relationships inferred by goeBURST algorithm [Abstract and Poster] A. P. Francisco, Cátia Vaz, J. Melo-Cristino, M. Ramirez, João Carriço, International Conference on Research in Computational Molecular Biology (RECOMB 2010), August 2010
Improving Unsatisfiability-Based Algorithms for Boolean Optimization Vasco Manquinho, Ruben Carlos Gonçalves Martins, Inês Lynce, 13th International Conference on Theory and Applications of Satisfiability Testing (SAT10), LNCS 6175, Springer, pages 181-193, Springer, July 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), June 2010
New Insights into Encodings from MaxCSP into Partial MaxSAT Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà, 40th IEEE International Symposium on Multiple-Valued Logic (ISMVL10), IEEE, pages 46-52, IEEE, May 2010
On the Expressive Power of Primitives for Compensation Handling Cátia Vaz, C. Ferreira, 19th European Symposium on Programming , LNCS, Springer, vol. 6012, pages 366-386, Springer, March 2010
Restoring CSP Satisfiability with MaxSAT Inês Lynce, Joao Marques Silva, Portuguese Conference on Artificial Inteligence (EPIA), October 2009
On Improving Local Search for Unsatisfiability David Pereira, Inês Lynce, Steve Prestwich, CP Workshop on Local Search Techniques in Constraint Satisfaction (LSCS), September 2009
Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes using Pseudo-Boolean Optimization João Delgado, Inês Lynce, Vasco Manquinho, RECOMB Satellite Workshop on Comparative Genomics, LNBI, Springer, vol. 5817, pages 138-149, Springer, September 2009
Algorithms for Weighted Boolean Optimization Vasco Manquinho, Joao Marques Silva, Jordi Planes, International Conference on Theory and Applications of Satisfiability Testing (SAT), pages 495-508, June 2009
Sequential Encodings from MAX-CSP into Partial MAX-SAT Josep Argelich, Alba Cabiscol, Inês Lynce, Felip Manyà, International Conference on Theory and Applications of Satisfiability Testing (SAT), LNCS, Springer, Springer, June 2009
Dynamic Recovering of Long Running Transactions Cátia Vaz, C. Ferreira, A. Ravara, International Symposium on Trustworthy Global Computing (TGC 2008), Lecture Notes in Computer Science, Springer, vol. 5474, pages 201-215, Springer, November 2008
Computation Tree Regular Logic for Genetic Regulatory Networks Radu Mateescu, Pedro T. Monteiro, Estelle Dumas, Hidde de Jong, Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis (ATVA08), LNCS, Springer Verlag, vol. 5311, pages 48-63, Springer Verlag, Seoul, South Korea, October 2008
Temporal Logic Patterns for Querying Qualitative Models of Genetic Regulatory Networks Pedro T. Monteiro, Delphine Ropers, Radu Mateescu, Ana T. Freitas, Hidde de Jong, Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 08), IOS Press, pages 229-233, IOS Press, http://www.iospress.nl/loadtop/load.php?isbn=97815, July 2008
Temporal Logic Patterns for Querying Dynamic Models of Cellular Interaction Networks Pedro T. Monteiro, Delphine Ropers, Radu Mateescu, Ana T. Freitas, Hidde de Jong, Journees Ouvertes Biologie, Informatique et Mathematiques (JOBIM08), Jacques van Helden, Yves Moreau, pages 71-6, Jacques van Helden, Yves Moreau, Lille, France, June 2008
Temporal Logic Patterns for Querying Qualitative Models of Genetic Regulatory Networks Pedro T. Monteiro, Delphine Ropers, Radu Mateescu, Ana T. Freitas, Hidde de Jong, 22nd International Workshop on Qualitative Reasoning (QR08), Elizabeth Bradley, Louise Trave-Massuyes, pages 102-7, Elizabeth Bradley, Louise Trave-Massuyes, Boulder, CO, USA, June 2008
Local Search for Unsatisfiability Steve Prestwich, Inês Lynce, 9th International Conference on Theory and Applications of Satisfiability Testing, Lecture Notes in Computer Science, Springer, pages 283-296, Springer, Seattle, August 2006
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, November 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), pages 275-280, Vancouver, May 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), pages 120-126, Vancouver, May 2004
Concurrent Development of Model and Implementation Andy Gravell, Yvonne Howard, Juan Augusto, C. Ferreira, Stefan Gruner, , 16th International Conference of Software and Systems Engine, 16th International Conference of Software and Systems Engine, December 2003
Propositional Satisfiability Algorithms based on Inference of Constraints Inês Lynce, Joao Marques Silva, Eighth International Joint Conference on Artificial Intelligence, Doctoral Consortium, August 2003
On Implementing More Efficient SAT Data Structures Inês Lynce, Joao Marques Silva, Sixth International Conference on Theory and Applications of Satisfiability Testing, May 2003
The Effect of Nogood Recording in DPLL-CBJ SAT Algorithms Inês Lynce, Joao Marques Silva, Recent Advances in Constraints, LNAI, LNAI, March 2003
Tuning Randomization in Backtrack Search SAT Algorithms Inês Lynce, Joao Marques Silva, International Conference on Principles and Practice of Constraint Programming, September 2002
Building State-of-the-Art SAT solvers Inês Lynce, Joao Marques Silva, European Conference on Artificial Intelligence, July 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, June 2002
Efficient data structures for backtrack search SAT solvers Inês Lynce, Joao Marques Silva, Fifth International Symposium on the Theory and Applications of Satisfiability Testing, May 2002
Complete unrestricted backtracking algorithms for Satisfiability Inês Lynce, Joao Marques Silva, Fifth International Symposium on the Theory and Applications of Satisfiability Testing, May 2002
Improving SAT Algorithms by Using Search Pruning Techniques Inês Lynce, Joao Marques Silva, Seventh International Conference on Principles and Practice of Constraint Programming - Doctoral Programme, December 2001
The Interaction Between Simplification and Search in Propositional Satisfiability Inês Lynce, Joao Marques Silva, CP'01 - Workshop on Modeling and Problem Formulation, December 2001
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, pages 73-86, December 2001
Towards provably complete stochastic search algorithms for satisfiability Luís Manuel Tremoceiro Baptista, Inês Lynce, Joao Marques Silva, Proceedings of the 10th Portuguese Conference on Artificial Intelligence, In P. Brazdil and A. Jorge, ed, vol. 2258, pages 363-370, In P. Brazdil and A. Jorge, ed, December 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, pages 375-388, April 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), September 2000
Algebraic Simplification Techniques for Propositional Satisfiability Joao Marques Silva, 6th International Conference on Principles and Practice of Constraint Programming (CP), September 2000
On Selecting Problem Instances for Evaluating Satisfiability Algorithms Joao Marques Silva, in ECAI Workshop on Empirical Methods in Artificial Intelligence (ECAI-EMAI), August 2000
Search Pruning Conditionsfor Boolean Optimization Vasco Manquinho, Joao Marques Silva, European Conference on Artificial Intelligence (ECAI), August 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), July 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), July 2000
Boolean Satisfiability in Electronic Design Automation Joao Marques Silva, Karem A. Sakallah, IEEE/ACM Design Automation Conference (DAC), June 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), March 2000
On Solving Boolean Optimization with Satisfiability-Based Algorithms Vasco Manquinho, Joao Marques Silva, Sixth International Symposium on Artificial Intelligence and Mathematics, January 2000
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, pages 452-470, July 1998
Automatic Generation of C-code or PLD circuits under SFC Graphical Environment C. Ferreira, Sérgio Monteiro, João Monteiro, IEEE International Symposium on Industrial Electronics (ISIE 1997), IEEE, vol. 2, IEEE, Guimarães, July 1997
Predicting Gene and Genomic Regulation in Saccharomyces cerevisiae, using the YEASTRACT Database: A Step By Step Guided Analysis Miguel C. Teixeira, Pedro T. Monteiro, Isabel Sá-Correia, Yeast Functional Genomics: Methods and Protocols, Humana Press, January 2016
Improvements to Satisfiability-Based Boolean Function Bi-Decomposition Huan Chen, Joao Marques Silva, VLSI-SoC: Advanced Research for Systems on Chip, Springer, http://link.springer.com/book/10.1007/978-3-642-32, May 2012
Algorithms for Maximum Satisfiability Using Unsatisfiable Cores Joao Marques Silva, Jordi Planes, Advanced Techniques in Logic Synthesis, Optimizations and Applications, Springer, http://www.springer.com/engineering/circuits+%26+s, March 2011
Haplotype Inference Using Propositional Satisfiability Ana Sofia Graça, Joao Marques Silva, Inês Lynce, Mathematical Approaches to Polymer Sequence Analysis and Related Problems, Springer, January 2011
Haplotype Inference using Propositional Satisfiability Ana Sofia Graça, Joao Marques Silva, Inês Lynce, Mathematical Approaches to Polymer Sequence Analysis and Related Problems, Springer, October 2010
Pseudo-Boolean and Cardinality Constraints Olivier Roussel, Vasco Manquinho, Handbook of Satisfiability, IOS Press, February 2009
GRASP - A New Search Algorithm for Satisfiability Joao Marques Silva, Karem A. Sakallah, The Best of ICCAD -- 20 Years of Excellence in Computer Aided Design The Best of ICCAD: 20 Years of Excellence in Compu, Kluwer Academic Publishers, March 2003
SAT and ATPG: Algorithms for Boolean Decision Problems W. Kunz, Joao Marques Silva, S. Malik, Logic Synthesis and Verication, Kluwer Academic Publishers, November 2001
Proceedings (Editor)
Formal Methods Teaching: 4th International Workshop and Tutorial, FMTea 2021, Virtual Event, November 21, 2021, Proceedings João F. Ferreira, Alexandra Mendes, Claudio Menghi, , Springer, November 2021
Probing-Based Formula Manipulation Techniques for SAT Inês Lynce, Joao Marques Silva, TechnicalReport, INESC-ID Lisboa, n. 2, June 2003
Tuning Randomization in Backtrack Search SAT - Technical Report RT/05/2002 Inês Lynce, Joao Marques Silva, TechnicalReport, INESC-ID Lisboa, n. 23, June 2002
Building State-of-the-Art SAT Solvers - Technical Report RT/02/2002 Inês Lynce, Joao Marques Silva, TechnicalReport, INESC-ID Lisboa, n. 26, April 2002
Introdução aos Problemas NP-Completos - Technical Report RT/03/2002 Joao Marques Silva, TechnicalReport, INESC-ID Lisboa, n. 25, April 2002
The Effect of Nogood Recording in MAC-CBJ SAT Algorithms - Technical Report RT/04/2002 Inês Lynce, Joao Marques Silva, TechnicalReport, INESC-ID Lisboa, n. 24, April 2002
Hypothetical Reasoning in Propositional Satisfiability Inês Lynce, Joao Marques Silva, TechnicalReport, INESC-ID Lisboa, n. 37, March 2002
Pattern-Based Simplification Techniques for Satisfiability Inês Lynce, Joao Marques Silva, TechnicalReport, INESC-ID Lisboa, n. 2, December 2001
Efficient Data Structures for fast SAT Solvers Inês Lynce, Joao Marques Silva, TechnicalReport, INESC-ID Lisboa, n. 1, November 2001
