Pages that link to "Item:Q1887137"

The following pages link to The complexity of minimal satisfiability problems (Q1887137):

Displaying 31 items.

• On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
• On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
• On the parameterized complexity of non-monotonic logics (Q494658) (← links)
• On the Boolean connectivity problem for Horn relations (Q608293) (← links)
• The complexity of circumscriptive inference in Post's lattice (Q692903) (← links)
• Trichotomies in the complexity of minimal inference (Q692908) (← links)
• Filter-based resolution principle for lattice-valued propositional logic LP\((X)\) (Q867665) (← links)
• A dichotomy theorem for maximum generalized satisfiability problems. (Q960525) (← links)
• On the counting complexity of propositional circumscription (Q963360) (← links)
• The complexity of minimum partial truth assignments and implication in negation-free formulae (Q1380416) (← links)
• Optimizing with minimum satisfiability (Q1761303) (← links)
• The complexity of homomorphisms and renamings for minimal unsatisfiable formulas (Q1777396) (← links)
• Graph-based construction of minimal models (Q2093381) (← links)
• Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem (Q2221799) (← links)
• Isomorphic implication (Q2272203) (← links)
• Minimal inference problem over finite domains: the landscape of complexity (Q2401929) (← links)
• (Q2762521) (← links)
• On the complexity of semantic self-minimization (Q2810966) (← links)
• Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
• (Q3783561) (← links)
• A Complexity Index for Satisfiability Problems (Q4286227) (← links)
• Complexity of satisfiability problems with symmetric polynomial clauses (Q4344698) (← links)
• (Q4443550) (← links)
• The Complexity of the<i>A B C</i>Problem (Q4507329) (← links)
• The Complexity of Minimal Inference Problem for Conservative Constraint Languages (Q4633640) (← links)
• (Q4941907) (← links)
• On the hardness of approximating the minimum consistent OBDD problem (Q5054808) (← links)
• Dörfler marking with minimal cardinality is a linear complexity problem (Q5118851) (← links)
• Mathematical Foundations of Computer Science 2004 (Q5311102) (← links)
• Parameterized and Exact Computation (Q5311504) (← links)
• Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)