{"id":"https://openalex.org/W2105167013","doi":"https://doi.org/10.1109/memcod.2010.5558625","title":"A flexible schema for generating explanations in lazy theory propagation","display_name":"A flexible schema for generating explanations in lazy theory propagation","publication_year":2010,"publication_date":"2010-07-01","ids":{"openalex":"https://openalex.org/W2105167013","doi":"https://doi.org/10.1109/memcod.2010.5558625","mag":"2105167013"},"language":"en","primary_location":{"id":"doi:10.1109/memcod.2010.5558625","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2010.5558625","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032057278","display_name":"Roberto Bruttomesso","orcid":null},"institutions":[{"id":"https://openalex.org/I57201433","display_name":"Universit\u00e0 della Svizzera italiana","ror":"https://ror.org/03c4atk17","country_code":"CH","type":"education","lineage":["https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Roberto Bruttomesso","raw_affiliation_strings":["Universit\u00e0 della Svizzera Italiana, Lugano, Switzerland","Universita della Svizzera Italiana, Lugano, Switzerland#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 della Svizzera Italiana, Lugano, Switzerland","institution_ids":["https://openalex.org/I57201433"]},{"raw_affiliation_string":"Universita della Svizzera Italiana, Lugano, Switzerland#TAB#","institution_ids":["https://openalex.org/I57201433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073257171","display_name":"Edgar Pek","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Edgar Pek","raw_affiliation_strings":["University of Urbana, Champaign, IL, USA","University of Urbana-Champaign, Illinois, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Urbana, Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Urbana-Champaign, Illinois, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075152083","display_name":"Natasha Sharygina","orcid":"https://orcid.org/0000-0002-8872-4913"},"institutions":[{"id":"https://openalex.org/I57201433","display_name":"Universit\u00e0 della Svizzera italiana","ror":"https://ror.org/03c4atk17","country_code":"CH","type":"education","lineage":["https://openalex.org/I57201433"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Natasha Sharygina","raw_affiliation_strings":["Universit\u00e0 della Svizzera Italiana, Lugano, Switzerland","Universita della Svizzera Italiana, Lugano, Switzerland#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 della Svizzera Italiana, Lugano, Switzerland","institution_ids":["https://openalex.org/I57201433"]},{"raw_affiliation_string":"Universita della Svizzera Italiana, Lugano, Switzerland#TAB#","institution_ids":["https://openalex.org/I57201433"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"48","issue":null,"first_page":"41","last_page":"48"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.8106200695037842},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7682263851165771},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6560449600219727},{"id":"https://openalex.org/keywords/schema","display_name":"Schema (genetic algorithms)","score":0.5947606563568115},{"id":"https://openalex.org/keywords/problem-solver","display_name":"Problem solver","score":0.5656698942184448},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5493282675743103},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5071766376495361},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5026636123657227},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.48084935545921326},{"id":"https://openalex.org/keywords/metatheory","display_name":"Metatheory","score":0.4236454665660858},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.399111807346344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3507644534111023},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19995668530464172},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1818234920501709},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.10945504903793335},{"id":"https://openalex.org/keywords/software-engineering","display_name":"Software engineering","score":0.10388615727424622},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.08743530511856079}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.8106200695037842},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7682263851165771},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6560449600219727},{"id":"https://openalex.org/C52146309","wikidata":"https://www.wikidata.org/wiki/Q7431116","display_name":"Schema (genetic algorithms)","level":2,"score":0.5947606563568115},{"id":"https://openalex.org/C3019612716","wikidata":"https://www.wikidata.org/wiki/Q730920","display_name":"Problem solver","level":2,"score":0.5656698942184448},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5493282675743103},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5071766376495361},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5026636123657227},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.48084935545921326},{"id":"https://openalex.org/C39387531","wikidata":"https://www.wikidata.org/wiki/Q1096708","display_name":"Metatheory","level":2,"score":0.4236454665660858},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.399111807346344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3507644534111023},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19995668530464172},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1818234920501709},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10945504903793335},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.10388615727424622},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.08743530511856079}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/memcod.2010.5558625","is_oa":false,"landing_page_url":"https://doi.org/10.1109/memcod.2010.5558625","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.324.5127","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.324.5127","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.verify.inf.unisi.ch/files/bps_memocode2010.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W92576581","https://openalex.org/W169672073","https://openalex.org/W1480909796","https://openalex.org/W1488662850","https://openalex.org/W1500991862","https://openalex.org/W1515175581","https://openalex.org/W1518705996","https://openalex.org/W1522613702","https://openalex.org/W1549880792","https://openalex.org/W1589982562","https://openalex.org/W1775468415","https://openalex.org/W1948299783","https://openalex.org/W2022846948","https://openalex.org/W2044560939","https://openalex.org/W2049281304","https://openalex.org/W2055477538","https://openalex.org/W2091968063","https://openalex.org/W2146110773","https://openalex.org/W4206807714","https://openalex.org/W6603841182","https://openalex.org/W6606921157","https://openalex.org/W6632657806","https://openalex.org/W6635207884","https://openalex.org/W6638298823","https://openalex.org/W6673423232"],"related_works":["https://openalex.org/W2578463151","https://openalex.org/W2810367355","https://openalex.org/W2275420537","https://openalex.org/W1483783534","https://openalex.org/W4379142300","https://openalex.org/W2131919998","https://openalex.org/W4386723279","https://openalex.org/W2048447692","https://openalex.org/W583460537","https://openalex.org/W2884361050"],"abstract_inverted_index":{"Theory":[0],"propagation":[1,69,112],"in":[2,30,70,88],"Satisfiability":[3],"Modulo":[4],"Theories":[5],"is":[6,13,29,85],"crucial":[7],"for":[8,50,67,73,114],"the":[9,21,34,56,80,99],"solver's":[10],"performance.":[11],"It":[12],"important,":[14],"however,":[15],"to":[16,20,25,32,55],"pay":[17],"particular":[18],"care":[19],"amount":[22],"of":[23,101,110],"deductions":[24],"perform.":[26],"The":[27],"risk":[28],"fact":[31],"clog":[33],"SAT-Solver":[35],"with":[36],"too":[37],"many":[38],"(and":[39],"potentially":[40],"useless":[41],"clauses).":[42],"In":[43,58],"this":[44],"paper":[45],"we":[46,60],"review":[47],"some":[48],"techniques":[49],"generating":[51],"and":[52,64,105],"communicating":[53],"clauses":[54],"SAT-Solver.":[57],"addition":[59],"propose":[61],"a":[62,89,102,107],"generic":[63],"flexible":[65,108],"schema":[66,96],"theory":[68,90,103,111],"which":[71],"explanations":[72],"entailed":[74],"facts":[75],"are":[76],"generated":[77],"by":[78],"re-using":[79],"consistency":[81],"check":[82],"procedure":[83],"that":[84,94],"normally":[86],"available":[87],"solver.":[91],"We":[92],"argue":[93],"our":[95],"can":[97],"simplify":[98],"design":[100],"solver,":[104],"allow":[106],"form":[109],"even":[113],"inherently":[115],"hard":[116],"theories":[117],"(such":[118],"as":[119],"bit-vectors).":[120]},"counts_by_year":[{"year":2016,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}