Simulating circuit-level simplifications on CNF (Q352967): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Boolector / rank | |||
Normal rank | |||
Revision as of 10:26, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simulating circuit-level simplifications on CNF |
scientific article |
Statements
Simulating circuit-level simplifications on CNF (English)
0 references
5 July 2013
0 references
Boolean satisfiability
0 references
preprocessing
0 references
problem structure
0 references
blocked clauses
0 references
variable elimination
0 references
Boolean circuits
0 references
