Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations

DOI10.1007/978-3-540-73147-4_3zbMATH Open1186.68236OpenAlexW1506313279MaRDI QIDQ3608811FDOQ3608811

Isabelle Gnaedig, Hélène Kirchner

Publication date: 6 March 2009

Published in: Rewriting, Computation and Proof (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73147-4_3

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (6)

• Proving weak properties of rewriting
• Title not available (Why is that?)
• Sentence-normalized conditional narrowing modulo in rewriting logic and Maude
• On Relating Theories: Proof-Theoretical Reduction
• On the connection between narrowing and proof by consistency
• TERMINATION OF ABSTRACT REDUCTION SYSTEMS

Uses Software

• Stratego
• Maude
• CARIBOO

   Recommendations

• Title not available (Why is that?) 👍 👎
• Inductive proof search modulo 👍 👎
• Narrowing Based Inductive Proof Search 👍 👎
• On the connection between narrowing and proof by consistency 👍 👎
• On narrowing, refutation proofs and constraints 👍 👎

This page was built for publication: Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608811)