Simple LPO constraint solving methods

DOI10.1016/0020-0190(93)90226-YzbMATH Open0781.68102MaRDI QIDQ685481FDOQ685481

Robert Nieuwenhuis

Publication date: 17 October 1993

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

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
• scientific article; zbMATH DE number 232263
• scientific article
• Simplex algorithms for linear programming
• scientific article; zbMATH DE number 916038

zbMATH Keywords

NP-completeautomatic theoremproving

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• SOLVING SYMBOLIC ORDERING CONSTRAINTS

Cited In (12)

• Title not available (Why is that?)
• What you always wanted to know about rigid E-unification
• 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 chaining for total orderings
• Orienting rewrite rules with the Knuth-Bendix order.
• More problems in rewriting
• Solving simplification ordering constraints
• Ordered tableaux: Extensions and applications
• SOLVING SYMBOLIC ORDERING CONSTRAINTS

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)