Super-Blocked Clauses (Q2817910)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Super-Blocked Clauses	scientific article

Statements

scholarly article

0 references

Super-Blocked Clauses (English)

0 references

0 references

0 references

0 references

0 references

Automated Reasoning

0 references

publication date

5 September 2016

0 references

full work available at URL

http://resolver.obvsg.at/urn:nbn:at:at-ubtuw:3-3044

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Playing with AVATAR

0 references

Simulating circuit-level simplifications on CNF

0 references

Clause Elimination for SAT and QSAT

0 references

Inprocessing Rules

0 references

Soundness of Inprocessing in Clause Sharing SAT Solvers

0 references

Blocked Clause Decomposition

0 references

Recognition of Nested Gates in CNF Formulas

0 references

Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask)

0 references

On a generalization of extended resolution

0 references

Blocked Clause Elimination

0 references

Verifying Refutations with Extended Resolution

0 references

Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-40229-1_5

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2817910

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2817910&oldid=36271302"