Variant-based decidable satisfiability in initial algebras with predicates

DOI10.1007/978-3-319-94460-9_18MaRDI QIDQ1671164zbMATH OpenOpenAlexFDO

Authors Raúl Gutiérrez, José Meseguer

Publication date 6 September 2018

Full work available at URL https://arxiv.org/abs/1709.05203

zbMATH Keywords

initial algebrasdecidable satisfiabilitydecidable validityfinite variant propertyOS-compactnessuser-definable predicates

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)

Recommendations

• Variant-Based Satisfiability in Initial Algebras
• Metalevel algorithms for variant satisfiability
• Metalevel algorithms for variant satisfiability
• On Variable-inactivity and Polynomial Formula-Satisfiability Procedures
• A rewriting approach to satisfiability procedures.

Cited in

(9)

• Symbolic computation in Maude: some tapas
• Metalevel algorithms for variant satisfiability
• Programming and symbolic computation in Maude
• Politeness for the theory of algebraic datatypes
• Variant-Based Satisfiability in Initial Algebras
• Metalevel algorithms for variant satisfiability
• Variants and satisfiability in the infinitary unification wonderland
• Variant Satisfiability of Parameterized Strings
• Polite combination of algebraic datatypes

This page was built for publication: Variant-based decidable satisfiability in initial algebras with predicates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671164)