Solving equational problems efficiently

DOI10.1007/3-540-48660-7_7MaRDI QIDQ4263159zbMATH OpenFDO

Authors Reinhard Pichler

Publication date 17 February 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48660-7_7

zbMATH Keywords

complexity analysisequational problemsinfinite Herbrand universeNP-completenesssatisfiability problem

Mathematics Subject Classification ID

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

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)

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

This page was built for publication: Solving equational problems efficiently

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