Strategies in Conditional Narrowing Modulo SMT Plus Axioms
Estrategias en Estrechamiento Condicional Módulo SMT más Axiomas



Downloads per month over past year

Aguirre Garcia, Luis Manuel and Martí Oliet, Narciso and Palomino, Miguel and Pita Andreu, Isabel (2021) Strategies in Conditional Narrowing Modulo SMT Plus Axioms. [ ] (Unpublished)

[thumbnail of Strategies_in_Conditional_narrowing_modulo_SMT_plus_B_TR.pdf]
Creative Commons Attribution.



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.

Item Type:Working Paper or Technical Report
Uncontrolled Keywords:Narrowing, Strategies, Reachability, Rewriting logic, SMT, Unification
Subjects:Sciences > Computer science > Programming languages (Electronic computers)
Sciences > Computer science > Software
Series Name:
ID Code:68621
Deposited On:10 Nov 2021 16:52
Last Modified:15 Nov 2021 12:45

Origin of downloads

Repository Staff Only: item control page