Solving simplification ordering constraints (Q5096318): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: About the theory of tree embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOLVING SYMBOLIC ORDERING CONSTRAINTS / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple LPO constraint solving methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time termination and constraint satisfaction tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for undecidability proofs of first order theories / rank
 
Normal rank

Revision as of 21:18, 29 July 2024

scientific article; zbMATH DE number 7572128
Language Label Description Also known as
English
Solving simplification ordering constraints
scientific article; zbMATH DE number 7572128

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references