Termination of narrowing revisited

This paper describes several classes of term rewriting systems (TRS's), where narrowing has a finite search space and is still (strongly) complete as a mechanism for solving reachability goals. These classes do not assume confluence of the TRS. We also ascertain purely syntactic criteria that suffice to ensure the termination of narrowing, and include several subclasses of popular TRS's such as right-linear TRS's, almost orthogonal TRS's, topmost TRS's, and left-flat TRS's. Our results improve and/or generalize previous criteria in the literature regarding narrowing termination.

[1]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[2]  Uday S. Reddy,et al.  Narrowing as the Operational Semantics of Functional Languages , 1985, SLP.

[3]  Jürgen Giesl,et al.  Termination of term rewriting using dependency pairs , 2000, Theor. Comput. Sci..

[4]  Nachum Dershowitz,et al.  Goal-Directed Equation Solving ” , 1999 .

[5]  Zena M. Ariola,et al.  Narrowing the Narrowing Space , 1997, PLILP.

[6]  María Alpuente,et al.  Partial evaluation of functional logic programs , 1998, TOPL.

[7]  Michael Hanus,et al.  The Integration of Functions into Logic Programming: From Theory to Practice , 1994, J. Log. Program..

[8]  Jim Christian.  Some Termination Criteria for Narrowing and E-Narrowing , 1992, CADE.

[9]  Véronique Cortier,et al.  A survey of algebraic properties used in cryptographic protocols , 2006, J. Comput. Secur..

[10]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[11]  M. Schmidt-Schauβ.  Unification in a combination of arbitrary disjoint equational theories , 1989 .

[12]  Salvador Lucas,et al.  Abstract Diagnosis of Functional Programs , 2002, LOPSTR.

[13]  Corrado Moiso,et al.  An Algorithm for Unification in Equational Theories , 1986, SLP.

[14]  Nachum Dershowitz,et al.  Goal Solving as Operational Semantics , 1995, ILPS.

[15]  José Meseguer,et al.  A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties , 2006, Theor. Comput. Sci..

[16]  María Alpuente,et al.  A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenciana under grant GV01-424. , 2002 .

[17]  José Meseguer,et al.  Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols , 2007, High. Order Symb. Comput..

[18]  Danny De Schreye,et al.  Termination of logic programs: tutorial notes , 1992 .

[19]  María Alpuente,et al.  Narrowing as an Incremental Constraint Satisfaction Algorithm , 1991, PLILP.

[20]  José Meseguer,et al.  Symbolic Model Checking of Infinite-State Systems Using Narrowing , 2007, RTA.

[21]  Narciso Martí-Oliet,et al.  All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic , 2007, All About Maude.

[22]  María Alpuente,et al.  Modular Termination of Basic Narrowing , 2008, RTA.

[23]  Yoshihito Toyama,et al.  Counterexamples to Termination for the Direct Sum of Term Rewriting Systems , 1987, Inf. Process. Lett..

[24]  María Alpuente,et al.  Analyses of Unsatisfiability for Equational Logic Programming , 1995, J. Log. Program..

[25]  Hubert Comon-Lundh,et al.  Intruder Theories (Ongoing Work) , 2004, FoSSaCS.

[26]  Jean-Marie Hullot,et al.  Canonical Forms and Unification , 1980, CADE.

[27]  Christian Prehofer,et al.  On Modularity in Term Rewriting and Narrowing , 1994, CCL.

[28]  Giorgio Levi,et al.  Incremental Constraint Satisfaction for Equational Logic Programming , 1995, Theor. Comput. Sci..

[29]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[30]  Jacques Chabin,et al.  Narrowing Directed by a Graph of Terms , 1991, RTA.

[31]  Robert Nieuwenhuis,et al.  Basic paramodulation and decidable theories , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[32]  N. Dershowitz,et al.  Decidable Matching for Convergent Systems , 1992 .

[33]  Nachum Dershowitz,et al.  Termination of Rewriting , 1987, J. Symb. Comput..

[34]  José Meseguer,et al.  Multiparadigm Logic Programming , 1992, ALP.

[35]  Aart Middeldorp,et al.  Completeness results for basic narrowing , 1994, Applicable Algebra in Engineering, Communication and Computing.

[36]  Pierre Réty.  Improving Basic Narrowing Techniques , 1987, RTA.

[37]  Maurizio Gabbrielli,et al.  The semantics of equational logic programming as an instance of CLP , 1993 .

[38]  Peyton Jones,et al.  Haskell 98 language and libraries : the revised report , 2003 .

[39]  Jean-Pierre Jouannaud,et al.  Syntacticness, Cycle-Syntacticness, and Shallow Theories , 1994, Inf. Comput..