Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting-Reference-Cited by-同舟云学术

Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting

Published:1999 Issue: Volume: Page:103-117
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Caron Anne-Cécile,Seynhaeve Franck,Tison Sophie,Tommasi Marc

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48685-2_9

Reference18 articles.

1. Lect Notes Comput Sci;B. Bogaert,1992

2. H. Comon, M. Dauchet, R. Gilleron,, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata , 1997.

3. Hubert Comon. Completion of rewrite systems with membership constraints. Rapport de Recherche 699, L.R.I., Universit de Paris-Sud, September 1991.

4. Lect Notes Comput Sci,1997

5. A.-C. Caron, F. Seynhaeve, S. Tison, and M. Tommasi. Deciding the satisfiability of quantifier free formulae on one-step rewriting. Technical Report TR-99-08, Lab. D’info. Fond. de Lille, 1999. http://www.grappa.univ-lille3.fr/~tommasi .

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tree Automata with Height Constraints between Brothers;Lecture Notes in Computer Science;2014

2. The Existential Fragment of the One-Step Parallel Rewriting Theory;Rewriting Techniques and Applications;2009

3. Tree Automata and Term Rewrite Systems;Rewriting Techniques and Applications;2000

4. Deciding the Satisfiability of Quantifier Free Formulae on One-Step Rewriting;Rewriting Techniques and Applications;1999