Practical algorithms for deciding path ordering constraint satisfaction. (Q1400710): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: SOLVING SYMBOLIC ORDERING CONSTRAINTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recursive path ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the recursive decomposition ordering with lexicographical status and other related orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple LPO constraint solving methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem proving with ordering and equality constrained clauses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751359 / rank
 
Normal rank

Revision as of 08:39, 6 June 2024

scientific article
Language Label Description Also known as
English
Practical algorithms for deciding path ordering constraint satisfaction.
scientific article

    Statements

    Practical algorithms for deciding path ordering constraint satisfaction. (English)
    0 references
    0 references
    0 references
    2 November 2003
    0 references
    automated deduction
    0 references
    ordered strategies
    0 references
    symbolic constraints
    0 references

    Identifiers