Variant-Based Satisfiability in Initial Algebras (Q4686604): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ICS / rank
 
Normal rank
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/978-3-319-29510-7_1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2294297515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of narrowing revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular termination of basic narrowing and equational unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on rewrite-based satisfiability procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing Mathematical Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rewriting approach to satisfiability procedures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in the union of disjoint equational theories: Combining decision procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination techniques and decision problems for disunification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite-State Model Checking of LTLR Formulas Using Narrowing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5309032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated complexity analysis based on ordered resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Variable-inactivity and Polynomial Formula-Satisfiability Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Forward Closure and the Finite Variant Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining unification algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5310200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Verification of Equivalence Properties of Cryptographic Protocols / 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: Q5573370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational problems and disunification / 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: Equational formulae with membership constraints / 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: A uniform approach to constraint-solving for lists, multisets, compact lists, and sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264105 / 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: An instantiation scheme for satisfiability modulo theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties / 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: Folding variant narrowing and optimal variant termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Induction + Linear Arithmetic = Decision Procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4553256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets of transformations for general E-unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-19 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Institutions: abstract model theory for specification and programming / 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: Q3030249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity in term rewriting revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664457 / 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: Complexity of unification problems with associative-commutative operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Aspects of Computing – ICTAC 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined Satisfiability Modulo Parametric Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Decidability and Combinability Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-Sorted Parameterization and Induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict coherence of conditional rewriting modulo axioms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational Formulas and Pattern Operations in Initial Order-Sorted Algebras / 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: Solving SAT and SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity, convexity and combinations of theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Combinations of Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof theory for general unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics in Artificial Intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples to termination for the direct sum of term rewriting systems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:35, 16 July 2024

scientific article; zbMATH DE number 6946586
Language Label Description Also known as
English
Variant-Based Satisfiability in Initial Algebras
scientific article; zbMATH DE number 6946586

    Statements

    Variant-Based Satisfiability in Initial Algebras (English)
    0 references
    2 October 2018
    0 references
    finite variant property (FVP)
    0 references
    constructor variant
    0 references
    constructor unifier
    0 references
    folding variant narrowing
    0 references
    satisfiability in initial algebras
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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

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