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...
| Authors: | , , , |
|---|---|
| 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 |
| Summary: | 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. |
|---|