<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Curtis Bright</style></author><author><style face="normal" font="default" size="100%">Ilias S. Kotsireas</style></author><author><style face="normal" font="default" size="100%">Vijay Ganesh</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">When satisfiability solving meets symbolic computation</style></title><secondary-title><style face="normal" font="default" size="100%">Commun. ACM</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1145/3500921</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">7</style></number><volume><style face="normal" font="default" size="100%">65</style></volume><pages><style face="normal" font="default" size="100%">64–72</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>