Deciding the word problem in the union of equational theories. (Q1400706): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/iandc/BaaderT02, #quickstatements; #temporary_batch_1731530891435
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030179532 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57383722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and All That / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination of constraint solvers for free and quasi-free structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the word problem in the union of equational theories. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination with multiset orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining word problems through rewriting in categories with products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completion of a Set of Rules Modulo a Set of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining symbolic constraint solvers on algebraic domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Unification Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplification by Cooperating Decision Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Decision Procedures Based on Congruence Closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular properties of composable term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The join of equational theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in a combination of arbitrary disjoint equational theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3030272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unions of non-disjoint theories and combinations of satisfiability procedures / 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: On the Church-Rosser property for the direct sum of term rewriting systems / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/iandc/BaaderT02 / rank
 
Normal rank

Latest revision as of 22:03, 13 November 2024

scientific article
Language Label Description Also known as
English
Deciding the word problem in the union of equational theories.
scientific article

    Statements

    Deciding the word problem in the union of equational theories. (English)
    0 references
    0 references
    0 references
    2002
    0 references
    equational reasoning
    0 references
    decision procedure
    0 references

    Identifiers

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