Narrowing vs. SLD-resolution
From MaRDI portal
Publication:1105364
DOI10.1016/0304-3975(88)90095-3zbMath0648.68043OpenAlexW1975247475MaRDI QIDQ1105364
Elio Giovannetti, Corrado Moiso, Pier Giorgio Bosco
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90095-3
Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)
Related Items (14)
An optimal narrowing strategy for general canonical systems ⋮ Completeness results for basic narrowing ⋮ Detecting redundant narrowing derivations by the LSE-SL reducibility test ⋮ On narrowing, refutation proofs and constraints ⋮ Incremental constraint satisfaction for equational logic programming ⋮ A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenciana under grant GV01-424. ⋮ An integrated framework for the diagnosis and correction of rule-based programs ⋮ On modularity in term rewriting and narrowing ⋮ A framework for incremental learning of logic programs ⋮ Incremental learning of logic programs ⋮ Evaluation strategies for functional logic programming ⋮ A framework for computing finite SLD trees ⋮ Functional-logic integration via minimal reciprocal extensions ⋮ Declarative Debugging of Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Accóon Integrada Hispano-Italiana HI2000-0161 and by Generalitat Valenciana under grant GV01-424.
Uses Software
Cites Work
This page was built for publication: Narrowing vs. SLD-resolution
