Mechanically proving termination using polynomial interpretations (Q851142): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 3 users not shown)
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: CiME / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CARIBOO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Mizar / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tsukuba / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10817-005-9022-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988455648 / 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: Termination of rewriting systems by polynomial interpretations and its implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of addition chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addition chains using continued fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms with polynomial interpretation termination proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compiling constraints in clp(FD) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanically proving termination using polynomial interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings for term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addition Chain Methods for the Evaluation of Specific Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Sequences with Addition Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular termination proofs for rewriting using dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing positiveness of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of rewrite systems by elementary interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vectorial addition chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Evaluation of Powers and Monomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4447254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preuves de terminaison de systèmes de réécriture fondées sur les interprétations polynomiales. Une méthode basée sur le théorème de Sturm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical computer science. Cumulative index, volumes 1-100 (1992) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular and incremental automated termination proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing sums of addition chains / rank
 
Normal rank

Latest revision as of 23:19, 24 June 2024

scientific article
Language Label Description Also known as
English
Mechanically proving termination using polynomial interpretations
scientific article

    Statements

    Mechanically proving termination using polynomial interpretations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2006
    0 references
    0 references
    termination
    0 references
    polynomial interpretations
    0 references
    weakly monotonic orderings
    0 references
    Diophantine constraints
    0 references
    polynomial orderings
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references