Conditional congruence closure over uninterpreted and interpreted symbols (Q1730315): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128393049, #quickstatements; #temporary_batch_1723632976074
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Variations on the Common Subexpression Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for reasoning about equality / 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: Implementing contextual rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint solving for interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for testing unsatisfiability of ground Horn clauses with equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shostak's congruence closure as completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and All That / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved equivalence algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5657644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast congruence closure and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Sets of Reductions for Some Equational Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264723 / 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: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract congruence closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical Ground Horn Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Shostak's decision procedure for combinations of theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Any ground associative-commutative theory has a finite canonical system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On interpolation in automated theorem proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover Algorithms and Their Combination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New decision algorithms for finitely presented commutative semigroups / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128393049 / rank
 
Normal rank

Latest revision as of 13:02, 14 August 2024

scientific article
Language Label Description Also known as
English
Conditional congruence closure over uninterpreted and interpreted symbols
scientific article

    Statements

    Conditional congruence closure over uninterpreted and interpreted symbols (English)
    0 references
    0 references
    6 March 2019
    0 references
    0 references
    completion
    0 references
    congruence closure
    0 references
    conditional congruence closure
    0 references
    intepreted symbols
    0 references
    rewriting
    0 references
    uninterpreted symbols
    0 references
    0 references
    0 references