Basic rewriting via logic programming, with an application to the reachability problem

MaRDI QIDQ5446175zbMATH OpenFDO

Authors Sébastien Limet, Gernot Salzer

Publication date 6 March 2008

Mathematics Subject Classification ID

Logic programming (68N17) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Rewriting Techniques and Applications
• Computing with rewrite systems
• Reachability in conditional term rewriting systems
• A constructor-based reachability logic for rewrite theories
• scientific article; zbMATH DE number 19765

Cited in

(5)

• A rewriting approach to satisfiability procedures.
• An approach to declarative programming based on a rewriting logic
• Rewriting Techniques and Applications
• A general theory of confluent rewriting systems for logic programming and its applications
• Approximating any logic program by a CS-program

This page was built for publication: Basic rewriting via logic programming, with an application to the reachability problem

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