Synthesis of positive logic programs for checking a class of definitions with infinite quantification

We describe a method based on unfold/fold transformations that synthesizes positive logicprograms P(r)with the purpose of checking mechanically definitions of the form D(r) =∀X(r(X) ⇔QYR(X, Y))where ris the relation defined by the formula QYR(X, Y), Xis a set of variables to be instantiated at runti...

ver descrição completa

Detalhes bibliográficos
Autores: Galán Morillo, Francisco José, Cañete Valdeón, José Miguel
Formato: artículo
Estado:Versión enviada para evaluación y publicación
Fecha de publicación:2016
País:España
Recursos:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/97976
Acesso em linha:https://hdl.handle.net/11441/97976
https://doi.org/10.1016/j.ic.2016.06.014
Access Level:acceso abierto
Palavra-chave:Program assertion
Logic program
Program synthesis
Unfold/fold transformation
id ES_2e9a3aa13fad9e60b2f6180aefefc657
oai_identifier_str oai:idus.us.es:11441/97976
network_acronym_str ES
network_name_str España
repository_id_str
spelling Synthesis of positive logic programs for checking a class of definitions with infinite quantificationGalán Morillo, Francisco JoséCañete Valdeón, José MiguelProgram assertionLogic programProgram synthesisUnfold/fold transformationWe describe a method based on unfold/fold transformations that synthesizes positive logicprograms P(r)with the purpose of checking mechanically definitions of the form D(r) =∀X(r(X) ⇔QYR(X, Y))where ris the relation defined by the formula QYR(X, Y), Xis a set of variables to be instantiated at runtime by ground terms, QYis a set of quantifiedvariables on infinite domains (Qis the quantifier) and R(X, Y)a quantifier-free formulain the language of a first-order logic theory. This work constitutes a first step towards theconstruction of a new type of assertion checkers with the ability of handling restrictedforms of infinite quantification.ElsevierLenguajes y Sistemas Informáticos2016info:eu-repo/semantics/articleinfo:eu-repo/semantics/submittedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/97976https://doi.org/10.1016/j.ic.2016.06.014reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésInformation and Computation, 249 (August 2016), 205-236.https://www.sciencedirect.com/science/article/abs/pii/S089054011630030Xinfo:eu-repo/semantics/openAccessoai:idus.us.es:11441/979762026-06-17T12:51:07Z
dc.title.none.fl_str_mv Synthesis of positive logic programs for checking a class of definitions with infinite quantification
title Synthesis of positive logic programs for checking a class of definitions with infinite quantification
spellingShingle Synthesis of positive logic programs for checking a class of definitions with infinite quantification
Galán Morillo, Francisco José
Program assertion
Logic program
Program synthesis
Unfold/fold transformation
title_short Synthesis of positive logic programs for checking a class of definitions with infinite quantification
title_full Synthesis of positive logic programs for checking a class of definitions with infinite quantification
title_fullStr Synthesis of positive logic programs for checking a class of definitions with infinite quantification
title_full_unstemmed Synthesis of positive logic programs for checking a class of definitions with infinite quantification
title_sort Synthesis of positive logic programs for checking a class of definitions with infinite quantification
dc.creator.none.fl_str_mv Galán Morillo, Francisco José
Cañete Valdeón, José Miguel
author Galán Morillo, Francisco José
author_facet Galán Morillo, Francisco José
Cañete Valdeón, José Miguel
author_role author
author2 Cañete Valdeón, José Miguel
author2_role author
dc.contributor.none.fl_str_mv Lenguajes y Sistemas Informáticos
dc.subject.none.fl_str_mv Program assertion
Logic program
Program synthesis
Unfold/fold transformation
topic Program assertion
Logic program
Program synthesis
Unfold/fold transformation
description We describe a method based on unfold/fold transformations that synthesizes positive logicprograms P(r)with the purpose of checking mechanically definitions of the form D(r) =∀X(r(X) ⇔QYR(X, Y))where ris the relation defined by the formula QYR(X, Y), Xis a set of variables to be instantiated at runtime by ground terms, QYis a set of quantifiedvariables on infinite domains (Qis the quantifier) and R(X, Y)a quantifier-free formulain the language of a first-order logic theory. This work constitutes a first step towards theconstruction of a new type of assertion checkers with the ability of handling restrictedforms of infinite quantification.
publishDate 2016
dc.date.none.fl_str_mv 2016
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/submittedVersion
format article
status_str submittedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/97976
https://doi.org/10.1016/j.ic.2016.06.014
url https://hdl.handle.net/11441/97976
https://doi.org/10.1016/j.ic.2016.06.014
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Information and Computation, 249 (August 2016), 205-236.
https://www.sciencedirect.com/science/article/abs/pii/S089054011630030X
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869405415996915712
score 15.300719

Registos relacionados