João Marques-Silva

According to our database1, João Marques-Silva authored at least 246 papers between 1991 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Optimum stable model search: algorithms and implementation.
J. Log. Comput., 2020

Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay.
CoRR, 2020

Reasoning About Strong Inconsistency in ASP.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Reasoning About Inconsistent Formulas.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Branch Location Problems with Maximum Satisfiability.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Towards Formal Fairness in Machine Learning.
Proceedings of the Principles and Practice of Constraint Programming, 2020

2019
RC2: an Efficient MaxSAT Solver.
J. Satisf. Boolean Model. Comput., 2019

Formally Verifying the Solution to the Boolean Pythagorean Triples Problem.
J. Autom. Reason., 2019

From Shallow to Deep Interactions Between Knowledge Representation, Reasoning and Machine Learning (Kay R. Amel group).
CoRR, 2019

On Validating, Repairing and Refining Heuristic ML Explanations.
CoRR, 2019

Assessing Heuristic Machine Learning Explanations with Model Counting.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

DRMaxSAT with MaxHS: First Contact.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

On Computing the Union of MUSes.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

On Relating Explanations and Adversarial Examples.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Efficient Symmetry Breaking for SAT-Based Minimum DFA Inference.
Proceedings of the Language and Automata Theory and Applications, 2019

Model-Based Diagnosis with Multiple Observations.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Computing Shortest Resolution Proofs.
Proceedings of the Progress in Artificial Intelligence, 2019

Abduction-Based Explanations for Machine Learning Models.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Propositional SAT Solving.
Proceedings of the Handbook of Model Checking., 2018

PySAT: A Python Toolkit for Prototyping with SAT Oracles.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Learning Optimal Decision Trees with SAT.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Computing with SAT Oracles: Past, Present and Future.
Proceedings of the Sailing Routes in the World of Computation, 2018

A SAT-Based Approach to Learn Explainable Decision Sets.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

Premise Set Caching for Enumerating Minimal Correction Subsets.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

MaxSAT Resolution With the Dual Rail Encoding.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Exact and Hybrid Solutions for the Multi-Objective VM Reassignment Problem.
Int. J. Artif. Intell. Tools, 2017

Horn Maximum Satisfiability: Reductions, Algorithms & Applications.
CoRR, 2017

Model Based Diagnosis of Multiple Observations with Implicit Hitting Sets.
CoRR, 2017

Minimal sets on propositional formulae. Problems and reductions.
Artif. Intell., 2017

Efficient Certified Resolution Proof Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Improving MCS Enumeration via Caching.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

On Tackling the Limits of Resolution in SAT Solving.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Cardinality Encodings for Graph Optimization Problems.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

On Computing Generalized Backbones.
Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

Lean Kernels in Description Logics.
Proceedings of the Semantic Web - 14th International Conference, 2017

Horn Maximum Satisfiability: Reductions, Algorithms and Applications.
Proceedings of the Progress in Artificial Intelligence, 2017

An Achilles' Heel of Term-Resolution.
Proceedings of the Progress in Artificial Intelligence, 2017

Debugging EL+ Ontologies through Horn MUS Enumeration.
Proceedings of the 30th International Workshop on Description Logics, 2017

On Minimal Corrections in ASP.
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), 2017

2016
Fast, flexible MUS enumeration.
Constraints An Int. J., 2016

Quantified maximum satisfiability.
Constraints An Int. J., 2016

Reports of the 2016 AAAI Workshop Program.
AI Mag., 2016

Maximal falsifiability.
AI Commun., 2016

On the query complexity of selecting minimal sets for monotone predicates.
Artif. Intell., 2016

Solving QBF with counterexample guided refinement.
Artif. Intell., 2016

MCS Extraction with Sublinear Oracle Queries.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

BEACON: An Efficient SAT-Based Tool for Debugging <i>EL</i>^+ Ontologies.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Efficient Reasoning for Inconsistent Horn Formulae.
Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016

Propositional Abduction with Implicit Hitting Sets.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

On Finding Minimum Satisfying Assignments.
Proceedings of the Principles and Practice of Constraint Programming, 2016

Preface: The Beyond NP Workshop.
Proceedings of the Beyond NP, 2016

2015
Expansion-based QBF solving versus Q-resolution.
Theor. Comput. Sci., 2015

Towards Efficient Axiom Pinpointing of EL+ Ontologies.
CoRR, 2015

Algorithms for computing backbones of propositional formulae.
AI Commun., 2015

MaxSAT-based encodings for Group MaxSAT.
AI Commun., 2015

