scientific article; zbMATH DE number 1341610

MaRDI QIDQ4263159zbMATH OpenFDO

Authors Reinhard Pichler

Publication date 17 February 2000

zbMATH Keywords

NP-completenesscomplexity analysissatisfiability problemequational problemsinfinite Herbrand universe

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• On the complexity of equational problems in CNF
• Equational problems and disunification
• scientific article; zbMATH DE number 1860670
• scientific article; zbMATH DE number 1004365

Cited in

(9)

• Explicit versus implicit representations of subsets of the Herbrand universe.
• scientific article; zbMATH DE number 3858394 (Why is no real title available?)
• Extracting models from clause sets saturated under semantic refinements of the resolution rule.
• On the complexity of equational problems in CNF
• scientific article; zbMATH DE number 4123701 (Why is no real title available?)
• Foundations of Information and Knowledge Systems
• Efficient encodings of first-order Horn formulas in equational logic
• Solving symbolic equations with PRESS
• scientific article; zbMATH DE number 1103391 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263159)