On the complexity of deduction modulo leaf permutative equations (Q556681): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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-004-6244-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020743356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General algorithms for permutations in equational inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and All That / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: LEAN: An intermediate language based on graph rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On leaf permutative theories and occurrence permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3408147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental algorithms for permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation group algorithms based on partitions. I: Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unification Algorithm for Associative-Commutative Functions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:47, 10 June 2024

scientific article
Language Label Description Also known as
English
On the complexity of deduction modulo leaf permutative equations
scientific article

    Statements

    On the complexity of deduction modulo leaf permutative equations (English)
    0 references
    0 references
    0 references
    22 June 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    automated deduction
    0 references
    leaf permutative equations
    0 references
    stratified terms
    0 references
    0 references