SAT-Based Horn Least Upper Bounds.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Computing Maximal Autarkies with Few and Simple Oracle Queries.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

SAT-Based Formula Simplification.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Efficient Axiom Pinpointing with EL2MCS.
Proceedings of the KI 2015: Advances in Artificial Intelligence, 2015

Prime Compilation of Non-Clausal Formulae.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Literal-Based MCS Extraction.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Efficient Model Based Diagnosis with Maximum Satisfiability.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Solving QBF by Clause Selection.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

MILP for the Multi-objective VM Reassignment Problem.
Proceedings of the 27th IEEE International Conference on Tools with Artificial Intelligence, 2015

Smallest MUS Extraction with Minimal Hitting Set Dualization.
Proceedings of the Principles and Practice of Constraint Programming, 2015

2014
MSCG: Robust Core-Guided MaxSAT Solving.
J. Satisf. Boolean Model. Comput., 2014

On the Query Complexity of Selecting Few Minimal Sets.
Electron. Colloquium Comput. Complex., 2014

Computing Minimal Sets on Propositional Formulae I: Problems & Reductions.
CoRR, 2014

Algorithms for computing minimal equivalent subformulas.
Artif. Intell., 2014

On lazy and eager interactive reconfiguration.
Proceedings of the Eighth International Workshop on Variability Modelling of Software-intensive Systems, 2014

Synthesizing Safe Bit-Precise Invariants.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2014

On Computing Preferred MUSes and MCSes.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

On Reducing Maximum Independent Set to Minimum Satisfiability.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

MUS Extraction Using Clausal Proofs.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form.
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014

Efficient Relaxations of Over-constrained CSPs.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Towards efficient optimization in package management systems.
Proceedings of the 36th International Conference on Software Engineering, 2014

Efficient Autarkies.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Timeout-Sensitive Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Progression in Maximum Satisfiability.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

A Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

Core-Guided MaxSAT with Soft Cardinality Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2014

SAT Solvers.
Proceedings of the Tractability: Practical Approaches to Hard Problems, 2014

2013
A Two-Variable Model for SAT-Based ATPG.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2013

On Propositional QBF Expansions and Q-Resolution.
Electron. Colloquium Comput. Complex., 2013

SAT-based Preprocessing for MaxSAT (extended version).
CoRR, 2013

Iterative and core-guided MaxSAT solving: A survey and assessment.
Constraints An Int. J., 2013

Formula Preprocessing in MUS Extraction.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Quantified Maximum Satisfiability: - A Core-Guided Approach.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Parallel MUS Extraction.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

On QBF Proofs and Preprocessing.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Maximal Falsifiability - Definitions, Algorithms, and Applications.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

SAT-Based Preprocessing for MaxSAT.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

On Computing Minimal Correction Subsets.
Proceedings of the IJCAI 2013, 2013

Model-Guided Approaches for MaxSAT Solving.
Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

Core minimization in SAT-based abstraction.
Proceedings of the Design, Automation and Test in Europe, 2013

Solving QBF with Free Variables.
Proceedings of the Principles and Practice of Constraint Programming, 2013

Minimal Sets over Monotone Predicates in Boolean Formulae.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

Partial MUS Enumeration.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
SMT-Based Bounded Model Checking for Embedded ANSI-C Software.
IEEE Trans. Software Eng., 2012

Computing Minimally Unsatisfiable Subformulas: State of the Art and Future Directions.
J. Multiple Valued Log. Soft Comput., 2012

PackUp: Tools for Package Upgradability Solving.
J. Satisf. Boolean Model. Comput., 2012

TG-Pro: A SAT-based ATPG System.
J. Satisf. Boolean Model. Comput., 2012

MUSer2: An Efficient MUS Extractor.
J. Satisf. Boolean Model. Comput., 2012

Hybrid Incremental Algorithms for Boolean Satisfiability.
Int. J. Artif. Intell. Tools, 2012

Generalizing Redundancy in Propositional Logic: Foundations and Hitting Sets Duality
CoRR, 2012

Towards efficient MUS extraction.
AI Commun., 2012

Knowledge Compilation with Empowerment.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Improvements to Core-Guided Binary Search for MaxSAT.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

On Efficient Computation of Variable MUSes.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Lower Bounds and Upper Bounds for MaxSAT.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

On Unit-Refutation Complete Formulae with Existentially Quantified Variables.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Iterative SAT Solving for Minimum Satisfiability.
Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

MaxSAT-Based MCS Enumeration.
Proceedings of the Hardware and Software: Verification and Testing, 2012

