On proving confluence modulo equivalence for Constraint Handling Rules (Q511019): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q125525925, #quickstatements; #temporary_batch_1714634810890
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Logic Based Program Synthesis and Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluence and semantics of constraint simplification rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagrammatic confluence for Constraint Handling Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A declarative approach for first-order built-in's of Prolog / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and All That / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete and terminating execution model for Constraint Handling Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: CHR grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluence Modulo Equivalence in Constraint Handling Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observable Confluence for Constraint Handling Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biological Sequence Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluence in concurrent constraint programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case Analysis of Set Union Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and practice of constraint handling rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Handling Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391450 / 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: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: As time goes by: Constraint Handling Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order rewrite systems and their confluence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On theories with a combinatorial definition of 'equivalence' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform confluence in concurrent computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A confluent relational calculus for higher-order programming with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Handling Rules. Current research topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the Church-Rosser Property / rank
 
Normal rank

Revision as of 09:59, 13 July 2024

scientific article
Language Label Description Also known as
English
On proving confluence modulo equivalence for Constraint Handling Rules
scientific article

    Statements

    On proving confluence modulo equivalence for Constraint Handling Rules (English)
    0 references
    0 references
    0 references
    14 February 2017
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers