共 50 条
- [41] Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION (LOPSTR 2014), 2015, 8981 : 113 - 130
- [42] Natural rewriting for general term rewriting systems LOGIC BASED PROGRAM SYNTHESIS AND TRANSFORMATION, 2005, 3573 : 101 - 116
- [43] Translating logic programs into conditional rewriting systems LOGIC PROGRAMMING: PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING, 1997, : 168 - 182
- [44] Generation of the Path to Counter-Examples by Backward State Space Traversal in Symbolic Model Checking Based on Term Rewriting 2016 INTERNATIONAL CONFERENCE ON COMMUNICATIONS (COMM 2016), 2016, : 85 - 88
- [45] Confluence proofs of term rewriting systems based on persistency 1600, Japan Society for Software Science and Technology (30):
- [47] Term Orderings for Non-reachability of (Conditional) Rewriting AUTOMATED REASONING, IJCAR 2022, 2022, 13385 : 248 - 267
- [49] From the specification of multiagent systems by statecharts to their formal analysis by model checking: Towards safety-critical applications MULTIAGENT SYSTEM TECHNOLOGIES, PROCEEDINGS, 2003, 2831 : 131 - 143