New & improved models for SAT-based bi-decomposition.
Proceedings of the Great Lakes Symposium on VLSI 2012, 2012

QBf-based boolean function bi-decomposition.
Proceedings of the 2012 Design, Automation & Test in Europe Conference & Exhibition, 2012

On Computing Minimal Equivalent Subformulas.
Proceedings of the Principles and Practice of Constraint Programming, 2012

An Empirical Study of Encodings for Group MaxSAT.
Proceedings of the Advances in Artificial Intelligence, 2012

2011
Restoring CSP Satisfiability with MaxSAT.
Fundam. Informaticae, 2011

Anatomy and Empirical Evaluation of Modern SAT Solvers.
Bull. EATCS, 2011

Lazy Decomposition for Distributed Decision Procedures
Proceedings of the Proceedings 10th International Workshop on Parallel and Distributed Methods in verifiCation, 2011

Haplotype inference with pseudo-Boolean optimization.
Ann. Oper. Res., 2011

Boolean lexicographic optimization: algorithms & applications.
Ann. Math. Artif. Intell., 2011

Improvements to Satisfiability-Based Boolean Function Bi-Decomposition.
Proceedings of the VLSI-SoC: Advanced Research for Systems on Chip, 2011

On Improving MUS Extraction Algorithms.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Empirical Study of the Anatomy of Modern Sat Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Abstraction-Based Algorithm for 2QBF.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Minimally Unsatisfiable Boolean Circuits.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

cmMUS: A Tool for Circumscription-Based MUS Membership Testing.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2011

Read-Once Resolution for Unsatisfiability-Based Max-SAT Algorithms.
Proceedings of the IJCAI 2011, 2011

On Validating Boolean Optimizers.
Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

Accelerating MUS extraction with recursive model rotation.
Proceedings of the International Conference on Formal Methods in Computer-Aided Design, 2011

On Deciding MUS Membership with QBF.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

Core-Guided Binary Search Algorithms for Maximum Satisfiability.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

Haplotype Inference Using Propositional Satisfiability.
Proceedings of the Mathematical Approaches to Polymer Sequence Analysis and Related Problems, 2011

2010
Automated Design Debugging With Maximum Satisfiability.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2010

Haplotype Inference by Pure Parsimony: A Survey.
J. Comput. Biol., 2010

Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem.
Fundam. Informaticae, 2010

Solving Linux Upgradeability Problems Using Boolean Optimization
Proceedings of the Proceedings First International Workshop on Logics for Component Configuration, 2010

How to Complete an Interactive Configuration Process?
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription.
Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010

Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper).
Proceedings of the 40th IEEE International Symposium on Multiple-Valued Logic, 2010

Industrial-Strength Certified SAT Solving through Verified SAT Proof Checking.
Proceedings of the Theoretical Aspects of Computing, 2010

Continuous Verification of Large Embedded Software Using SMT-Based Bounded Model Checking.
Proceedings of the 17th IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, 2010

On Computing Backbones of Propositional Theories.
Proceedings of the ECAI 2010, 2010

Boolean Lexicographic Optimization.
Proceedings of the 17th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2010

Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree Information.
Proceedings of the Algebraic and Numeric Biology - 4th International Conference, 2010

2009
Conflict-Driven Clause Learning SAT Solvers.
Proceedings of the Handbook of Satisfiability, 2009

Industrial-Strength Formally Certified SAT Solving
CoRR, 2009

Algorithms for finding dispensable variables
CoRR, 2009

On Solving Boolean Multilevel Optimization Problems
CoRR, 2009

A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas.
Constraints An Int. J., 2009

Algorithms for Weighted Boolean Optimization.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

On Solving Boolean Multilevel Optimization Problemse.
Proceedings of the IJCAI 2009, 2009

A Lazy Unbounded Model Checker for Event-B.
Proceedings of the Formal Methods and Software Engineering, 2009

Semiformal Verification of Embedded Software in Medical Devices Considering Stringent Hardware Constraints.
Proceedings of the International Conference on Embedded Software and Systems, 2009

TG-PRO: A new model for SAT-based ATPG.
Proceedings of the IEEE International High Level Design Validation and Test Workshop, 2009

Spatial and temporal design debug using partial MaxSAT.
Proceedings of the 19th ACM Great Lakes Symposium on VLSI 2009, 2009

2008
Backtracking.
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Model checking with Boolean Satisfiability.
J. Algorithms, 2008

Haplotype Inference with Boolean Satisfiability.
Int. J. Artif. Intell. Tools, 2008

A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem
CoRR, 2008

