{"id":"https://openalex.org/W2029840387","doi":"https://doi.org/10.1017/s147106840200162x","title":"Learning in a compiler for MINSAT algorithms","display_name":"Learning in a compiler for MINSAT algorithms","publication_year":2003,"publication_date":"2003-05-01","ids":{"openalex":"https://openalex.org/W2029840387","doi":"https://doi.org/10.1017/s147106840200162x","mag":"2029840387"},"language":"en","primary_location":{"id":"doi:10.1017/s147106840200162x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s147106840200162x","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","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/A5081857149","display_name":"Anja Remshagen","orcid":"https://orcid.org/0000-0002-2011-1379"},"institutions":[{"id":"https://openalex.org/I5950314","display_name":"University of West Georgia","ror":"https://ror.org/01cqxk816","country_code":"US","type":"education","lineage":["https://openalex.org/I5950314"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ANJA REMSHAGEN","raw_affiliation_strings":["Department of Computer Science, State University of West Georgia, 1600 Maple St, Carrollton, GA 30118, USA","Department of Computer Science, State University of West Georgia, 1600 Maple St, Carrollton, GA 30118, USA (email: anja@westga.edu)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, State University of West Georgia, 1600 Maple St, Carrollton, GA 30118, USA","institution_ids":["https://openalex.org/I5950314"]},{"raw_affiliation_string":"Department of Computer Science, State University of West Georgia, 1600 Maple St, Carrollton, GA 30118, USA (email: anja@westga.edu)#TAB#","institution_ids":["https://openalex.org/I5950314"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018437728","display_name":"Klaus Truemper","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"KLAUS TRUEMPER","raw_affiliation_strings":["University of Texas at Dallas, Department of Computer Science, EC31, Box 830688, Richardson, TX 75083-0688, USA","University of Texas at Dallas, Department of Computer Science, EC31, Box 830688, Richardson, TX 75083-0688, USA (email: klaus@utdallas.edu)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas at Dallas, Department of Computer Science, EC31, Box 830688, Richardson, TX 75083-0688, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"University of Texas at Dallas, Department of Computer Science, EC31, Box 830688, Richardson, TX 75083-0688, USA (email: klaus@utdallas.edu)#TAB#","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14230051,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"3","first_page":"271","last_page":"286"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9972000122070312,"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.9972000122070312,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9923999905586243,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.988099992275238,"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/computer-science","display_name":"Computer science","score":0.8359657526016235},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.7533845901489258},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.6876358985900879},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6589399576187134},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.6181796193122864},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5838979482650757},{"id":"https://openalex.org/keywords/propositional-formula","display_name":"Propositional formula","score":0.5132803916931152},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.41866767406463623},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.41177111864089966},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.292013943195343},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2853517234325409},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.07115846872329712}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8359657526016235},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7533845901489258},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.6876358985900879},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6589399576187134},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.6181796193122864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5838979482650757},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.5132803916931152},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.41866767406463623},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.41177111864089966},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.292013943195343},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2853517234325409},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.07115846872329712},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s147106840200162x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s147106840200162x","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.25.3791","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.3791","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.utdallas.edu/~klaus/Wpapers/learnminsat.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334763","display_name":"Leibniz-Gemeinschaft","ror":"https://ror.org/01n6r0e97"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W83435933","https://openalex.org/W162552705","https://openalex.org/W1511155470","https://openalex.org/W1573983406","https://openalex.org/W1589170163","https://openalex.org/W1591679289","https://openalex.org/W1599386511","https://openalex.org/W1600919542","https://openalex.org/W1602843561","https://openalex.org/W2029229881","https://openalex.org/W2037960075","https://openalex.org/W2043829066","https://openalex.org/W2046612382","https://openalex.org/W2048051309","https://openalex.org/W2100657934","https://openalex.org/W2108637261","https://openalex.org/W2151720296","https://openalex.org/W2162002204","https://openalex.org/W2276961650","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W949976107","https://openalex.org/W1987118140","https://openalex.org/W2788816388","https://openalex.org/W2990043628","https://openalex.org/W2951901777","https://openalex.org/W2022840750","https://openalex.org/W4298267346","https://openalex.org/W4387656450","https://openalex.org/W2086598417","https://openalex.org/W1834265654"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"learning":[3,74],"in":[4,23],"a":[5,53,82,86],"compiler":[6,79],"for":[7,59,85],"algorithms":[8],"solving":[9],"classes":[10],"of":[11,39,45,98,104,129],"the":[12,18,34,40,78,99,102,105,112,117,120,130],"logic":[13],"minimization":[14],"problem":[15],"MINSAT,":[16],"where":[17,29],"underlying":[19,113],"propositional":[20,55,114],"formula":[21,56],"is":[22],"conjunctive":[24],"normal":[25],"form":[26],"(CNF)":[27],"and":[28,57,69,110],"costs":[30,58],"are":[31],"associated":[32],"with":[33,116],"True":[35,60],"/":[36,61],"False":[37,62],"values":[38,63],"variables.":[41],"Each":[42],"class":[43],"consists":[44],"all":[46,127],"instances":[47,97,128],"that":[48,92,119],"may":[49],"be":[50],"derived":[51],"from":[52],"given":[54,87],"by":[64,70],"fixing":[65],"or":[66],"deleting":[67,71],"variables,":[68],"clauses.":[72],"The":[73,89],"step":[75,90],"begins":[76],"once":[77],"has":[80],"constructed":[81],"solution":[83],"algorithm":[84,93,106,121],"class.":[88,131],"applies":[91],"to":[94],"comparatively":[95],"few":[96],"class,":[100],"analyses":[101],"performance":[103],"on":[107,126],"these":[108],"instances,":[109],"modifies":[111],"formula,":[115],"goal":[118],"will":[122],"perform":[123],"much":[124],"better":[125]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}