- -

Use of logical models for proving infeasibility in term rewriting

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Use of logical models for proving infeasibility in term rewriting

Show full item record

Lucas Alba, S.; Gutiérrez Gil, R. (2018). Use of logical models for proving infeasibility in term rewriting. Information Processing Letters. 136:90-95. https://doi.org/10.1016/j.ipl.2018.04.002

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/121414

Files in this item

Item Metadata

Title: Use of logical models for proving infeasibility in term rewriting
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
Issued date:
Abstract:
[EN] Given a (Conditional) Rewrite System R and terms s and t, we consider the following problem: is there a substitution a instantiating the variables in s and t such that the reachability test sigma(s) -> *(R) sigma(t) ...[+]
Subjects: Conditional rewriting , Confluence , Dependency graph , Operational termination
Copyrigths: Embargado
Source:
Information Processing Letters. (issn: 0020-0190 )
DOI: 10.1016/j.ipl.2018.04.002
Publisher:
Elsevier
Publisher version: http://doi.org/10.1016/j.ipl.2018.04.002
Thanks:
Partially supported by the EU (FEDER) which is co-funding the project TIN2015-69175-C4-1-R, Spanish MINECO project TIN2015-69175-C4-1-R and Generalitat Valenciana (GV) project PROMETEOII/2015/013.
Type: Artículo

This item appears in the following Collection(s)

Show full item record