Boosting Haplotype Inference with Local Search.
Constraints An Int. J., 2008

Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms.
Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Improvements to Hybrid Incremental SAT Algorithms.
Proceedings of the Theory and Applications of Satisfiability Testing, 2008

Symmetry Breaking for Maximum Satisfiability.
Proceedings of the Logic for Programming, 2008

Haplotype Inference with Boolean Constraint Solving: An Overview.
Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization.
Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, 2008

A MAX-SAT Algorithm Portfolio.
Proceedings of the ECAI 2008, 2008

Algorithms for Maximum Satisfiability using Unsatisfiable Cores.
Proceedings of the Design, Automation and Test in Europe, 2008

Efficient Haplotype Inference with Combined CP and OR Techniques.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

Model Checking Event-B by Encoding into Alloy.
Proceedings of the Abstract State Machines, B and Z, First International Conference, 2008

2007
Interpolant Learning and Reuse in SAT-Based Model Checking.
Electron. Notes Theor. Comput. Sci., 2007

Random backtracking in backtrack search algorithms for satisfiability.
Discret. Appl. Math., 2007

On Using Unsatisfiability for Solving Maximum Satisfiability
CoRR, 2007

Report on the SAT 2007 Conference on Theory and Applications of Satisfiability Testing.
AI Mag., 2007

Breaking Symmetries in SAT Matrix Models.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Towards Equivalence Checking Between TLM and RTL Models.
Proceedings of the 5th ACM & IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE 2007), May 30, 2007

Efficient and Tight Upper Bounds for Haplotype Inference by Pure Parsimony Using Delayed Haplotype Selection.
Proceedings of the Progress in Artificial Intelligence, 2007

Towards Robust CNF Encodings of Cardinality Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2007

Efficient Haplotype Inference with Pseudo-boolean Optimization.
Proceedings of the Algebraic Biology, Second International Conference, 2007

2006
On Using Cutting Planes in Pseudo-Boolean Optimization.
J. Satisf. Boolean Model. Comput., 2006

Counting Models in Integer Domains.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

SAT in Bioinformatics: Making the Case with Haplotype Inference.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Efficient Haplotype Inference with Boolean Satisfiability.
Proceedings of the Proceedings, 2006

2005
Heuristic-Based Backtracking Relaxation for Propositional Satisfiability.
J. Autom. Reason., 2005

Efficient data structures for backtrack search SAT solvers.
Ann. Math. Artif. Intell., 2005

A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization.
Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Good Learning and Implicit Model Enumeration.
Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2005), 2005

Satisfiability-Based Algorithms for Pseudo-Boolean Optimization Using Gomory Cuts and Search Restarts.
Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2005), 2005

Effective Lower Bounding Techniques for Pseudo-Boolean Optimization.
Proceedings of the 2005 Design, 2005

Improvements to the Implementation of Interpolant-Based Model Checking.
Proceedings of the Correct Hardware Design and Verification Methods, 2005

2004
Satisfiability-Based Algorithms for Boolean Optimization.
Ann. Math. Artif. Intell., 2004

Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization.
Proceedings of the SAT 2004, 2004

On Computing Minimum Unsatisfiable Cores.
Proceedings of the SAT 2004, 2004

Using Rewarding Mechanisms for Improving Branching Heuristics.
Proceedings of the SAT 2004, 2004

Integration of Lower Bound Estimates in Pseudo-Boolean Optimization.
Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004

Hidden Structure in Unsatisfiable Random 3-SAT: An Empirical Study.
Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004

2003
Solving Satisfiability in Combinational Circuits.
IEEE Des. Test Comput., 2003

An Overview of Backtrack Search Satisfiability Algorithms.
Ann. Math. Artif. Intell., 2003

Heuristic Backtracking Algorithms for SAT.
Proceedings of the Fourth International Workshop on Microprocessor Test and Verification, 2003

Probing-Based Preprocessing Techniques for Propositional Satisfiability.
Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2003), 2003

Heuristic-Based Backtracking for Propositional Satisfiability.
Proceedings of the Progress in Artificial Intelligence, 2003

2002
Satisfiability models and algorithms for circuit delay computation.
ACM Trans. Design Autom. Electr. Syst., 2002

Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2002

Building State-of-the-Art SAT Solvers.
Proceedings of the 15th Eureopean Conference on Artificial Intelligence, 2002

Tuning Randomization in Backtrack Search SAT Algorithms.
Proceedings of the Principles and Practice of Constraint Programming, 2002

