Loop detection in term rewriting using the eliminating unfoldings (Q944383): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Matchbox / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MiniSat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AProVE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tyrolean / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972319677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Diagnosis of Functional Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyses of unsatisfiability for equational logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rules + strategies for transforming lazy functional logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of term rewriting using dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and All That / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Transformation System for Developing Recursive Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrowing directed by a graph of terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semantic basis for the termination analysis of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammar Analysis and Parsing by Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3917482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring Termination Conditions for Logic Programs Using Backwards Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Match-bounded string rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Looping String Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic for Programming, Artificial Intelligence, and Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frontiers of Combining Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Proving Uniform Termination and Restricted Termination of Rewriting Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integration of functions into logic programming: From theory to practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tyrolean termination tool: techniques and features / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of equational logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: cTI: a constraint-based termination inference tool for ISO-Prolog / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of logical relations for over- and underapproximating static analyses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples to termination for the direct sum of term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting techniques and applications. 15th international conference, RTA 2004, Aachen, Germany, June 3--5, 2004. Proceedings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of string rewriting proved automatically / rank
 
Normal rank

Latest revision as of 17:18, 28 June 2024

scientific article
Language Label Description Also known as
English
Loop detection in term rewriting using the eliminating unfoldings
scientific article

    Statements

    Loop detection in term rewriting using the eliminating unfoldings (English)
    0 references
    0 references
    16 September 2008
    0 references
    0 references
    term rewriting system
    0 references
    non-termination
    0 references
    loop
    0 references
    unfoldings
    0 references
    useless rule
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references