Author:
Tushkanova E.,Giorgetti A.,Ringeissen C.,Kouchnarenko O.
Reference22 articles.
1. A rewriting approach to satisfiability procedures;Armando;Inf. Comput.,2003
2. Paramodulation-based theorem proving;Nieuwenhuis,2001
3. Automatic decidability;Lynch,2002
4. Automatic decidability and combinability;Lynch;Inf. Comput.,2011
5. A rule-based framework for building superposition-based decision procedures;Tushkanova,2012
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Variant-based Equational Unification under Constructor Symbols;Electronic Proceedings in Theoretical Computer Science;2020-09-19
2. Programming and symbolic computation in Maude;Journal of Logical and Algebraic Methods in Programming;2020-01
3. Most General Variant Unifiers;Electronic Proceedings in Theoretical Computer Science;2019-09-19
4. Variant-based satisfiability in initial algebras;Science of Computer Programming;2018-03
5. Symbolic Reasoning Methods in Rewriting Logic and Maude;Logic, Language, Information, and Computation;2018