%0 Conference Paper %1 conf/cp/GlorianLMS18 %A Glorian, Gael %A Lagniez, Jean-Marie %A Montmirail, Valentin %A Sioutis, Michael %B CP %D 2018 %E Hooker, John N. %I Springer %K dblp %P 160-178 %T An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks. %U http://dblp.uni-trier.de/db/conf/cp/cp2018.html#GlorianLMS18 %V 11008 %@ 978-3-319-98334-9

@inproceedings{conf/cp/GlorianLMS18, added-at = {2023-09-30T00:00:00.000+0200}, author = {Glorian, Gael and Lagniez, Jean-Marie and Montmirail, Valentin and Sioutis, Michael}, biburl = {https://www.bibsonomy.org/bibtex/206d1badc7d17e56557558534d68cd72a/dblp}, booktitle = {CP}, crossref = {conf/cp/2018}, editor = {Hooker, John N.}, ee = {https://doi.org/10.1007/978-3-319-98334-9_11}, interhash = {e1c42c411c29cbaeaaef84014fdc582d}, intrahash = {06d1badc7d17e56557558534d68cd72a}, isbn = {978-3-319-98334-9}, keywords = {dblp}, pages = {160-178}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T14:20:53.000+0200}, title = {An Incremental SAT-Based Approach to Reason Efficiently on Qualitative Constraint Networks.}, url = {http://dblp.uni-trier.de/db/conf/cp/cp2018.html#GlorianLMS18}, volume = 11008, year = 2018 }