Strategies in Conditional Narrowing Modulo SMT Plus Axioms

Narrowing calculus that uses strategies to solve reachability problems in order-sorted rewrite theories whose underlying equational logic is composed of SMT theories plus some combination of associativity, commutativity, and identity. Both the strategies and the rewrite rules are allowed to be param...

Full description

Bibliographic Details
Authors: Aguirre Garcia, Luis Manuel, Martí Oliet, Narciso, Palomino Tarjuelo, Miguel, Pita Andreu, María Isabel
Format: report
Publication Date:2021
Country:España
Institution:Universidad Complutense de Madrid (UCM)
Repository:Docta Complutense
Language:English
OAI Identifier:oai:docta.ucm.es:20.500.14352/5848
Online Access:https://hdl.handle.net/20.500.14352/5848
Access Level:Open access
Keyword:Narrowing
Strategies
Reachability
Rewriting logic
SMT
Unification
Lenguajes de programación
Software
1203.23 Lenguajes de Programación
3304.16 Diseño Lógico
id ES_613eba28893f648864e4a5e4e1295c3b
oai_identifier_str oai:docta.ucm.es:20.500.14352/5848
network_acronym_str ES
network_name_str España
repository_id_str
spelling Strategies in Conditional Narrowing Modulo SMT Plus AxiomsEstrategias en Estrechamiento Condicional Módulo SMT más AxiomasAguirre Garcia, Luis ManuelMartí Oliet, NarcisoPalomino Tarjuelo, MiguelPita Andreu, María IsabelNarrowingStrategiesReachabilityRewriting logicSMTUnificationLenguajes de programaciónSoftware1203.23 Lenguajes de Programación3304.16 Diseño LógicoNarrowing calculus that uses strategies to solve reachability problems in order-sorted rewrite theories whose underlying equational logic is composed of SMT theories plus some combination of associativity, commutativity, and identity. Both the strategies and the rewrite rules are allowed to be parameterized, i.e., they may have a set of common constants that are given a value as part of the solution of a problem. The soundness and weak completeness of the calculus are proved.Universidad Complutense de Madrid20212021-01-0120212021-01-01technical reporthttp://purl.org/coar/resource_type/c_18ghinfo:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/20.500.14352/5848reponame:Docta Complutenseinstname:Universidad Complutense de Madrid (UCM)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Atribución 3.0 Españahttps://creativecommons.org/licenses/by/3.0/es/info:eu-repo/semantics/openAccessoai:docta.ucm.es:20.500.14352/58482026-06-02T12:44:21Z
dc.title.none.fl_str_mv Strategies in Conditional Narrowing Modulo SMT Plus Axioms
Estrategias en Estrechamiento Condicional Módulo SMT más Axiomas
title Strategies in Conditional Narrowing Modulo SMT Plus Axioms
spellingShingle Strategies in Conditional Narrowing Modulo SMT Plus Axioms
Aguirre Garcia, Luis Manuel
Narrowing
Strategies
Reachability
Rewriting logic
SMT
Unification
Lenguajes de programación
Software
1203.23 Lenguajes de Programación
3304.16 Diseño Lógico
title_short Strategies in Conditional Narrowing Modulo SMT Plus Axioms
title_full Strategies in Conditional Narrowing Modulo SMT Plus Axioms
title_fullStr Strategies in Conditional Narrowing Modulo SMT Plus Axioms
title_full_unstemmed Strategies in Conditional Narrowing Modulo SMT Plus Axioms
title_sort Strategies in Conditional Narrowing Modulo SMT Plus Axioms
dc.creator.none.fl_str_mv Aguirre Garcia, Luis Manuel
Martí Oliet, Narciso
Palomino Tarjuelo, Miguel
Pita Andreu, María Isabel
author Aguirre Garcia, Luis Manuel
author_facet Aguirre Garcia, Luis Manuel
Martí Oliet, Narciso
Palomino Tarjuelo, Miguel
Pita Andreu, María Isabel
author_role author
author2 Martí Oliet, Narciso
Palomino Tarjuelo, Miguel
Pita Andreu, María Isabel
author2_role author
author
author
dc.contributor.none.fl_str_mv Universidad Complutense de Madrid
dc.subject.none.fl_str_mv Narrowing
Strategies
Reachability
Rewriting logic
SMT
Unification
Lenguajes de programación
Software
1203.23 Lenguajes de Programación
3304.16 Diseño Lógico
topic Narrowing
Strategies
Reachability
Rewriting logic
SMT
Unification
Lenguajes de programación
Software
1203.23 Lenguajes de Programación
3304.16 Diseño Lógico
description Narrowing calculus that uses strategies to solve reachability problems in order-sorted rewrite theories whose underlying equational logic is composed of SMT theories plus some combination of associativity, commutativity, and identity. Both the strategies and the rewrite rules are allowed to be parameterized, i.e., they may have a set of common constants that are given a value as part of the solution of a problem. The soundness and weak completeness of the calculus are proved.
publishDate 2021
dc.date.none.fl_str_mv 2021
2021-01-01
2021
2021-01-01
dc.type.none.fl_str_mv technical report
http://purl.org/coar/resource_type/c_18gh
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/20.500.14352/5848
url https://hdl.handle.net/20.500.14352/5848
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Atribución 3.0 España
https://creativecommons.org/licenses/by/3.0/es/
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
Atribución 3.0 España
https://creativecommons.org/licenses/by/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Docta Complutense
instname:Universidad Complutense de Madrid (UCM)
instname_str Universidad Complutense de Madrid (UCM)
reponame_str Docta Complutense
collection Docta Complutense
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869409390177550336
score 15.812429

Similar Items