A Finite Representation of the Narrowing Space

DOI10.1007/978-3-319-14125-1_4zbMath1453.68054OpenAlexW278719557MaRDI QIDQ3453648

Naoki Nishida, Germán Vidal

Publication date: 30 November 2015

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10251/72829

Mathematics Subject Classification ID

Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems ⋮ A framework for computing finite SLD trees

Cites Work

• Unnamed Item
• Proving weak properties of rewriting
• A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
• A deterministic lazy narrowing calculus
• Foundations of equational logic programming
• Basic narrowing revisited
• Termination of term rewriting using dependency pairs
• Computing More Specific Versions of Conditional Rewriting Systems
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• The integration of functions into logic programming: From theory to practice
• Conjunctive partial deduction: foundations, control, algorithms, and experiments
• Symbolic Model Checking of Infinite-State Systems Using Narrowing
• The narrowing-driven approach to functional logic program specialization

This page was built for publication: A Finite Representation of the Narrowing Space