- -

Variant-Based Decidable Satisfiability in Initial Algebras with Predicates

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Variant-Based Decidable Satisfiability in Initial Algebras with Predicates

Show full item record

Gutiérrez Gil, R.; Meseguer, J. (2018). Variant-Based Decidable Satisfiability in Initial Algebras with Predicates. Lecture Notes in Computer Science. 10855:306-322. https://doi.org/10.1007/978-3-319-94460-9_18

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/124698

Files in this item

Item Metadata

Title: Variant-Based Decidable Satisfiability in Initial Algebras with Predicates
Author:
Issued date:
Abstract:
[EN] Decision procedures can be either theory-specific, e.g., Presburger arithmetic, or theory-generic, applying to an infinite number of user-definable theories. Variant satisfiability is a theory-generic procedure for ...[+]
Subjects: Finite variant property (fvp) , OS-compactness , User-definable predicates , Decidable validity and satisfiability in initial algebras
Copyrigths: Reserva de todos los derechos
Source:
Lecture Notes in Computer Science. (issn: 0302-9743 )
DOI: 10.1007/978-3-319-94460-9_18
Publisher:
Springer-Verlag
Publisher version: https://doi.org/10.1007/978-3-319-94460-9_18
Conference name: 27th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2017)
Conference place: Namur, Blegium
Conference date: Octubre 10-12,2017
Type: Artículo Comunicación en congreso

This item appears in the following Collection(s)

Show full item record