Variant-Based Decidable Satisfiability in Initial Algebras with Predicates

[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 quantifier-free satisfiability in the initial algebra of an order-sorted equatio...

Descripción completa

Detalles Bibliográficos
Autores: Gutiérrez Gil, Raúl|||0000-0002-3984-2868, Meseguer, José
Tipo de recurso: artículo
Fecha de publicación:2018
País:España
Institución:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglés
OAI Identifier:oai:riunet.upv.es:10251/124698
Acceso en línea:https://riunet.upv.es/handle/10251/124698
Access Level:acceso abierto
Palabra clave:Finite variant property (fvp)
OS-compactness
User-definable predicates
Decidable validity and satisfiability in initial algebras
LENGUAJES Y SISTEMAS INFORMATICOS
id ES_fa063f4a3f06945b3d1981a3397e8a09
oai_identifier_str oai:riunet.upv.es:10251/124698
network_acronym_str ES
network_name_str España
repository_id_str
spelling Variant-Based Decidable Satisfiability in Initial Algebras with PredicatesGutiérrez Gil, Raúl|||0000-0002-3984-2868Meseguer, JoséFinite variant property (fvp)OS-compactnessUser-definable predicatesDecidable validity and satisfiability in initial algebrasLENGUAJES Y SISTEMAS INFORMATICOS[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 quantifier-free satisfiability in the initial algebra of an order-sorted equational theory (¿,E¿B) under two conditions: (i) E¿B has the finite variant property and B has a finitary unification algorithm; and (ii) (¿,E¿B) protects a constructor subtheory (¿,E¿¿B¿) that is OS-compact. These conditions apply to many user-definable theories, but have a main limitation: they apply well to data structures, but often do not hold for user-definable predicates on such data structures. We present a theory-generic satisfiability decision procedure, and a prototype implementation, extending variant-based satisfiability to initial algebras with user-definable predicates under fairly general conditions.Partially supported by NSF Grant CNS 14-09416, NRL under contract number N00173-17-1-G002, the EU (FEDER), Spanish MINECO project TIN2015-69175- C4-1-R and GV project PROMETEOII/2015/013. Ra´ul Guti´errez was also supported by INCIBE program “Ayudas para la excelencia de los equipos de investigaci´on avanzada en ciberseguridad”.Springer-VerlagDepartamento de Sistemas Informáticos y ComputaciónEscuela Politécnica Superior de AlcoyInstituto Universitario Valenciano de Investigación en Inteligencia ArtificialGeneralitat ValencianaMinisterio de Economía y EmpresaInstituto Nacional de CiberseguridadNational Science Foundation, EEUUU.S. Naval Research LaboratoryRepositorio Institucional de la Universitat Politècnica de València Riunet20182018-01-01journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfapplication/pdfhttps://riunet.upv.es/handle/10251/124698reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)InglésengMinisterio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 TIN2015-69175-C4-1-R SOLUCIONES EFECTIVAS BASADAS EN LA LOGICANational Science Foundation, China https://doi.org/10.13039/100000001 1409416 CSR: Medium: Availability-Consistency Tradeoffs in Key-Value and NoSQL Storage SystemsGeneralitat Valenciana https://doi.org/10.13039/501100003359 PROMETEOII%2F2015%2F013 SmartLogic: Logic Technologies for Software Security and PerformanceInstituto Nacional de Ciberseguridad https://doi.org/10.13039/501100013410 INCIBEI-2015-27346U.S. Naval Research Laboratory https://doi.org/10.13039/100009917 N00173-17-1-G002open accesshttp://purl.org/coar/access_right/c_abf2Reserva de todos los derechoshttp://rightsstatements.org/vocab/InC/1.0/info:eu-repo/semantics/openAccessoai:riunet.upv.es:10251/1246982026-06-13T07:49:27Z
dc.title.none.fl_str_mv Variant-Based Decidable Satisfiability in Initial Algebras with Predicates
title Variant-Based Decidable Satisfiability in Initial Algebras with Predicates
spellingShingle Variant-Based Decidable Satisfiability in Initial Algebras with Predicates
Gutiérrez Gil, Raúl|||0000-0002-3984-2868
Finite variant property (fvp)
OS-compactness
User-definable predicates
Decidable validity and satisfiability in initial algebras
LENGUAJES Y SISTEMAS INFORMATICOS
title_short Variant-Based Decidable Satisfiability in Initial Algebras with Predicates
title_full Variant-Based Decidable Satisfiability in Initial Algebras with Predicates
title_fullStr Variant-Based Decidable Satisfiability in Initial Algebras with Predicates
title_full_unstemmed Variant-Based Decidable Satisfiability in Initial Algebras with Predicates
title_sort Variant-Based Decidable Satisfiability in Initial Algebras with Predicates
dc.creator.none.fl_str_mv Gutiérrez Gil, Raúl|||0000-0002-3984-2868
Meseguer, José
author Gutiérrez Gil, Raúl|||0000-0002-3984-2868
author_facet Gutiérrez Gil, Raúl|||0000-0002-3984-2868
Meseguer, José
author_role author
author2 Meseguer, José
author2_role author
dc.contributor.none.fl_str_mv Departamento de Sistemas Informáticos y Computación
Escuela Politécnica Superior de Alcoy
Instituto Universitario Valenciano de Investigación en Inteligencia Artificial
Generalitat Valenciana
Ministerio de Economía y Empresa
Instituto Nacional de Ciberseguridad
National Science Foundation, EEUU
U.S. Naval Research Laboratory
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv Finite variant property (fvp)
OS-compactness
User-definable predicates
Decidable validity and satisfiability in initial algebras
LENGUAJES Y SISTEMAS INFORMATICOS
topic Finite variant property (fvp)
OS-compactness
User-definable predicates
Decidable validity and satisfiability in initial algebras
LENGUAJES Y SISTEMAS INFORMATICOS
description [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 quantifier-free satisfiability in the initial algebra of an order-sorted equational theory (¿,E¿B) under two conditions: (i) E¿B has the finite variant property and B has a finitary unification algorithm; and (ii) (¿,E¿B) protects a constructor subtheory (¿,E¿¿B¿) that is OS-compact. These conditions apply to many user-definable theories, but have a main limitation: they apply well to data structures, but often do not hold for user-definable predicates on such data structures. We present a theory-generic satisfiability decision procedure, and a prototype implementation, extending variant-based satisfiability to initial algebras with user-definable predicates under fairly general conditions.
publishDate 2018
dc.date.none.fl_str_mv 2018
2018-01-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://riunet.upv.es/handle/10251/124698
url https://riunet.upv.es/handle/10251/124698
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv Ministerio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 TIN2015-69175-C4-1-R SOLUCIONES EFECTIVAS BASADAS EN LA LOGICA
National Science Foundation, China https://doi.org/10.13039/100000001 1409416 CSR: Medium: Availability-Consistency Tradeoffs in Key-Value and NoSQL Storage Systems
Generalitat Valenciana https://doi.org/10.13039/501100003359 PROMETEOII%2F2015%2F013 SmartLogic: Logic Technologies for Software Security and Performance
Instituto Nacional de Ciberseguridad https://doi.org/10.13039/501100013410 INCIBEI-2015-27346
U.S. Naval Research Laboratory https://doi.org/10.13039/100009917 N00173-17-1-G002
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer-Verlag
publisher.none.fl_str_mv Springer-Verlag
dc.source.none.fl_str_mv reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname:Universitat Politècnica de València (UPV)
instname_str Universitat Politècnica de València (UPV)
reponame_str RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
collection RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869425147244445696
score 15,300719

Similares en LA Referencia