%0 Conference Paper %1 conf/rta/CaronSTT99 %A Caron, Anne-Cécile %A Seynhaeve, Franck %A Tison, Sophie %A Tommasi, Marc %B RTA %D 1999 %E Narendran, Paliath %E Rusinowitch, Michaël %I Springer %K dblp %P 103-117 %T Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting. %U http://dblp.uni-trier.de/db/conf/rta/rta99.html#CaronSTT99 %V 1631 %@ 3-540-66201-4

@inproceedings{conf/rta/CaronSTT99, added-at = {2021-10-14T00:00:00.000+0200}, author = {Caron, Anne-Cécile and Seynhaeve, Franck and Tison, Sophie and Tommasi, Marc}, biburl = {https://www.bibsonomy.org/bibtex/280ab0d366231198c5a79fab52348faaa/dblp}, booktitle = {RTA}, crossref = {conf/rta/1999}, editor = {Narendran, Paliath and Rusinowitch, Michaël}, ee = {https://doi.org/10.1007/3-540-48685-2_9}, interhash = {3073944a5ac0aae9d9742de1198c25ca}, intrahash = {80ab0d366231198c5a79fab52348faaa}, isbn = {3-540-66201-4}, keywords = {dblp}, pages = {103-117}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T04:51:03.000+0200}, title = {Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting.}, url = {http://dblp.uni-trier.de/db/conf/rta/rta99.html#CaronSTT99}, volume = 1631, year = 1999 }