Extension and equivalence problems for clause minimal formulae
From MaRDI portal
Publication:1777408
DOI10.1007/s10472-005-0435-3zbMath1099.68041MaRDI QIDQ1777408
Hans Kleine Büning, Zhao, Xishun
Publication date: 13 May 2005
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-005-0435-3
68Q25: Analysis of algorithms and problem complexity
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Redundancy in logic. II: 2CNF and Horn propositional formulae, Redundancy in logic. III: Non-monotonic reasoning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
- The complexity of facets resolved
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
- Bounded Query Classes
- Minimal Representation of Directed Hypergraphs