Pages that link to "Item:Q2908839"
From MaRDI portal
The following pages link to Satisfiability of acyclic and almost acyclic CNF formulas (Q2908839):
Displaying 12 items.
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints (Q269503) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Understanding model counting for \(\beta\)-acyclic CNF-formulas (Q2954991) (← links)
- Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (Q3007673) (← links)
- Recognition of Nested Gates in CNF Formulas (Q3453230) (← links)
- A SAT-Based Decision Procedure for the Subclass of Unrollable List Formulas in ACL2 (SULFA) (Q3613427) (← links)
- Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (Q3637160) (← links)
- (Q4375762) (← links)
- AC complement problems: Satisfiability and negation elimination (Q5055807) (← links)
- Theory and Applications of Satisfiability Testing (Q5325876) (← links)
- A CNF Formula Hierarchy over the Hypercube (Q5385533) (← links)