{"version.version":"0.0.7","version.cm_url":"https://github.com/ceurws/ceur-spt","spt.html_url":"/Vol-2460/paper3.html","spt.description":null,"spt.id":"Vol-2460/paper3","spt.wikidataid":null,"spt.title":"On the Proof Complexity of MCSAT","spt.pdfUrl":"https://ceur-ws.org/Vol-2460/paper3.pdf","spt.volume":{"number":2460,"acronym":"SC-square 2019","wikidataid":"Q113542809","title":"Proceedings of the 4th SC-Square Workshop","description":"Proceedings of SC-square 2019 workshop","url":"http://ceur-ws.org/Vol-2460/","date":"2019-10-04","dblp":"conf/scsquare/2019","k10plus":"168438978X","urn":"urn:nbn:de:0074-2460-6"},"spt.session":null,"cvb.id":"Vol-2460/paper3","cvb.title":"On the Proof Complexity of MCSAT","cvb.type":null,"cvb.position":null,"cvb.pagesFrom":null,"cvb.pagesTo":null,"cvb.authors":"Gereon Kremer,Erika Ábrahám,Vijay Ganesh","cvb.vol_number":"2460","cvb.pdf_name":"paper3.pdf","cvb.pages":null,"cvb.fail":null,"dblp.dblp_publication_id":"https://dblp.org/rec/conf/scsquare/KremerAG19","dblp.dblp_proceeding_id":"https://dblp.org/rec/conf/scsquare/2019","dblp.volume_number":2460,"dblp.title":"On the Proof Complexity of MCSAT.","dblp.authors":[{"dblp_author_id":"https://dblp.org/pid/168/1169","label":"Gereon Kremer","wikidata_id":null,"orcid_id":"0000-0002-0393-5739","gnd_id":null},{"dblp_author_id":"https://dblp.org/pid/a/ErikaAbraham","label":"Erika Ábrahám","wikidata_id":"Q61628618","orcid_id":"0000-0002-5647-6134","gnd_id":"173826598"},{"dblp_author_id":"https://dblp.org/pid/g/VijayGanesh","label":"Vijay Ganesh 0001","wikidata_id":"Q102110709","orcid_id":"0000-0002-6029-2047","gnd_id":null}],"dblp.pdf_id":"Vol-2460/paper3"}