References

  1. Franz Baader & Tobias Nipkow (1998): Term Rewriting and All That. Cambridge University Press, doi:10.1017/CBO9781139172752.
  2. Hubert Comon, Max Dauchet, Rémi Gilleron, Florent Jacquemard, Denis Lugiez, Christof Löding, Sophie Tison & Marc Tommasi (2007): Tree Automata Techniques and Applications. Available on: http://www.grappa.univ-lille3.fr/tata. Release October, 12th 2007.
  3. Nachum Dershowitz, Mitsuhiro Okada & G. Sivakumar (1988): Canonical Conditional Rewrite Systems. In: Proceedings of the 9th International Conference on Automated Deduction, Lecture Notes in Computer Science 310. Springer, pp. 538–549, doi:10.1007/BFb0012855.
  4. Francisco Durán, Salvador Lucas, José Meseguer, Claude Marché & Xavier Urbain (2004): Proving termination of membership equational programs. In: Proceedings of the 2004 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation. ACM, pp. 147–158, doi:10.1145/1014007.1014022.
  5. Guillaume Feuillade & Thomas Genet (2003): Reachability in Conditional Term Rewriting Systems. Electronic Notes in Theoretical Computer Science 86(1), pp. 133–146, doi:10.1016/S1571-0661(04)80658-3.
  6. Thomas Genet & Vlad Rusu (2010): Equational approximations for tree automata completion. Journal of Symbolic Computation 45(5), pp. 574–597, doi:10.1016/j.jsc.2010.01.009.
  7. Thomas Genet & Valérie Viet Triem Tong (2001): Reachability Analysis of Term Rewriting Systems with Timbuk. In: Robert Nieuwenhuis & Andrei Voronkov: Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, Lecture Notes in Computer Science 2250. Springer, pp. 695–706, doi:10.1007/3-540-45653-8_48.
  8. Jürgen Giesl, Peter Schneider-Kamp & René Thiemann (2006): AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework. In: Proceedings of the 3rd International Joint Conference on Automated Reasoning, Lecture Notes in Computer Science 4130. Springer, pp. 281–286, doi:10.1007/11814771_24.
  9. Karl Gmeiner (2015): CoScart: Confluence Prover in Scala. In: Proceedings of the 4th International Workshop on Confluence, pp. 45.
  10. Karl Gmeiner & Naoki Nishida (2014): Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems. In: Proceedings of the first International Workshop on Rewriting Techniques for Program Transformations and Evaluation, OpenAccess Series in Informatics 40. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 3–14, doi:10.4230/OASIcs.WPTE.2014.3.
  11. Karl Gmeiner, Naoki Nishida & Bernhard Gramlich (2013): Proving Confluence of Conditional Term Rewriting Systems via Unravelings. In: Proceedings of the 2nd International Workshop on Confluence, pp. 35–39.
  12. Raúl Gutiérrez, Salvador Lucas & Patricio Reinoso (2016): A tool for the automatic generation of logical models of order-sorted first-order theories. In: Proceedings of the XVI Jornadas sobre Programación y Lenguages, pp. 215–230. Tool available at http://zenon.dsic.upv.es/ages/.
  13. Manuel V. Hermenegildo & Francesca Rossi (1989): On the Correctness and Efficiency of Independent And-Parallelism in Logic Programs. In: Proceedings of the North American Conference on Logic Programming. MIT Press, pp. 369–389.
  14. Jean-Marie Hullot (1980): Canonical Forms and Unification. In: Proceedings of the 5th Conference on Automated Deduction, Lecture Notes in Computer Science 87. Springer, pp. 318–334, doi:10.1007/3-540-10009-1_25.
  15. Salvador Lucas (2018): A Semantic Approach to the Analysis of Rewriting-Based Systems. In: Revised Selected Papers of the 27th International Symposium on Logic-Based Program Synthesis and Transformation, Lecture Notes in Computer Science 10855. Springer, pp. 180–97, doi:10.1007/978-3-319-94460-9_11.
  16. Salvador Lucas & Raúl Gutiérrez (2017): A Semantic Criterion for Proving Infeasibility in Conditional Rewriting. In: Proceedings of the 6th International Workshop on Confluence, pp. 15–20.
  17. Salvador Lucas, Claude Marché & José Meseguer (2005): Operational termination of conditional term rewriting systems. Information Processing Letters 95(4), pp. 446–453, doi:10.1016/j.ipl.2005.05.002.
  18. Massimo Marchiori (1996): Unravelings and Ultra-properties. In: Proceedings of the 5th International Conference on Algebraic and Logic Programming, Lecture Notes in Computer Science 1139. Springer, pp. 107–121, doi:10.1007/3-540-61735-3_7.
  19. Aart Middeldorp & Erik Hamoen (1994): Completeness Results for Basic Narrowing. Applicable Algebra in Engineering, Communication and Computing 5, pp. 213–253, doi:10.1007/BF01190830.
  20. Naoki Nishida, Takayuki Kuroda, Makishi Yanagisawa & Karl Gmeiner (2015): CO3: a COnverter for proving COnfluence of COnditional TRSs. In: Proceedings of the 4th International Workshop on Confluence, pp. 42.
  21. Naoki Nishida & Yuya Maeda (2018): Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems. In: Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, Leibniz International Proceedings in Informatics 108. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 26:1–26:20, doi:10.4230/LIPIcs.FSCD.2018.26.
  22. Naoki Nishida & Germán Vidal (2013): Computing More Specific Versions of Conditional Rewriting Systems. In: Revised Selected Papers of the 22nd International Symposium on Logic-Based Program Synthesis and Transformation, Lecture Notes in Computer Science 7844. Springer, pp. 137–154, doi:10.1007/978-3-642-38197-3_10.
  23. Naoki Nishida & Germán Vidal (2014): A Finite Representation of the Narrowing Space. In: Revised Selected Papers of the 23rd International Symposium on Logic-Based Program Synthesis and Transformation, Lecture Notes in Computer Science 8901. Springer, pp. 54–71, doi:10.1007/978-3-319-14125-1_4.
  24. Naoki Nishida & Germán Vidal (2015): A framework for computing finite SLD trees. Journal of Logic and Algebraic Methods in Programming 84(2), pp. 197–217, doi:10.1016/j.jlamp.2014.11.006.
  25. Enno Ohlebusch (2002): Advanced Topics in Term Rewriting. Springer, doi:10.1007/978-1-4757-3661-8.
  26. Catuscia Palamidessi (1990): Algebraic Properties of Idempotent Substitutions. In: Proceedings of the 17th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 443. Springer, pp. 386–399, doi:10.1007/BFb0032046.
  27. James R. Slagle (1974): Automated Theorem-Proving for Theories with Simplifiers, Commutativity and Associativity. Journal of the ACM 21(4), pp. 622–642, doi:10.1145/321850.321859.
  28. Thomas Sternagel & Aart Middeldorp (2014): Conditional Confluence (System Description). In: Proceedings of the Joint International Conference on Rewriting and Typed Lambda Calculi, Lecture Notes in Computer Science 8560. Springer, pp. 456–465, doi:10.1007/978-3-319-08918-8_31.
  29. Taro Suzuki, Aart Middeldorp & Tetsuo Ida (1995): Level-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides. In: Proceedings of the 6th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 914. Springer, pp. 179–193, doi:10.1007/3-540-59200-8_56.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org