Contextual Rewriting in Automated Reasoning
暂无分享,去创建一个
[1] François Bronsard,et al. Conditional Rewriting in Focus , 1990, CTRS.
[2] Nachum Dershowitz,et al. Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[3] Uday S. Reddy,et al. Reduction Techniques for First-Order Reasoning , 1992, CTRS.
[4] Hantao Zhang,et al. Contextual Rewriting , 1985, RTA.
[5] Nachum Dershowitz,et al. Canonical Conditional Rewrite Systems , 1988, CADE.
[6] Deepak Kapur,et al. An Overview of Rewrite Rule Laboratory (RRL) , 1989, RTA.
[7] Robert S. Boyer,et al. Computational Logic , 1990, ESPRIT Basic Research Series.
[8] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .
[9] Stéphane Kaplan,et al. Simplifying Conditional Term Rewriting Systems: Unification, Termination and Confluence , 1987, J. Symb. Comput..
[10] Deepak Kapur,et al. First-Order Theorem Proving Using Conditional Rewrite Rules , 1988, CADE.
[11] D. Kapur,et al. Reduction, superposition and induction: automated reasoning in an equational logic , 1988 .
[12] Michaël Rusinowitch,et al. A New Method for Establishing Refutational Completeness in Theorem Proving , 1986, CADE.