The Helly property and satisfiability of Boolean formulas defined on set families
From MaRDI portal
Publication:966161
DOI10.1016/j.ejc.2009.03.022zbMath1202.68392OpenAlexW1981947400MaRDI QIDQ966161
Victor Chepoi, Nadia Creignou, Gernot Salzer, Miki Hermann
Publication date: 27 April 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2009.03.022
Related Items (2)
An algorithm for random signed 3-SAT with intervals ⋮ A first polynomial non-clausal class in many-valued logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extension of uniformly continuous transformations and hyperconvex metric spaces
- Clique graphs and Helly graphs
- Gated sets in metric spaces
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- On generating all maximal independent sets
- Dismantling absolute retracts of reflexive graphs
- Median graphs and Helly hypergraphs
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- The smallest graph variety containing all paths
- Resolution-based theorem proving for many-valued logics
- Six theorems about injective metric spaces
- A characterization of clique graphs
- Complexity Classifications of Boolean Constraint Satisfaction Problems
- Metric Ternary Distributive Semi-Lattices
- A dichotomy theorem for constraint satisfaction problems on a 3-element set
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The complexity of satisfiability problems
- Bottleneck extrema
This page was built for publication: The Helly property and satisfiability of Boolean formulas defined on set families