The Effect of Nogood Recording in DPLL-CBJ SAT Algorithms.
Proceedings of the Recent Advances in Constraints, 2002

2001
An exact solution to the minimum size test pattern problem.
ACM Trans. Design Autom. Electr. Syst., 2001

Efficient Algorithms for the Inference of Minimum Size DFAs.
Mach. Learn., 2001

Stochastic Systematic Search Algorithms for Satisfiability.
Electron. Notes Discret. Math., 2001

A Configurable Hardware/Software Approach to SAT Solving.
Proceedings of the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 2001

Towards Provably Complete Stochastic Search Algorithms for Satisfiability.
Proceedings of the Progress in Artificial Intelligence, 2001

Improving SAT Algorithms by Using Search Pruning Techniques.
Proceedings of the Principles and Practice of Constraint Programming, 2001

2000
Search Pruning Conditions for Boolean Optimization.
Proceedings of the ECAI 2000, 2000

An Experimental Study of Satisfiability Search Heuristics.
Proceedings of the 2000 Design, 2000

On Using Satisfiability-Based Pruning Techniques in Covering Algorithms.
Proceedings of the 2000 Design, 2000

On Applying Incremental Satisfiability to Delay Fault Testing.
Proceedings of the 2000 Design, 2000

Boolean satisfiability in electronic design automation.
Proceedings of the 37th Conference on Design Automation, 2000

Algebraic Simplification Techniques for Propositional Satisfiability.
Proceedings of the Principles and Practice of Constraint Programming, 2000

Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability.
Proceedings of the Principles and Practice of Constraint Programming, 2000

Invited Tutorial: Boolean Satisfiability Algorithms and Applications in Electronic Design Automation.
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

On Solving Boolean Optimization with Satisfiability-Based Algorithms.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2000

1999
GRASP: A Search Algorithm for Propositional Satisfiability.
IEEE Trans. Computers, 1999

Assignment and Reordering of Incompletely Specified Pattern Sequences Targetting Minimum Power Dissipation.
Proceedings of the 12th International Conference on VLSI Design (VLSI Design 1999), 1999

Test pattern generation for width compression in BIST.
Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999

Satisfiability-Based Functional Delay Fault Testing.
Proceedings of the VLSI: Systems on a Chip, 1999

On Applying Set Covering Models to Test Set Compaction.
Proceedings of the 9th Great Lakes Symposium on VLSI (GLS-VLSI '99), 1999

The Impact of Branching Heuristics in Propositional Satisfiability Algorithms.
Proceedings of the Progress in Artificial Intelligence, 1999

Algorithms for Solving Boolean Satisfiability in Combinational Circuits.
Proceedings of the 1999 Design, 1999

Combinational Equivalence Checking Using Satisfiability and Recursive Learning.
Proceedings of the 1999 Design, 1999

1998
Efficient Search Techniques for the Inference of Minimum Size Finite Automata.
Proceedings of the String Processing and Information Retrieval: A South American Symposium, 1998

Integer Programming Models for Optimization Problems in Test Generation.
Proceedings of the ASP-DAC '98, 1998

1997
Prime Implicant Computation Using Satisfiability Algorithms.
Proceedings of the 9th International Conference on Tools with Artificial Intelligence, 1997

Robust Search Algorithms for Test Pattern Generation.
Proceedings of the Digest of Papers: FTCS-27, 1997

1996
Ravel-XL: a hardware accelerator for assigned-delay compiled-code logic gate simulation.
IEEE Trans. Very Large Scale Integr. Syst., 1996

Conflict Analysis in Search Algorithms for Satisfiability.
Proceedings of the Eigth International Conference on Tools with Artificial Intelligence, 1996

GRASP - a new search algorithm for satisfiability.
Proceedings of the 1996 IEEE/ACM International Conference on Computer-Aided Design, 1996

1994
Efficient and Robust Test Generation-Based Timing Analysis.
Proceedings of the 1994 IEEE International Symposium on Circuits and Systems, ISCAS 1994, London, England, UK, May 30, 1994

Dynamic Search-Space Pruning Techniques in Path Sensitization.
Proceedings of the 31st Conference on Design Automation, 1994

1993
An Analysis of Path Sensitization Criteria.
Proceedings of the Proceedings 1993 International Conference on Computer Design: VLSI in Computers & Processors, 1993

Concurrent path sensitization in timing analysis.
Proceedings of the European Design Automation Conference 1993, 1993

1991
FPD - An Environment for Exact Timing Analysis.
Proceedings of the 1991 IEEE/ACM International Conference on Computer-Aided Design, 1991


  Loading...