Aguirre Garcia, Luis ManuelMartí Oliet, NarcisoPalomino Tarjuelo, MiguelPita Andreu, María Isabel2023-06-162023-06-162021-11-05https://hdl.handle.net/20.500.14352/5848Narrowing 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.engAtribución 3.0 Españahttps://creativecommons.org/licenses/by/3.0/es/technical reporthttp://maude.ucm.es/cnarrowingopen accessNarrowingStrategiesReachabilityRewriting logicSMTUnificationLenguajes de programaciónSoftware1203.23 Lenguajes de Programación3304.16 Diseño Lógico