Problems in rewriting III (Q5055847): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Bots
7,080,617 edits
‎Created a new Item
 
ReferenceBot (talk | contribs)
Bots
1,903,984 edits
‎Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Automath / 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/3-540-59200-8_82 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1519212137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of systems of set constraints with negative constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination techniques and decision problems for disunification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4282593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMBINING TERM REWRITING AND TYPE ASSIGNMENT SYSTEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity of termination and confluence in combinations of rewrite systems with λω / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity of strong normalization in the algebraic-λ-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to generalized type systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: About the theory of tree embedding / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Syntactic” AC-unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional rewriting in focus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction techniques for first-order reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encompassment properties and automata with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set constraints with projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient representation of arithmetic for term rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete axiomatizations of some quotient term algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: The first-order theory of lexicographic path orderings is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial solution for D-unification based on a reduction to AC 1-unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of Turing machines by a regular rewrite rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open problems in rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: More problems in rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rationale for conditional equational programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding algebraic rewriting to the untyped lambda calculus (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: AC complement problems: Satisfiability and negation elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total termination of term rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete proof of correctness of the Knuth-Bendix completion algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3327710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic proofs by induction in theories without constructors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sufficient-completeness and related properties of term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accessible Independence Results for Peano Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3918095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On termination of one rule rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit substitutions with de bruijn's levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superposition oriented theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular aspects of properties of term rewriting systems related to normal forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple termination is difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic programming language with lambda-abstraction, function variables, and simple unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluence of the lambda calculus with left-linear algebraic rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: LFCS '94, Logical foundations of computer science. 3rd International Symposium, St. Petersburg, Russia, July 11-14, 1994. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clausal rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4937190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluence by decreasing diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Church-Rosser property for ground term-rewriting systems is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular AC unification of higher-order patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification problems with one-sided distributivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3358706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for undecidability proofs of first order theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewrite systems for integer arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding derivation lengths with functions from the slow growing hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of term rewriting: Interpretation and type elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total termination of term rewriting is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewrite systems for varieties of semigroups / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:39, 4 December 2024

scientific article; zbMATH DE number 7631275
Language Label Description Also known as
English
Problems in rewriting III
scientific article; zbMATH DE number 7631275

    Statements

    title
    Problems in rewriting III (English)
    0 references
    author
    Nachum Dershowitz
    0 references
    Jean-Pierre Jouannaud
    0 references
    Jan Willem Klop
    0 references
    publication date
    9 December 2022
    0 references
    cites work
    Q4264733
    0 references
    Q4282593
    0 references
    Q4281465
    0 references
    Q4264712
    0 references
    Q4205074
    0 references
    Q4385532
    0 references
    Q4281553
    0 references
    Q3786024
    0 references
    Q4692468
    0 references
    Q3327710
    0 references
    Q4036585
    0 references
    Q3918095
    0 references
    Q4281554
    0 references
    Q4705602
    0 references
    Q3024846
    0 references
    Clausal rewriting
    0 references
    Q4954455
    0 references
    Q4937190
    0 references
    Q4501166
    0 references
    Q4255512
    0 references
    Q4942621
    0 references
    Q4281488
    0 references
    Q3358706
    0 references
    Q3994754
    0 references

    Identifiers

    zbMATH DE Number
    7631275
    0 references
    OpenAlex ID
    W1519212137
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5055847&oldid=38019775"
    Powered by MediaWiki