Reachability and confluence are undecidable for flat term rewriting systems.

Florent Jacquemard

Published in: Inf. Process. Lett. (2003)

Keyphrases

term rewriting systems
logic programs
functional programs
sufficient conditions
state space
transitive closure
databases
multi agent
general purpose
key features
datalog programs
rewrite systems