#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2009

2014

- This year (0)
- Last 5 years (9)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
- ECAI
- 2010

- Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
- LPAR
- 2013

- Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
- 2011 IEEE 23rd International Conference on Tools…
- 2011

The recently introduced DPLL (XOR) framework for deciding satisfiability of propositional formulas with parity constraints is studied. A new parity reasoning module, based on equivalence class manipulation, is developed and implementation techniques for it described. It is shown that the deduction power of the new module is equivalent to another one… (More)

- Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
- SAT
- 2012

Modern conflict-driven clause learning (CDCL) SAT solvers are very good in solving conjunctive normal form (CNF) formulas. However, some application problems involve lots of parity (xor) constraints which are not necessarily efficiently handled if translated into CNF. This paper studies solving CNF formulas augmented with xor-clauses in the DPLL(XOR)… (More)

Instances of logical cryptanalysis, circuit verification, and bounded model checking can often be succinctly represented as a combined satisfiability (SAT) problem where an instance is a combination of traditional clauses and parity constraints. This paper studies how such combined problems can be efficiently solved by augmenting a modern SAT solver with an… (More)

- Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
- 2012 IEEE 24th International Conference on Tools…
- 2012

Instances of logical cryptanalysis, circuit verification, and bounded model checking can often be succinctly represented as a combined satisfiability (SAT) problem where an instance is a combination of traditional clauses and parity constraints. This paper studies how such combined problems can be efficiently solved by augmenting a modern SAT solver with an… (More)

- Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
- ArXiv
- 2013

Propositional satisfiability (SAT) solvers, which typically operate using conjunctive normal form (CNF), have been successfully applied in many domains. However, in some application areas such as circuit verification, bounded model checking, and logical cryptanalysis, instances can have many parity (xor) constraints which may not be handled efficiently if… (More)

- Tero Laitinen
- 2010

Current methods for solving Boolean satisfiability problem (SAT) are scalable enough to solve discrete nonlinear problems involving hundreds of thousands of variables. However, modern SAT solvers scale poorly with problems involving parity constraints (linear equations modulo 2). Gaussian elimination can be used to solve a system of linear equation… (More)

- Tero Laitinen, Tommi A. Junttila, Ilkka Niemelä
- ArXiv
- 2014

Modern conflict-driven clause learning (CDCL) SAT solvers are very good in solving conjunctive normal form (CNF) formulas. However, some application problems involve lots of parity (xor) constraints which are not necessarily efficiently handled if translated into CNF. This paper studies solving CNF formulas augmented with xor-clauses in the DPLL(XOR)… (More)