Publication:4263159
From MaRDI portal
zbMath0937.03019MaRDI QIDQ4263159
Publication date: 17 February 2000
NP-completeness; satisfiability problem; complexity analysis; equational problems; infinite Herbrand universe
68Q25: Analysis of algorithms and problem complexity
03B35: Mechanization of proofs and logical operations
03D15: Complexity of computation (including implicit computational complexity)
Related Items
Extracting models from clause sets saturated under semantic refinements of the resolution rule., On the complexity of equational problems in CNF, Explicit versus implicit representations of subsets of the Herbrand universe.