Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Simple LPO constraint solving methods

From MaRDI portal
Publication:685481
Jump to:navigation, search

DOI10.1016/0020-0190(93)90226-YzbMath0781.68102MaRDI QIDQ685481

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

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (10)

More problems in rewriting ⋮ Solving simplification ordering constraints ⋮ The first-order theory of lexicographic path orderings is undecidable ⋮ Practical algorithms for deciding path ordering constraint satisfaction. ⋮ Orienting rewrite rules with the Knuth-Bendix order. ⋮ Stratified resolution ⋮ Ordered tableaux: Extensions and applications ⋮ Decision Procedures for Automating Termination Proofs ⋮ Ordered chaining for total orderings ⋮ What you always wanted to know about rigid E-unification



Cites Work

  • SOLVING SYMBOLIC ORDERING CONSTRAINTS
  • Unnamed Item
  • Unnamed Item


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:685481&oldid=12594355"
Category:
  • Pages with script errors
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 10:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki