• Publications
  • Influence
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
TLDR
'Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic, applied areas such as planning, scheduling, operations research and combinatorial optimization, but also theoretical issues on the theme of complexity and much more, they all are connected through SAT. Expand
  • 473
  • 56
Handbook of satisfiability
TLDR
'Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic, applied areas such as planning, scheduling, operations research and combinatorial optimization, but also theoretical issues on the theme of complexity and much more, they all are connected through SAT. Expand
  • 544
  • 39
  • PDF
DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
TLDR
The DRAT-trim tool is a satisfiability proof checker based on the new DRAT proof format which combines the previous DRUP and RAT formats. Expand
  • 135
  • 18
  • PDF
Inprocessing Rules
TLDR
We establish formal underpinnings of inprocessing SAT solving via an abstract inprocessing framework that covers a wide range of modern SAT solving techniques. Expand
  • 166
  • 16
  • PDF
Blocked Clause Elimination
TLDR
We study the effect of a CNF-level simplification technique called blocked clause elimination (BCE) on CNFs resulting from a standard CNF encoding for circuits. Expand
  • 123
  • 13
  • PDF
Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads
TLDR
Satisfiability (SAT) solvers have become very powerful tools to tackle problems ranging from industrial formal verification to hard combinatorial challenges. Expand
  • 109
  • 12
  • PDF
Exact DFA Identification Using SAT Solvers
TLDR
We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Expand
  • 85
  • 11
  • PDF
Trimming while checking clausal proofs
TLDR
We present the tool DRUP-trim that can efficiently check clausal proofs and can produce additional results including unsatisfiable cores and reduced clausal proof. Expand
  • 85
  • 9
  • PDF
Clause Elimination for SAT and QSAT
TLDR
The famous archetypical NP-complete problem of Boolean satisfiability (SAT) is the problem of determining whether a given propositional logic formula has a solution. Expand
  • 54
  • 8
  • PDF
Static Detection of DoS Vulnerabilities in Programs that Use Regular Expressions
TLDR
This paper proposes a technique for automatically finding ReDoS vulnerabilities in programs that use regular expressions. Expand
  • 19
  • 8
  • PDF