The following pages link to The complexity of facets resolved (Q1109565):
Displaying 50 items.
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases (Q459042) (← links)
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- Removing redundancy from a clause (Q685346) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- The complexity of variable minimal formulas (Q708020) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Density condensation of Boolean formulas (Q860385) (← links)
- On getting rid of the preprocessing minimization step in MUC-finding algorithms (Q903912) (← links)
- Computational complexity of quantified Boolean formulas with fixed maximal deficiency (Q955019) (← links)
- An upper bound for the circuit complexity of existentially quantified Boolean formulas (Q982657) (← links)
- A simplified way of proving trade-off results for resolution (Q989569) (← links)
- An approach for extracting a small unsatisfiable core (Q1028724) (← links)
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642) (← links)
- Using local search to find MSSes and MUSes (Q1042194) (← links)
- Better approximations of non-Hamiltonian graphs (Q1382268) (← links)
- On the structure of some classes of minimal unsatisfiable formulas (Q1408380) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
- Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
- Using inconsistency measures for estimating reliability (Q1680689) (← links)
- Finding read-once resolution refutations in systems of 2CNF clauses (Q1749535) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- The complexity of homomorphisms and renamings for minimal unsatisfiable formulas (Q1777396) (← links)
- Extension and equivalence problems for clause minimal formulae (Q1777408) (← links)
- On subclasses of minimal unsatisfiable formulas (Q1841884) (← links)
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) (← links)
- Two tractable subclasses of minimal unsatisfiable formulas (Q1961649) (← links)
- Semantic relevance (Q2104509) (← links)
- Complexity of stability (Q2237893) (← links)
- Strong inconsistency (Q2321259) (← links)
- On the complexity of inconsistency measurement (Q2321337) (← links)
- Local-search extraction of mUSes (Q2385174) (← links)
- Redundancy in logic. II: 2CNF and Horn propositional formulae (Q2389621) (← links)
- Redundancy in logic. III: Non-monotonic reasoning (Q2389660) (← links)
- Localising iceberg inconsistencies (Q2407883) (← links)
- Redundancy in logic. I: CNF propositional formulae (Q2457681) (← links)
- On the complexity of non-unique probe selection (Q2474080) (← links)
- How to recycle your facets (Q2506820) (← links)
- The complexity of recognizing minimally tough graphs (Q2656956) (← links)
- Computing smallest MUSes of quantified Boolean formulas (Q2694579) (← links)
- On the Complexity of Semantic Self-minimization (Q2810966) (← links)
- Complexity Classifications for Logic-Based Argumentation (Q2946726) (← links)
- On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas (Q2988835) (← links)
- Faster Extraction of High-Level Minimal Unsatisfiable Cores (Q3007682) (← links)
- DP-Complete Problems Derived from Extremal NP-Complete Properties (Q3182925) (← links)
- A FRAMEWORK FOR HANDLING LOGICAL INCONSISTENCIES IN THE FUSION OF BOOLEAN KNOWLEDGE BASES (Q3225383) (← links)
