Variant-based decidable satisfiability in initial algebras with predicates

DOI10.1007/978-3-319-94460-9_18OpenAlexW2962945057MaRDI QIDQ1671164

José Meseguer, Raúl Gutiérrez

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

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

Related Items (5)

Variants and satisfiability in the infinitary unification wonderland ⋮ Programming and symbolic computation in Maude ⋮ Polite combination of algebraic datatypes ⋮ Politeness for the theory of algebraic datatypes ⋮ Symbolic computation in Maude: some tapas

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