Partitioning methods for satisfiability testing on large formulas (Q1854377): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1006/inco.1999.2860 / rank | |||
Property / cites work | |||
Property / cites work: A machine program for theorem-proving / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Computing Procedure for Quantification Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Directed hypergraphs and applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for testing the satisfiability of propositional formulae / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partitioning methods for satisfiability testing on large formulas / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5687274 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1006/INCO.1999.2860 / rank | |||
Normal rank |
Latest revision as of 10:29, 16 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Partitioning methods for satisfiability testing on large formulas |
scientific article |
Statements
Partitioning methods for satisfiability testing on large formulas (English)
0 references
14 January 2003
0 references