Metalevel algorithms for variant satisfiability

Stephen Skeirik, José Meseguer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Variant satisfiability is a theory-generic algorithm to decide quantifier-free satisfiability in an initial algebra TΣ/E when the theory (Σ,E) has the finite variant property and its constructors satisfy a compactness condition. This paper: (i) gives a precise definition of several meta-level sub-algorithms needed for variant satisfiability; (ii) proves them correct; and (iii) presents a reflective implementation in Maude 2.7 of variant satisfiability using these sub-algorithms.

Original languageEnglish (US)
Title of host publicationRewriting Logic and Its Applications - 11th International Workshop, WRLA 2016 Held as a Satellite Event of ETAPS 2016, Revised Selected Papers
EditorsDorel Lucanu
PublisherSpringer-Verlag Berlin Heidelberg
Pages167-184
Number of pages18
ISBN (Print)9783319448015
DOIs
StatePublished - Jan 1 2016
Event11th International Workshop on Rewriting Logic and its Applications, WRLA 2016 held as a Satellite Event of European Joint Conferences on Theory and Practice of Software, ETAPS 2016 - Eindhoven, Netherlands
Duration: Apr 2 2016Apr 3 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9942 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th International Workshop on Rewriting Logic and its Applications, WRLA 2016 held as a Satellite Event of European Joint Conferences on Theory and Practice of Software, ETAPS 2016
CountryNetherlands
CityEindhoven
Period4/2/164/3/16

Keywords

  • Finite variant property (FVP)
  • Folding variant narrowing
  • Maude
  • Metalevel algorithms
  • Reflection
  • Satisfiability in initial algebras

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Metalevel algorithms for variant satisfiability'. Together they form a unique fingerprint.

  • Cite this

    Skeirik, S., & Meseguer, J. (2016). Metalevel algorithms for variant satisfiability. In D. Lucanu (Ed.), Rewriting Logic and Its Applications - 11th International Workshop, WRLA 2016 Held as a Satellite Event of ETAPS 2016, Revised Selected Papers (pp. 167-184). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9942 LNCS). Springer-Verlag Berlin Heidelberg. https://doi.org/10.1007/978-3-319-44802-2_10