The following pages link to (Q4488342):
Displaying 50 items.
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Quantifier reordering for QBF (Q287386) (← links)
- A decomposition method for CNF minimality proofs (Q392185) (← links)
- Boolean functions with a simple certificate for CNF complexity (Q412324) (← links)
- Construction and learnability of canonical Horn formulas (Q415621) (← links)
- Reasoning about visibility (Q420853) (← links)
- Learning definite Horn formulas from closure queries (Q507524) (← links)
- Constraint acquisition (Q511791) (← links)
- Logic-based ontology comparison and module extraction, with an application to DL-Lite (Q622105) (← links)
- A logic-based approach to polymer sequence analysis (Q655183) (← links)
- Producing and verifying extremely large propositional refutations (Q694550) (← links)
- The complexity of variable minimal formulas (Q708020) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- Solving peptide sequencing as satisfiability (Q929155) (← links)
- Models and quantifier elimination for quantified Horn formulas (Q944709) (← links)
- Exclusive and essential sets of implicates of Boolean functions (Q968115) (← links)
- A new 3-CNF transformation by parallel-serial graphs (Q976123) (← links)
- Satisfiability of mixed Horn formulas (Q997066) (← links)
- Backdoor sets of quantified Boolean formulas (Q1040783) (← links)
- Optimizing propositional calculus formulas with regard to questions of deducibility (Q1117918) (← links)
- Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- Generalizations of matched CNF formulas (Q1777405) (← links)
- Extension and equivalence problems for clause minimal formulae (Q1777408) (← links)
- Resolution deduction to detect satisfiability for another class including non-Horn sentences in propositional logic (Q1819946) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
- On conversions from CNF to ANF (Q2307626) (← links)
- Directed hypergraphs and Horn minimization (Q2404615) (← links)
- Boolean functions with long prime implicants (Q2445231) (← links)
- On the computational consequences of independence in propositional logic (Q2500830) (← links)
- Boolean functions as models for quantified Boolean formulas (Q2642467) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
- Total space in resolution (Q2829448) (← links)
- Failed Literal Detection for QBF (Q3007688) (← links)
- Generalized Conflict-Clause Strengthening for Satisfiability Solvers (Q3007694) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- Small Resolution Proofs for QBF using Dependency Treewidth (Q3304126) (← links)
- A CNF Class Generalizing Exact Linear Formulas (Q3502711) (← links)
- Combinatorial Problems for Horn Clauses (Q3655139) (← links)
- Backdoors into Two Occurrences (Q5014282) (← links)
- Ground Interpolation for Combined Theories (Q5191102) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- Recognizing read-once functions from depth-three formulas (Q5915579) (← links)
- Exploiting Database Management Systems and Treewidth for Counting (Q6063876) (← links)
- Inductive definitions in logic versus programs of real-time cellular automata (Q6122593) (← links)
- On the benefits of knowledge compilation for feature-model analyses (Q6630715) (← links)
