Domain independent planners can produce better-quality plans through the use of domain-speci c knowledge, typically encoded as search control rules. The planning-by-rewriting approach has been proposed as an alternative technique for improving plan quality. We present a system that automatically learns plan rewriting rules and compare it with a system that automatically learns search control ru...

The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming languages. Knuth and Bendix have proposed a procedure known as the KB procedure for generating a complete TRS. A TRS cannot, however, directly handle higher-order functions that are widely used in functional programming la...

We show how the paradigm of learning-based testing (LBT) can be applied to automate speci cation-based black-box testing of reactive systems using term rewriting technology. A general model for a reactive system can be given by an extended Mealy automata (EMA) over an abstract data type (ADT). A nite state EMA over an ADT can be e ciently learned in polynomial time using the CGE regular inferen...

We settle in the negative the following Problem 51 (Comon{Dauchet, RTA'93 3], RTA'95 4]). Given an arbitrary nite term rewriting system R, is the rst-order theory of one-step rewriting (!R) decidable? Decidability would imply the decid-ability of the rst-order theory of encompassment (that is, being an instance of a subterm) 1], as well as several known decidability results in rewriting. (It is...

The idea of an incremental application of different termination techniques asprocessors for solving termination problems has shown to be a powerful andefficient way to prove termination of rewriting. Nowadays, the dependencypair framework (which develops this idea) is the most successful approach forproving termination of rewriting. The dependency pair framework relies onthe...

Verifying the safety property of a transition system given by a term rewriting system is an undecidable problem. In this paper, we give an abstraction for the problem which is automatically generated from a given TRS by using abstract interpretation. Then we show that there are some cases in which the problem can be decided. Also we show a new decidable subclass of term rewriting systems which ...

Bergstra, Bethke and Ponse proposed an axiomatization for Basic Process Algebra extended with (binary) iteration. In this paper, we prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we will set up a term rewriting system, based on the axioms, and prove that this term rewriting system is terminating, and that bisimilar normal forms...