publications
publications by categories in reversed chronological order. generated by jekyll-scholar.
2024
- Delivering Inflated ExplanationsIn Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada , 2024
2023
- Tractability of explaining classifier decisionsArtif. Intell., 2023
- No silver bullet: interpretable ML models must be explainedFrontiers Artif. Intell., 2023
- On computing probabilistic abductive explanationsInt. J. Approx. Reason., 2023
- Solving Explainability Queries with Quantification: The Case of Feature RelevancyIn Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 , 2023
- Eliminating the Impossible, Whatever Remains Must Be True: On Extracting and Applying Background Knowledge in the Context of Formal ExplanationsIn Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023 , 2023
- Efficient Reasoning about Infeasible One Machine SequencingIn Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, July 8-13, 2023, Prague, Czech Republic , 2023
- From Decision Trees to Explained Decision SetsIn ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland - Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023) , 2023
- Disproving XAI Myths with Formal Methods - Initial ResultsIn 27th International Conference on Engineering of Complex Computer Systems, ICECCS 2023, Toulouse, France, June 14-16, 2023 , 2023
- On Tackling Explanation Redundancy in Decision Trees (Extended Abstract)In Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China , 2023
- On Computing Relevant Features for Explaining NBCsIn Proceedings of 1st Workshop on AI-driven heterogeneous data management: Completing, merging, handling inconsistencies and query-answering, co-located with 20th International Conference on Principles of Knowledge Representation and Reasoning (KR 2023), Rhodes, Greece, September 3-4, 2023 , 2023
- Tractable Explaining of Multivariate Decision TreesIn Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, KR 2023, Rhodes, Greece, September 2-8, 2023 , 2023
- Feature Necessity & Relevancy in ML Classifier ExplanationsIn Tools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Paris, France, April 22-27, 2023, Proceedings, Part I , 2023
- Certified Logic-Based Explainable AI - The Case of Monotonic ClassifiersIn Tests and Proofs - 17th International Conference, TAP 2023, Leicester, UK, July 18-19, 2023, Proceedings , 2023
- The Inadequacy of Shapley Values for ExplainabilityCoRR, 2023
- Disproving XAI Myths with Formal Methods - Initial ResultsCoRR, 2023
- From Robustness to Explainability and Back AgainCoRR, 2023
- Delivering Inflated ExplanationsCoRR, 2023
- On Logic-Based Explainability with Partially Specified InputsCoRR, 2023
- Explainability is NOT a GameCoRR, 2023
- A Refutation of Shapley Values for ExplainabilityCoRR, 2023
- Refutation of Shapley Values for XAI - Additional EvidenceCoRR, 2023
- The Pros and Cons of Adversarial RobustnessCoRR, 2023
- Locally-Minimal Probabilistic ExplanationsCoRR, 2023
2022
- On Tackling Explanation Redundancy in Decision TreesJ. Artif. Intell. Res., 2022
- Using MaxSAT for Efficient Explanations of Tree EnsemblesIn Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022 , 2022
- Tractable Explanations for d-DNNF ClassifiersIn Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022 , 2022
- Constraint-Driven Explanations for Black-Box ML ModelsIn Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022 , 2022
- Delivering Trustworthy AI through Formal XAIIn Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022 , 2022
- Logic-Based Explainability in Machine LearningIn Reasoning Web. Causality, Explanations and Declarative Knowledge - 18th International Summer School 2022, Berlin, Germany, September 27-30, 2022, Tutorial Lectures , 2022
- On Deciding Feature Membership in Explanations of SDD & Related ClassifiersCoRR, 2022
- Provably Precise, Succinct and Efficient Explanations for Decision TreesCoRR, 2022
- On Tackling Explanation Redundancy in Decision TreesCoRR, 2022
- Eliminating The Impossible, Whatever Remains Must Be TrueCoRR, 2022
- On Computing Relevant Features for Explaining NBCsCoRR, 2022
- Feature Necessity & Relevancy in ML Classifier ExplanationsCoRR, 2022
- Logic-Based Explainability in Machine LearningCoRR, 2022
- On Computing Probabilistic Abductive ExplanationsCoRR, 2022
2021
- Propositional proof systems based on maximum satisfiabilityArtif. Intell., 2021
- Auditing static machine learning anti-Malware tools against metamorphic attacksComput. Secur., 2021
- A Scalable Two Stage Approach to Computing Optimal Decision SetsIn Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021 , 2021
- Automated Reasoning in Explainable AIIn Artificial Intelligence Research and Development - Proceedings of the 23rd International Conference of the Catalan Association for Artificial Intelligence, CCIA 2021, Virtual Event, 20-22 October, 2021 , 2021
- On the Tractability of Explaining Decisions of ClassifiersIn 27th International Conference on Principles and Practice of Constraint Programming, CP 2021, Montpellier, France (Virtual Conference), October 25-29, 2021 , 2021
- Optimizing Binary Decision Diagrams for Interpretable Machine Learning ClassificationIn Design, Automation & Test in Europe Conference & Exhibition, DATE 2021, Grenoble, France, February 1-5, 2021 , 2021
- Explanations for Monotonic ClassifiersIn Proceedings of the 38th International Conference on Machine Learning, ICML 2021, 18-24 July 2021, Virtual Event , 2021
- On Explaining Random Forests with SATIn Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021 , 2021
- Reasoning-Based Learning of Interpretable ML ModelsIn Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021 , 2021
- On Efficiently Explaining Graph-Based ClassifiersIn Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, KR 2021, Online event, November 3-12, 2021 , 2021
- SAT-Based Rigorous Explanations for Decision ListsIn Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings , 2021
- Assessing Progress in SAT Solvers Through the Lens of Incremental SATIn Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings , 2021
- Conflict-Driven Clause Learning SAT SolversIn Handbook of Satisfiability - Second Edition , 2021
- A Scalable Two Stage Approach to Computing Optimal Decision SetsCoRR, 2021
- MILP for the Multi-objective VM Reassignment ProblemCoRR, 2021
- SAT-Based Rigorous Explanations for Decision ListsCoRR, 2021
- On Explaining Random Forests with SATCoRR, 2021
- Explanations for Monotonic ClassifiersCoRR, 2021
- Efficient Explanations With Relevant SetsCoRR, 2021
- On Efficiently Explaining Graph-Based ClassifiersCoRR, 2021
- Efficient Explanations for Knowledge Compilation LanguagesCoRR, 2021
- Extending the Synergies Between SAT and Description Logics (Dagstuhl Seminar 21361)Dagstuhl Reports, 2021
2020
- Optimum stable model search: algorithms and implementationJ. Log. Comput., 2020
- From Contrastive to Abductive Explanations and Back AgainIn AIxIA 2020 - Advances in Artificial Intelligence - XIXth International Conference of the Italian Association for Artificial Intelligence, Virtual Event, November 25-27, 2020, Revised Selected Papers , 2020
- Towards Formal Fairness in Machine LearningIn Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings , 2020
- Branch Location Problems with Maximum SatisfiabilityIn ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020 - Including 10th Conference on Prestigious Applications of Artificial Intelligence (PAIS 2020) , 2020
- Reasoning About Inconsistent FormulasIn Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 , 2020
- Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and DelayIn Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual , 2020
- Reasoning About Strong Inconsistency in ASPIn Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings , 2020
- Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and DelayCoRR, 2020
- On Explaining Decision TreesCoRR, 2020
- On Relating ’Why?’ and ’Why Not?’ ExplanationsCoRR, 2020
2019
- Formally Verifying the Solution to the Boolean Pythagorean Triples ProblemJ. Autom. Reason., 2019
- RC2: an Efficient MaxSAT SolverJ. Satisf. Boolean Model. Comput., 2019
- Abduction-Based Explanations for Machine Learning ModelsIn The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019 , 2019
- Computing Shortest Resolution ProofsIn Progress in Artificial Intelligence, 19th EPIA Conference on Artificial Intelligence, EPIA 2019, Vila Real, Portugal, September 3-6, 2019, Proceedings, Part II , 2019
- Model-Based Diagnosis with Multiple ObservationsIn Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, August 10-16, 2019 , 2019
- Efficient Symmetry Breaking for SAT-Based Minimum DFA InferenceIn Language and Automata Theory and Applications - 13th International Conference, LATA 2019, St. Petersburg, Russia, March 26-29, 2019, Proceedings , 2019
- On Relating Explanations and Adversarial ExamplesIn Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada , 2019
- On Computing the Union of MUSesIn Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings , 2019
- DRMaxSAT with MaxHS: First ContactIn Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings , 2019
- Assessing Heuristic Machine Learning Explanations with Model CountingIn Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings , 2019
- On Validating, Repairing and Refining Heuristic ML ExplanationsCoRR, 2019
- From Shallow to Deep Interactions Between Knowledge Representation, Reasoning and Machine Learning (Kay R. Amel group)CoRR, 2019
2018
- MaxSAT Resolution With the Dual Rail EncodingIn Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February 2-7, 2018 , 2018
- Premise Set Caching for Enumerating Minimal Correction SubsetsIn Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February 2-7, 2018 , 2018
- A SAT-Based Approach to Learn Explainable Decision SetsIn Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings , 2018
- Computing with SAT Oracles: Past, Present and FutureIn Sailing Routes in the World of Computation - 14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 - August 3, 2018, Proceedings , 2018
- Learning Optimal Decision Trees with SATIn Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden , 2018
- PySAT: A Python Toolkit for Prototyping with SAT OraclesIn Theory and Applications of Satisfiability Testing - SAT 2018 - 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings , 2018
- Propositional SAT SolvingIn Handbook of Model Checking , 2018
- Abduction-Based Explanations for Machine Learning ModelsCoRR, 2018
2017
- Minimal sets on propositional formulae. Problems and reductionsArtif. Intell., 2017
- Exact and Hybrid Solutions for the Multi-Objective VM Reassignment ProblemInt. J. Artif. Intell. Tools, 2017
- On Minimal Corrections in ASPIn Proceedings of the 24th RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion 2017 co-located with the 16th International Conference of the Italian Association for Artificial Intelligence (AI*IA 2017), Bari, Italy, November 14-15, 2017 , 2017
- Debugging EL+ Ontologies through Horn MUS EnumerationIn Proceedings of the 30th International Workshop on Description Logics, Montpellier, France, July 18-21, 2017 , 2017
- An Achilles’ Heel of Term-ResolutionIn Progress in Artificial Intelligence - 18th EPIA Conference on Artificial Intelligence, EPIA 2017, Porto, Portugal, September 5-8, 2017, Proceedings , 2017
- Horn Maximum Satisfiability: Reductions, Algorithms and ApplicationsIn Progress in Artificial Intelligence - 18th EPIA Conference on Artificial Intelligence, EPIA 2017, Porto, Portugal, September 5-8, 2017, Proceedings , 2017
- Lean Kernels in Description LogicsIn The Semantic Web - 14th International Conference, ESWC 2017, Portorož, Slovenia, May 28 - June 1, 2017, Proceedings, Part I , 2017
- On Computing Generalized BackbonesIn 29th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2017, Boston, MA, USA, November 6-8, 2017 , 2017
- Cardinality Encodings for Graph Optimization ProblemsIn Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 , 2017
- On Tackling the Limits of Resolution in SAT SolvingIn Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings , 2017
- Improving MCS Enumeration via CachingIn Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings , 2017
- Efficient Certified Resolution Proof CheckingIn Tools and Algorithms for the Construction and Analysis of Systems - 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Part I , 2017
- On Tackling the Limits of Resolution in SAT SolvingCoRR, 2017
- Horn Maximum Satisfiability: Reductions, Algorithms & ApplicationsCoRR, 2017
- Model Based Diagnosis of Multiple Observations with Implicit Hitting SetsCoRR, 2017
2016
- On the query complexity of selecting minimal sets for monotone predicatesArtif. Intell., 2016
- Solving QBF with counterexample guided refinementArtif. Intell., 2016
- Maximal falsifiabilityAI Commun., 2016
- Reports of the 2016 AAAI Workshop ProgramAI Mag., 2016
- Fast, flexible MUS enumerationConstraints An Int. J., 2016
- Quantified maximum satisfiabilityConstraints An Int. J., 2016
- Preface: The Beyond NP WorkshopIn Beyond NP, Papers from the 2016 AAAI Workshop, Phoenix, Arizona, USA, February 12, 2016 , 2016
- On Finding Minimum Satisfying AssignmentsIn Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings , 2016
- Propositional Abduction with Implicit Hitting SetsIn ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands - Including Prestigious Applications of Artificial Intelligence (PAIS 2016) , 2016
- Efficient Reasoning for Inconsistent Horn FormulaeIn Logics in Artificial Intelligence - 15th European Conference, JELIA 2016, Larnaca, Cyprus, November 9-11, 2016, Proceedings , 2016
- MCS Extraction with Sublinear Oracle QueriesIn Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings , 2016
- BEACON: An Efficient SAT-Based Tool for Debugging \emphEL\^+ OntologiesIn Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings , 2016
- Propositional Abduction with Implicit Hitting SetsCoRR, 2016
- Efficient Certified Resolution Proof CheckingCoRR, 2016
2015
- Algorithms for computing backbones of propositional formulaeAI Commun., 2015
- MaxSAT-based encodings for Group MaxSATAI Commun., 2015
- Expansion-based QBF solving versus Q-resolutionTheor. Comput. Sci., 2015
- Smallest MUS Extraction with Minimal Hitting Set DualizationIn Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Cork, Ireland, August 31 - September 4, 2015, Proceedings , 2015
- MILP for the Multi-objective VM Reassignment ProblemIn 27th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2015, Vietri sul Mare, Italy, November 9-11, 2015 , 2015
- Solving QBF by Clause SelectionIn Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015 , 2015
- Efficient Model Based Diagnosis with Maximum SatisfiabilityIn Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015 , 2015
- Literal-Based MCS ExtractionIn Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015 , 2015
- Prime Compilation of Non-Clausal FormulaeIn Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015 , 2015
- Efficient Axiom Pinpointing with EL2MCSIn KI 2015: Advances in Artificial Intelligence - 38th Annual German Conference on AI, Dresden, Germany, September 21-25, 2015, Proceedings , 2015
- Computing Maximal Autarkies with Few and Simple Oracle QueriesIn Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings , 2015
- SAT-Based Formula SimplificationIn Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings , 2015
- Efficient MUS Enumeration of Horn Formulae with Applications to Axiom PinpointingIn Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings , 2015
- SAT-Based Horn Least Upper BoundsIn Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings , 2015
- Towards Efficient Axiom Pinpointing of EL+ OntologiesCoRR, 2015
- Computing maximal autarkies with few and simple oracle queriesCoRR, 2015
- Efficient MUS Enumeration of Horn Formulae with Applications to Axiom PinpointingCoRR, 2015
2014
- Algorithms for computing minimal equivalent subformulasArtif. Intell., 2014
- MSCG: Robust Core-Guided MaxSAT SolvingJ. Satisf. Boolean Model. Comput., 2014
- Core-Guided MaxSAT with Soft Cardinality ConstraintsIn Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings , 2014
- A Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability ProblemsIn Integration of AI and OR Techniques in Constraint Programming - 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014. Proceedings , 2014
- Progression in Maximum SatisfiabilityIn ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic - Including Prestigious Applications of Intelligent Systems (PAIS 2014) , 2014
- Efficient AutarkiesIn ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic - Including Prestigious Applications of Intelligent Systems (PAIS 2014) , 2014
- Timeout-Sensitive Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability ProblemsIn ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic - Including Prestigious Applications of Intelligent Systems (PAIS 2014) , 2014
- Towards efficient optimization in package management systemsIn 36th International Conference on Software Engineering, ICSE ’14, Hyderabad, India - May 31 - June 07, 2014 , 2014
- Efficient Relaxations of Over-constrained CSPsIn 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, Cyprus, November 10-12, 2014 , 2014
- Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal FormIn Logics in Artificial Intelligence - 14th European Conference, JELIA 2014, Funchal, Madeira, Portugal, September 24-26, 2014. Proceedings , 2014
- MUS Extraction Using Clausal ProofsIn Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings , 2014
- On Computing Preferred MUSes and MCSesIn Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings , 2014
- On Reducing Maximum Independent Set to Minimum SatisfiabilityIn Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings , 2014
- Synthesizing Safe Bit-Precise InvariantsIn Tools and Algorithms for the Construction and Analysis of Systems - 20th International Conference, TACAS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014. Proceedings , 2014
- On lazy and eager interactive reconfigurationIn The Eighth International Workshop on Variability Modelling of Software-intensive Systems, VaMoS ’14, Sophia Antipolis, France, January 22-24, 2014 , 2014
- SAT SolversIn Tractability: Practical Approaches to Hard Problems , 2014
- Computing Minimal Sets on Propositional Formulae I: Problems & ReductionsCoRR, 2014
- On Minimal Corrections in ASPCoRR, 2014
- On the Query Complexity of Selecting Few Minimal SetsElectron. Colloquium Comput. Complex., 2014
2013
- Iterative and core-guided MaxSAT solving: A survey and assessmentConstraints An Int. J., 2013
- A Two-Variable Model for SAT-Based ATPGIEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2013
- Partial MUS EnumerationIn Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA , 2013
- Minimal Sets over Monotone Predicates in Boolean FormulaeIn Computer Aided Verification - 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings , 2013
- Solving QBF with Free VariablesIn Principles and Practice of Constraint Programming - 19th International Conference, CP 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings , 2013
- Core minimization in SAT-based abstractionIn Design, Automation and Test in Europe, DATE 13, Grenoble, France, March 18-22, 2013 , 2013
- Model-Guided Approaches for MaxSAT SolvingIn 25th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2013, Herndon, VA, USA, November 4-6, 2013 , 2013
- On Computing Minimal Correction SubsetsIn IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013 , 2013
- SAT-Based Preprocessing for MaxSATIn Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013. Proceedings , 2013
- Maximal Falsifiability - Definitions, Algorithms, and ApplicationsIn Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013. Proceedings , 2013
- On QBF Proofs and PreprocessingIn Logic for Programming, Artificial Intelligence, and Reasoning - 19th International Conference, LPAR-19, Stellenbosch, South Africa, December 14-19, 2013. Proceedings , 2013
- On Propositional QBF Expansions and Q-ResolutionIn Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings , 2013
- Parallel MUS ExtractionIn Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings , 2013
- Quantified Maximum Satisfiability: - A Core-Guided ApproachIn Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings , 2013
- Formula Preprocessing in MUS ExtractionIn Tools and Algorithms for the Construction and Analysis of Systems - 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings , 2013
- SAT-based Preprocessing for MaxSAT (extended version)CoRR, 2013
- On QBF Proofs and PreprocessingCoRR, 2013
- On Propositional QBF Expansions and Q-ResolutionElectron. Colloquium Comput. Complex., 2013
2012
- Towards efficient MUS extractionAI Commun., 2012
- Hybrid Incremental Algorithms for Boolean SatisfiabilityInt. J. Artif. Intell. Tools, 2012
- TG-Pro: A SAT-based ATPG SystemJ. Satisf. Boolean Model. Comput., 2012
- PackUp: Tools for Package Upgradability SolvingJ. Satisf. Boolean Model. Comput., 2012
- MUSer2: An Efficient MUS ExtractorJ. Satisf. Boolean Model. Comput., 2012
- Computing Minimally Unsatisfiable Subformulas: State of the Art and Future DirectionsJ. Multiple Valued Log. Soft Comput., 2012
- SMT-Based Bounded Model Checking for Embedded ANSI-C SoftwareIEEE Trans. Software Eng., 2012
- An Empirical Study of Encodings for Group MaxSATIn Advances in Artificial Intelligence - 25th Canadian Conference on Artificial Intelligence, Canadian AI 2012, Toronto, ON, Canada, May 28-30, 2012. Proceedings , 2012
- On Computing Minimal Equivalent SubformulasIn Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Québec City, QC, Canada, October 8-12, 2012. Proceedings , 2012
- QBf-based boolean function bi-decompositionIn 2012 Design, Automation & Test in Europe Conference & Exhibition, DATE 2012, Dresden, Germany, March 12-16, 2012 , 2012
- New & improved models for SAT-based bi-decompositionIn Great Lakes Symposium on VLSI 2012, GLSVLSI’12, Salt Lake City, UT, USA, May 3-4, 2012 , 2012
- MaxSAT-Based MCS EnumerationIn Hardware and Software: Verification and Testing - 8th International Haifa Verification Conference, HVC 2012, Haifa, Israel, November 6-8, 2012. Revised Selected Papers , 2012
- Iterative SAT Solving for Minimum SatisfiabilityIn IEEE 24th International Conference on Tools with Artificial Intelligence, ICTAI 2012, Athens, Greece, November 7-9, 2012 , 2012
- On Unit-Refutation Complete Formulae with Existentially Quantified VariablesIn Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012, Rome, Italy, June 10-14, 2012 , 2012
- Lower Bounds and Upper Bounds for MaxSATIn Learning and Intelligent Optimization - 6th International Conference, LION 6, Paris, France, January 16-20, 2012, Revised Selected Papers , 2012
- Solving QBF with Counterexample Guided RefinementIn Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings , 2012
- Improvements to Core-Guided Binary Search for MaxSATIn Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings , 2012
- On Efficient Computation of Variable MUSesIn Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings , 2012
- Knowledge Compilation with EmpowermentIn SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 21-27, 2012. Proceedings , 2012
- Generalizing Redundancy in Propositional Logic: Foundations and Hitting Sets DualityCoRR, 2012
2011
- Boolean lexicographic optimization: algorithms & applicationsAnn. Math. Artif. Intell., 2011
- Haplotype inference with pseudo-Boolean optimizationAnn. Oper. Res., 2011
- Anatomy and Empirical Evaluation of Modern SAT SolversBull. EATCS, 2011
- Restoring CSP Satisfiability with MaxSATFundam. Informaticae, 2011
- Core-Guided Binary Search Algorithms for Maximum SatisfiabilityIn Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, San Francisco, California, USA, August 7-11, 2011 , 2011
- On Deciding MUS Membership with QBFIn Principles and Practice of Constraint Programming - CP 2011 - 17th International Conference, CP 2011, Perugia, Italy, September 12-16, 2011. Proceedings , 2011
- Accelerating MUS extraction with recursive model rotationIn International Conference on Formal Methods in Computer-Aided Design, FMCAD ’11, Austin, TX, USA, October 30 - November 02, 2011 , 2011
- On Validating Boolean OptimizersIn IEEE 23rd International Conference on Tools with Artificial Intelligence, ICTAI 2011, Boca Raton, FL, USA, November 7-9, 2011 , 2011
- Read-Once Resolution for Unsatisfiability-Based Max-SAT AlgorithmsIn IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011 , 2011
- cmMUS: A Tool for Circumscription-Based MUS Membership TestingIn Logic Programming and Nonmonotonic Reasoning - 11th International Conference, LPNMR 2011, Vancouver, Canada, May 16-19, 2011. Proceedings , 2011
- Minimally Unsatisfiable Boolean CircuitsIn Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings , 2011
- On Improving MUS Extraction AlgorithmsIn Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings , 2011
- Abstraction-Based Algorithm for 2QBFIn Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings , 2011
- Empirical Study of the Anatomy of Modern Sat SolversIn Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings , 2011
- Improvements to Satisfiability-Based Boolean Function Bi-DecompositionIn VLSI-SoC: Advanced Research for Systems on Chip - 19th IFIP WG 10.5/IEEE International Conference on Very Large Scale Integration, VLSI-SoC 2011, Hong Kong, China, October 3-5, 2011, Revised Selected Papers , 2011
- Improvements to satisfiability-based boolean function bi-decompositionIn IEEE/IFIP 19th International Conference on VLSI and System-on-Chip, VLSI-SoC 2011, Kowloon, Hong Kong, China, October 3-5, 2011 , 2011
- Lazy Decomposition for Distributed Decision ProceduresIn Proceedings 10th International Workshop on Parallel and Distributed Methods in verifiCation, PDMC 2011, Snowbird, Utah, USA, July 14, 2011 , 2011
- Haplotype Inference Using Propositional SatisfiabilityIn Mathematical Approaches to Polymer Sequence Analysis and Related Problems , 2011
- On Validating Boolean OptimizersCoRR, 2011
- QBF-Based Boolean Function Bi-DecompositionCoRR, 2011
2010
- Combinatorial Optimization Solutions for the Maximum Quartet Consistency ProblemFundam. Informaticae, 2010
- Haplotype Inference by Pure Parsimony: A SurveyJ. Comput. Biol., 2010
- Automated Design Debugging With Maximum SatisfiabilityIEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2010
- Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree InformationIn Algebraic and Numeric Biology - 4th International Conference, ANB 2010, Hagenberg, Austria, July 31- August 2, 2010, Revised Selected Papers , 2010
- Boolean Lexicographic OptimizationIn Proceedings of the 17th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, RCRA@CPAIOR 2010, Bologna, Italy, June 10-11, 2010 , 2010
- On Computing Backbones of Propositional TheoriesIn ECAI 2010 - 19th European Conference on Artificial Intelligence, Lisbon, Portugal, August 16-20, 2010, Proceedings , 2010
- Continuous Verification of Large Embedded Software Using SMT-Based Bounded Model CheckingIn 17th IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, ECBS 2010, Oxford, England, UK, 22-26 March 2010 , 2010
- Industrial-Strength Certified SAT Solving through Verified SAT Proof CheckingIn Theoretical Aspects of Computing - ICTAC 2010, 7th International Colloquium, Natal, Rio Grande do Norte, Brazil, September 1-3, 2010. Proceedings , 2010
- Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper)In 40th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2010, Barcelona, Spain, 26-28 May 2010 , 2010
- Counterexample Guided Abstraction Refinement Algorithm for Propositional CircumscriptionIn Logics in Artificial Intelligence - 12th European Conference, JELIA 2010, Helsinki, Finland, September 13-15, 2010. Proceedings , 2010
- How to Complete an Interactive Configuration Process?In SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings , 2010
- Solving Linux Upgradeability Problems Using Boolean OptimizationIn Proceedings First International Workshop on Logics for Component Configuration, LoCoCo 2010, Edinburgh, UK, 10th July 2010 , 2010
- Counterexample Guided Abstraction Refinement Algorithm for Propositional CircumscriptionCoRR, 2010
2009
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulasConstraints An Int. J., 2009
- Restoring CSP Satisfiability with MaxSATIn Proceedings of the 16th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, RCRA@AI*IA 2009, Reggio Emilia, Italy, December 11-12, 2009 , 2009
- Spatial and temporal design debug using partial MaxSATIn Proceedings of the 19th ACM Great Lakes Symposium on VLSI 2009, Boston Area, MA, USA, May 10-12 2009 , 2009
- TG-PRO: A new model for SAT-based ATPGIn IEEE International High Level Design Validation and Test Workshop, HLDVT 2009, San Francisco, CA, USA, 4-6 November 2009 , 2009
- Semiformal Verification of Embedded Software in Medical Devices Considering Stringent Hardware ConstraintsIn International Conference on Embedded Software and Systems, ICESS ’09, Hangzhou, Zhejiang, P. R. China, May 25-27, 2009 , 2009
- A Lazy Unbounded Model Checker for Event-BIn Formal Methods and Software Engineering, 11th International Conference on Formal Engineering Methods, ICFEM 2009, Rio de Janeiro, Brazil, December 9-12, 2009. Proceedings , 2009
- On Solving Boolean Multilevel Optimization ProblemseIn IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009 , 2009
- SMT-Based Bounded Model Checking for Embedded ANSI-C SoftwareIn ASE 2009, 24th IEEE/ACM International Conference on Automated Software Engineering, Auckland, New Zealand, November 16-20, 2009 , 2009
- Algorithms for Weighted Boolean OptimizationIn Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings , 2009
- Conflict-Driven Clause Learning SAT SolversIn Handbook of Satisfiability , 2009
- Algorithms for Weighted Boolean OptimizationCoRR, 2009
- On Solving Boolean Multilevel Optimization ProblemsCoRR, 2009
- SMT-Based Bounded Model Checking for Embedded ANSI-C SoftwareCoRR, 2009
- Algorithms for finding dispensable variablesCoRR, 2009
- How to Complete an Interactive Configuration Process?CoRR, 2009
- Industrial-Strength Formally Certified SAT SolvingCoRR, 2009
- Continuous Verification of Large Embedded Software using SMT-Based Bounded Model CheckingCoRR, 2009
2008
- Boosting Haplotype Inference with Local SearchConstraints An Int. J., 2008
- Haplotype Inference with Boolean SatisfiabilityInt. J. Artif. Intell. Tools, 2008
- Model checking with Boolean SatisfiabilityJ. Algorithms, 2008
- Model Checking Event-B by Encoding into AlloyIn Abstract State Machines, B and Z, First International Conference, ABZ 2008, London, UK, September 16-18, 2008. Proceedings , 2008
- Efficient Haplotype Inference with Combined CP and OR TechniquesIn Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 5th International Conference, CPAIOR 2008, Paris, France, May 20-23, 2008, Proceedings , 2008
- Algorithms for Maximum Satisfiability using Unsatisfiable CoresIn Design, Automation and Test in Europe, DATE 2008, Munich, Germany, March 10-14, 2008 , 2008
- A MAX-SAT Algorithm PortfolioIn ECAI 2008 - 18th European Conference on Artificial Intelligence, Patras, Greece, July 21-25, 2008, Proceedings , 2008
- On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean OptimizationIn Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, May 15-17, 2008, Coconut Grove, Florida, USA , 2008
- Haplotype Inference with Boolean Constraint Solving: An OverviewIn 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), November 3-5, 2008, Dayton, Ohio, USA, Volume 1 , 2008
- Symmetry Breaking for Maximum SatisfiabilityIn Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings , 2008
- Combinatorial Optimization Solutions for the Maximum Quartet Consistency ProblemIn Proceedings of the 15th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, Udine, Italy, December 12-13, 2008 , 2008
- Improvements to Hybrid Incremental SAT AlgorithmsIn Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings , 2008
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability AlgorithmsIn Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings , 2008
- BacktrackingIn Wiley Encyclopedia of Computer Science and Engineering , 2008
- Symmetry Breaking for Maximum SatisfiabilityCoRR, 2008
- A Pseudo-Boolean Solution to the Maximum Quartet Consistency ProblemCoRR, 2008
- Model Checking Event-B by Encoding into AlloyCoRR, 2008
2007
- Report on the SAT 2007 Conference on Theory and Applications of Satisfiability TestingAI Mag., 2007
- Random backtracking in backtrack search algorithms for satisfiabilityDiscret. Appl. Math., 2007
- Efficient Haplotype Inference with Pseudo-boolean OptimizationIn Algebraic Biology, Second International Conference, AB 2007, Castle of Hagenberg, Austria, July 2-4, 2007, Proceedings , 2007
- Towards Robust CNF Encodings of Cardinality ConstraintsIn Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings , 2007
- Efficient and Tight Upper Bounds for Haplotype Inference by Pure Parsimony Using Delayed Haplotype SelectionIn Progress in Artificial Intelligence, 13th Portuguese Conference on Aritficial Intelligence, EPIA 2007, Workshops: GAIW, AIASTS, ALEA, AMITA, BAOSW, BI, CMBSB, IROBOT, MASTA, STCS, and TEMA, Guimarães, Portugal, December 3-7, 2007, Proceedings , 2007
- Towards Equivalence Checking Between TLM and RTL ModelsIn 5th ACM & IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE 2007), May 30 - June 1st, Nice, France , 2007
- Breaking Symmetries in SAT Matrix ModelsIn Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings , 2007
- Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings2007
- On Using Unsatisfiability for Solving Maximum SatisfiabilityCoRR, 2007
2006
- On Using Cutting Planes in Pseudo-Boolean OptimizationJ. Satisf. Boolean Model. Comput., 2006
- Efficient Haplotype Inference with Boolean SatisfiabilityIn Proceedings, The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference, July 16-20, 2006, Boston, Massachusetts, USA , 2006
- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean KernelIn Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings , 2006
- SAT in Bioinformatics: Making the Case with Haplotype InferenceIn Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings , 2006
- Counting Models in Integer DomainsIn Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings , 2006
- Interpolant Learning and Reuse in SAT-Based Model CheckingIn Proceedings of the Fourth International Workshop on Bounded Model Checking, BMC@FLoC 2006, Seattle, WA, USA, August 15, 2006 , 2006
2005
- Efficient data structures for backtrack search SAT solversAnn. Math. Artif. Intell., 2005
- Heuristic-Based Backtracking Relaxation for Propositional SatisfiabilityJ. Autom. Reason., 2005
- Improvements to the Implementation of Interpolant-Based Model CheckingIn Correct Hardware Design and Verification Methods, 13th IFIP WG 10.5 Advanced Research Working Conference, CHARME 2005, Saarbrücken, Germany, October 3-6, 2005, Proceedings , 2005
- Effective Lower Bounding Techniques for Pseudo-Boolean OptimizationIn 2005 Design, Automation and Test in Europe Conference and Exposition (DATE 2005), 7-11 March 2005, Munich, Germany , 2005
- Good Learning and Implicit Model EnumerationIn 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2005), 14-16 November 2005, Hong Kong, China , 2005
- Satisfiability-Based Algorithms for Pseudo-Boolean Optimization Using Gomory Cuts and Search RestartsIn 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2005), 14-16 November 2005, Hong Kong, China , 2005
- On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean OptimizationIn Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings , 2005
- A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable FormulasIn Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings , 2005
2004
- Satisfiability-Based Algorithms for Boolean OptimizationAnn. Math. Artif. Intell., 2004
- Hidden Structure in Unsatisfiable Random 3-SAT: An Empirical StudyIn 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 15-17 November 2004, Boca Raton, FL, USA , 2004
- Integration of Lower Bound Estimates in Pseudo-Boolean OptimizationIn 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 15-17 November 2004, Boca Raton, FL, USA , 2004
- Using Rewarding Mechanisms for Improving Branching HeuristicsIn SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings , 2004
- On Computing Minimum Unsatisfiable CoresIn SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings , 2004
- Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean OptimizationIn SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings , 2004
2003
- An Overview of Backtrack Search Satisfiability AlgorithmsAnn. Math. Artif. Intell., 2003
- Solving Satisfiability in Combinational CircuitsIEEE Des. Test Comput., 2003
- Heuristic-Based Backtracking for Propositional SatisfiabilityIn Progress in Artificial Intelligence, 11th Protuguese Conference on Artificial Intelligence, EPIA 2003, Beja, Portugal, December 4-7, 2003, Proceedings , 2003
- Probing-Based Preprocessing Techniques for Propositional SatisfiabilityIn 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), 3-5 November 2003, Sacramento, California, USA , 2003
- Heuristic Backtracking Algorithms for SATIn Fourth International Workshop on Microprocessor Test and Verification, Common Challenges and Solutions (MTV 2003), May 29-30, 2003, Hyatt Town Lake Hotel, Austin, Texas, USA , 2003
2002
- Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problemIEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2002
- Satisfiability models and algorithms for circuit delay computationACM Trans. Design Autom. Electr. Syst., 2002
- The Effect of Nogood Recording in DPLL-CBJ SAT AlgorithmsIn Recent Advances in Constraints, Joint ERCIM/CologNet International Workshop on Constraint Solving and Constraint Logic Programming, Cork, Ireland, June 19-21, 2002. Selected Papers , 2002
- Tuning Randomization in Backtrack Search SAT AlgorithmsIn Principles and Practice of Constraint Programming - CP 2002, 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings , 2002
- Building State-of-the-Art SAT SolversIn Proceedings of the 15th European Conference on Artificial Intelligence, ECAI’2002, Lyon, France, July 2002 , 2002
2001
- Stochastic Systematic Search Algorithms for SatisfiabilityElectron. Notes Discret. Math., 2001
- Efficient Algorithms for the Inference of Minimum Size DFAsMach. Learn., 2001
- An exact solution to the minimum size test pattern problemACM Trans. Design Autom. Electr. Syst., 2001
- Improving SAT Algorithms by Using Search Pruning TechniquesIn Principles and Practice of Constraint Programming - CP 2001, 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings , 2001
- Towards Provably Complete Stochastic Search Algorithms for SatisfiabilityIn Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving, 10th Portuguese Conference on Artificial Intelligence, EPIA 2001, Porto, Portugal, December 17-20, 2001, Proceedings , 2001
2000
- On Solving Boolean Optimization with Satisfiability-Based AlgorithmsIn International Symposium on Artificial Intelligence and Mathematics, AI&M 2000, Fort Lauderdale, Florida, USA, January 5-7, 2000 , 2000
- Invited Tutorial: Boolean Satisfiability Algorithms and Applications in Electronic Design AutomationIn Computer Aided Verification, 12th International Conference, CAV 2000, Chicago, IL, USA, July 15-19, 2000, Proceedings , 2000
- Using Randomization and Learning to Solve Hard Real-World Instances of SatisfiabilityIn Principles and Practice of Constraint Programming - CP 2000, 6th International Conference, Singapore, September 18-21, 2000, Proceedings , 2000
- Algebraic Simplification Techniques for Propositional SatisfiabilityIn Principles and Practice of Constraint Programming - CP 2000, 6th International Conference, Singapore, September 18-21, 2000, Proceedings , 2000
- Boolean satisfiability in electronic design automationIn Proceedings of the 37th Conference on Design Automation, Los Angeles, CA, USA, June 5-9, 2000 , 2000
- On Using Satisfiability-Based Pruning Techniques in Covering AlgorithmsIn 2000 Design, Automation and Test in Europe (DATE 2000), 27-30 March 2000, Paris, France , 2000
- On Applying Incremental Satisfiability to Delay Fault TestingIn 2000 Design, Automation and Test in Europe (DATE 2000), 27-30 March 2000, Paris, France , 2000
- An Experimental Study of Satisfiability Search HeuristicsIn 2000 Design, Automation and Test in Europe (DATE 2000), 27-30 March 2000, Paris, France , 2000
- Search Pruning Conditions for Boolean OptimizationIn ECAI 2000, Proceedings of the 14th European Conference on Artificial Intelligence, Berlin, Germany, August 20-25, 2000 , 2000
1999
- GRASP: A Search Algorithm for Propositional SatisfiabilityIEEE Trans. Computers, 1999
- Combinational Equivalence Checking Using Satisfiability and Recursive LearningIn 1999 Design, Automation and Test in Europe (DATE ’99), 9-12 March 1999, Munich, Germany , 1999
- Algorithms for Solving Boolean Satisfiability in Combinational CircuitsIn 1999 Design, Automation and Test in Europe (DATE ’99), 9-12 March 1999, Munich, Germany , 1999
- The Impact of Branching Heuristics in Propositional Satisfiability AlgorithmsIn Progress in Artificial Intelligence, 9th Portuguese Conference on Artificial Intelligence, EPIA ’99, Évora, Portugal, September 21-24, 1999, Proceedings , 1999
- On Applying Set Covering Models to Test Set CompactionIn 9th Great Lakes Symposium on VLSI (GLS-VLSI ’99), 4-6 March 1999, Ann Arbor, MI, USA , 1999
- Satisfiability-Based Functional Delay Fault TestingIn VLSI: Systems on a Chip, IFIP TC10/WG10.5 Tenth International Conference on Very Large Scale Integration (VLSI ’99), December 1-4, 1999, Lisbon, Portugal , 1999
- Test pattern generation for width compression in BISTIn Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30 - June 2, 1999 , 1999
- Assignment and Reordering of Incompletely Specified Pattern Sequences Targetting Minimum Power DissipationIn 12th International Conference on VLSI Design (VLSI Design 1999), 10-13 January 1999, Goa, India , 1999
1998
- Integer Programming Models for Optimization Problems in Test GenerationIn Proceedings of the ASP-DAC ’98, Asia and South Pacific Design Automation Conference 1998, Pacifico Yokohama, Yokohama, Japan, February 10-13, 1998 , 1998
- An exact solution to the minimum size test pattern problemIn International Conference on Computer Design: VLSI in Computers and Processors, ICCD 1998, Proceedings, 5-7 October, 1998, Austin, TX, USA , 1998
- Timing analysis using propositional satisfiabilityIn 5th IEEE International Conference on Electronics, Circuits and Systems, ICECS 1998, Surfing the Waves of Science and Technology, Lisbon, Portugal, September 7-10, 1998 , 1998
- Efficient Search Techniques for the Inference of Minimum Size Finite AutomataIn String Processing and Information Retrieval: A South American Symposium, SPIRE 1998, Santa Cruz de la Sierra Bolivia, September 9-11, 1998 , 1998
1997
- Robust Search Algorithms for Test Pattern GenerationIn Digest of Papers: FTCS-27, The Twenty-Seventh Annual International Symposium on Fault-Tolerant Computing, Seattle, Washington, USA, June 24-27, 1997 , 1997
- Prime Implicant Computation Using Satisfiability AlgorithmsIn 9th International Conference on Tools with Artificial Intelligence, ICTAI ’97, Newport Beach, CA, USA, November 3-8, 1997 , 1997
1996
- Ravel-XL: a hardware accelerator for assigned-delay compiled-code logic gate simulationIEEE Trans. Very Large Scale Integr. Syst., 1996
- GRASP - a new search algorithm for satisfiabilityIn Proceedings of the 1996 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1996, San Jose, CA, USA, November 10-14, 1996 , 1996
- Conflict Analysis in Search Algorithms for SatisfiabilityIn Eigth International Conference on Tools with Artificial Intelligence, ICTAI ’96, Toulouse, France, November 16-19, 1996 , 1996
1994
- Dynamic Search-Space Pruning Techniques in Path SensitizationIn Proceedings of the 31st Conference on Design Automation, San Diego, California, USA, June 6-10, 1994 , 1994
- Efficient and Robust Test Generation-Based Timing AnalysisIn 1994 IEEE International Symposium on Circuits and Systems, ISCAS 1994, London, England, UK, May 30 - June 2, 1994 , 1994
1993
- Concurrent path sensitization in timing analysisIn Proceedings of the European Design Automation Conference 1993, EURO-DAC ’93 with EURO-VHDL’93, Hamburg, Germany, September 20-24, 1993 , 1993
- An Analysis of Path Sensitization CriteriaIn Proceedings 1993 International Conference on Computer Design: VLSI in Computers & Processors, ICCD ’93, Cambridge, MA, USA, October 3-6, 1993 , 1993
- Ravel-XL: A Hardware Accelerator for Assigned-Delay Compiled-Code Logic Gate SimulationIn Proceedings 1993 International Conference on Computer Design: VLSI in Computers & Processors, ICCD ’93, Cambridge, MA, USA, October 3-6, 1993 , 1993
1991
- FPD - An Environment for Exact Timing AnalysisIn 1991 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1993, Santa Clara, CA, USA, November 11-14, 1991. Digest of Technical Papers , 1991