{"id":"https://openalex.org/W7117486004","doi":"https://doi.org/10.1016/j.jsc.2025.102543","title":"Satisfiability modulo theories for verifying MILP certificates","display_name":"Satisfiability modulo theories for verifying MILP certificates","publication_year":2025,"publication_date":"2025-12-29","ids":{"openalex":"https://openalex.org/W7117486004","doi":"https://doi.org/10.1016/j.jsc.2025.102543"},"language":"en","primary_location":{"id":"doi:10.1016/j.jsc.2025.102543","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.jsc.2025.102543","pdf_url":null,"source":{"id":"https://openalex.org/S18904315","display_name":"Journal of Symbolic Computation","issn_l":"0747-7171","issn":["0747-7171","1095-855X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Computation","raw_type":"journal-article"},"type":"article","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/A5082400896","display_name":"Kenan Wood","orcid":null},"institutions":[{"id":"https://openalex.org/I141720752","display_name":"Davidson College","ror":"https://ror.org/02f7k4z58","country_code":"US","type":"education","lineage":["https://openalex.org/I141720752"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kenan Wood","raw_affiliation_strings":["Davidson College, 225 Baker Dr, Box 5000, Davidson, NC 28035, United States of America"],"affiliations":[{"raw_affiliation_string":"Davidson College, 225 Baker Dr, Box 5000, Davidson, NC 28035, United States of America","institution_ids":["https://openalex.org/I141720752"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112984649","display_name":"Runtian Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Runtian Zhou","raw_affiliation_strings":["Duke University, Durham, NC 27708, United States of America"],"affiliations":[{"raw_affiliation_string":"Duke University, Durham, NC 27708, United States of America","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100637734","display_name":"Haoze Wu","orcid":"https://orcid.org/0000-0002-5077-144X"},"institutions":[{"id":"https://openalex.org/I177605424","display_name":"Amherst College","ror":"https://ror.org/028vqfs63","country_code":"US","type":"education","lineage":["https://openalex.org/I177605424"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Haoze Wu","raw_affiliation_strings":["Amherst College, Amherst, MA 01002, United States of America"],"affiliations":[{"raw_affiliation_string":"Amherst College, Amherst, MA 01002, United States of America","institution_ids":["https://openalex.org/I177605424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049822188","display_name":"Hammurabi Mendes","orcid":"https://orcid.org/0000-0002-3741-5096"},"institutions":[{"id":"https://openalex.org/I141720752","display_name":"Davidson College","ror":"https://ror.org/02f7k4z58","country_code":"US","type":"education","lineage":["https://openalex.org/I141720752"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hammurabi Mendes","raw_affiliation_strings":["Davidson College, Mathematics and Computer Science, 209 Ridge Rd, Box 5000, Davidson, NC 28035, United States of America"],"affiliations":[{"raw_affiliation_string":"Davidson College, Mathematics and Computer Science, 209 Ridge Rd, Box 5000, Davidson, NC 28035, United States of America","institution_ids":["https://openalex.org/I141720752"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070329454","display_name":"Jonad Pulaj","orcid":"https://orcid.org/0000-0002-5741-7187"},"institutions":[{"id":"https://openalex.org/I141720752","display_name":"Davidson College","ror":"https://ror.org/02f7k4z58","country_code":"US","type":"education","lineage":["https://openalex.org/I141720752"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jonad Pulaj","raw_affiliation_strings":["Davidson College, Mathematics and Computer Science, 209 Ridge Rd, Box 5000, Davidson, NC 28035, United States of America"],"affiliations":[{"raw_affiliation_string":"Davidson College, Mathematics and Computer Science, 209 Ridge Rd, Box 5000, Davidson, NC 28035, United States of America","institution_ids":["https://openalex.org/I141720752"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5049822188","https://openalex.org/A5070329454","https://openalex.org/A5082400896","https://openalex.org/A5100637734","https://openalex.org/A5112984649"],"corresponding_institution_ids":["https://openalex.org/I141720752","https://openalex.org/I170897317","https://openalex.org/I177605424"],"apc_list":{"value":2770,"currency":"USD","value_usd":2770},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.74614969,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"135","issue":null,"first_page":"102543","last_page":"102543"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.7067000269889832,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.7067000269889832,"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/T10126","display_name":"Logic, programming, and type systems","score":0.18160000443458557,"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/T11504","display_name":"Advanced Authentication Protocols Security","score":0.026799999177455902,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/correctness","display_name":"Correctness","score":0.7627000212669373},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.7107999920845032},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5888000130653381},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5178999900817871},{"id":"https://openalex.org/keywords/certificate","display_name":"Certificate","score":0.43849998712539673},{"id":"https://openalex.org/keywords/schema","display_name":"Schema (genetic algorithms)","score":0.4246000051498413},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.41609999537467957},{"id":"https://openalex.org/keywords/encode","display_name":"ENCODE","score":0.3822999894618988}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7627000212669373},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.7107999920845032},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6047000288963318},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5888000130653381},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5178999900817871},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47440001368522644},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.461899995803833},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44279998540878296},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.43849998712539673},{"id":"https://openalex.org/C52146309","wikidata":"https://www.wikidata.org/wiki/Q7431116","display_name":"Schema (genetic algorithms)","level":2,"score":0.4246000051498413},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.41609999537467957},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.3822999894618988},{"id":"https://openalex.org/C65880906","wikidata":"https://www.wikidata.org/wiki/Q1771121","display_name":"Sequent calculus","level":3,"score":0.3783999979496002},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.3562000095844269},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.3560999929904938},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.336899995803833},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31690001487731934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3109999895095825},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.31040000915527344},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.30079999566078186},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.2989000082015991},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.29350000619888306},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C3746660","wikidata":"https://www.wikidata.org/wiki/Q1068763","display_name":"Rule of inference","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C519991488","wikidata":"https://www.wikidata.org/wiki/Q28865","display_name":"Python (programming language)","level":2,"score":0.2587999999523163},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2540000081062317},{"id":"https://openalex.org/C35292069","wikidata":"https://www.wikidata.org/wiki/Q1575458","display_name":"Validator","level":2,"score":0.2522999942302704}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.jsc.2025.102543","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.jsc.2025.102543","pdf_url":null,"source":{"id":"https://openalex.org/S18904315","display_name":"Journal of Symbolic Computation","issn_l":"0747-7171","issn":["0747-7171","1095-855X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W221832247","https://openalex.org/W1480909796","https://openalex.org/W1531154924","https://openalex.org/W1599039905","https://openalex.org/W1936354298","https://openalex.org/W2018660239","https://openalex.org/W2090857454","https://openalex.org/W2159130720","https://openalex.org/W2311812978","https://openalex.org/W2345876752","https://openalex.org/W2513208540","https://openalex.org/W2558711366","https://openalex.org/W2735882127","https://openalex.org/W2785044350","https://openalex.org/W2900840427","https://openalex.org/W3037206882","https://openalex.org/W3111497901","https://openalex.org/W3136504866","https://openalex.org/W3175444848","https://openalex.org/W3211222374","https://openalex.org/W4225922019","https://openalex.org/W4250846042","https://openalex.org/W4281931618","https://openalex.org/W4289816080","https://openalex.org/W4390605288","https://openalex.org/W4391881660"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-01-19T04:01:09.351973","created_date":"2025-12-29T00:00:00"}