scientific article; zbMATH DE number 1341610

zbMATH Open0937.03019MaRDI QIDQ4263159FDOQ4263159

Authors: Reinhard Pichler 

Publication date: 17 February 2000

Title of this publication is not available (Why is that?)

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

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)

Cited In (8)

• Explicit versus implicit representations of subsets of the Herbrand universe.
• Title not available (Why is that?)
• Extracting models from clause sets saturated under semantic refinements of the resolution rule.
• On the complexity of equational problems in CNF
• Title not available (Why is that?)
• Foundations of Information and Knowledge Systems
• Solving symbolic equations with PRESS
• Title not available (Why is that?)

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)