Metalevel algorithms for variant satisfiability (Q2413027): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q130200143, #quickstatements; #temporary_batch_1729947016210
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2791470433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rewriting approach to satisfiability procedures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5309032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5310200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree generating regular systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038726 / 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: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding decision procedures to SMT solvers using axioms with triggers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination Modulo Combinations of Equational Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Folding variant narrowing and optimal variant termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / 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: Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined Satisfiability Modulo Parametric Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying Reachability-Logic Properties on Rewriting-Logic Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variant-Based Satisfiability in Initial Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3687683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplification by Cooperating Decision Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity, convexity and combinations of theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Combinations of Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metalevel Algorithms for Variant Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Path Reachability Logic / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130200143 / rank
 
Normal rank

Latest revision as of 13:59, 26 October 2024

scientific article
Language Label Description Also known as
English
Metalevel algorithms for variant satisfiability
scientific article

    Statements

    Metalevel algorithms for variant satisfiability (English)
    0 references
    0 references
    0 references
    6 April 2018
    0 references
    finite variant property (FVP)
    0 references
    folding variant narrowing
    0 references
    satisfiability in initial algebras
    0 references
    metalevel algorithms
    0 references
    reflection
    0 references
    Maude
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers