Simple LPO constraint solving methods

DOI10.1016/0020-0190(93)90226-YMaRDI QIDQ685481zbMATH OpenFDO

Authors Robert Nieuwenhuis

Publication date 17 October 1993

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

NP-completeautomatic theoremproving

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35)

Recommendations

• A simplex method based on reducing the constraint conditions of linear programming
• Linear programs for constraint satisfaction problems
• An LP-Designed Algorithm for Constraint Satisfaction
• scientific article; zbMATH DE number 5251052
• scientific article; zbMATH DE number 4158377
• scientific article; zbMATH DE number 232263
• scientific article; zbMATH DE number 5000797
• Simplex algorithms for linear programming
• scientific article; zbMATH DE number 916038

Cites work

• scientific article; zbMATH DE number 176755 (Why is no real title available?)
• scientific article; zbMATH DE number 1348468 (Why is no real title available?)
• SOLVING SYMBOLIC ORDERING CONSTRAINTS

Cited in

(13)

• SOLVING SYMBOLIC ORDERING CONSTRAINTS
• scientific article; zbMATH DE number 176755 (Why is no real title available?)
• Practical algorithms for deciding path ordering constraint satisfaction.
• Stratified resolution
• Decision Procedures for Automating Termination Proofs
• The first-order theory of lexicographic path orderings is undecidable
• Ordered tableaux: extensions and applications
• Orienting rewrite rules with the Knuth-Bendix order.
• Ordered chaining for total orderings
• What you always wanted to know about rigid \(E\)-unification
• More problems in rewriting
• Solving simplification ordering constraints
• KBO Constraint Solving Revisited

This page was built for publication: Simple LPO constraint solving methods

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