{"id":"https://openalex.org/W2149445267","doi":"https://doi.org/10.1613/jair.4016","title":"Optimal Implementation of Watched Literals and More General Techniques","display_name":"Optimal Implementation of Watched Literals and More General Techniques","publication_year":2013,"publication_date":"2013-10-30","ids":{"openalex":"https://openalex.org/W2149445267","doi":"https://doi.org/10.1613/jair.4016","mag":"2149445267"},"language":"en","primary_location":{"id":"doi:10.1613/jair.4016","is_oa":true,"landing_page_url":"https://doi.org/10.1613/jair.4016","pdf_url":"https://www.jair.org/index.php/jair/article/download/10839/25868","source":{"id":"https://openalex.org/S139930977","display_name":"Journal of Artificial Intelligence Research","issn_l":"1076-9757","issn":["1076-9757","1943-5037"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315760","host_organization_name":"AI Access Foundation","host_organization_lineage":["https://openalex.org/P4310315760"],"host_organization_lineage_names":["AI Access Foundation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Artificial Intelligence Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.jair.org/index.php/jair/article/download/10839/25868","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059061177","display_name":"Ian P. Gent","orcid":"https://orcid.org/0000-0002-5604-7006"},"institutions":[{"id":"https://openalex.org/I16835326","display_name":"University of St Andrews","ror":"https://ror.org/02wn5qz54","country_code":"GB","type":"education","lineage":["https://openalex.org/I16835326"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"I. P. Gent","raw_affiliation_strings":["School of Computer Science, St Andrews University St Andrews, Fife KY16 9SX, UK","benchs-industrial-sat2005.tar.bz2","School of Computer Science, St. Andrews University, St. Andrews, UK"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, St Andrews University St Andrews, Fife KY16 9SX, UK","institution_ids":["https://openalex.org/I16835326"]},{"raw_affiliation_string":"benchs-industrial-sat2005.tar.bz2","institution_ids":[]},{"raw_affiliation_string":"School of Computer Science, St. Andrews University, St. Andrews, UK","institution_ids":["https://openalex.org/I16835326"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5059061177"],"corresponding_institution_ids":["https://openalex.org/I16835326"],"apc_list":null,"apc_paid":null,"fwci":1.8123,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.87540003,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"48","issue":null,"first_page":"231","last_page":"252"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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/T11106","display_name":"Data Management and Algorithms","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9955000281333923,"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/backtracking","display_name":"Backtracking","score":0.923247218132019},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6837462186813354},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6811290979385376},{"id":"https://openalex.org/keywords/literal","display_name":"Literal (mathematical logic)","score":0.6301836371421814},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.589816689491272},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.541476309299469},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49355852603912354},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4372156262397766},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4231565594673157},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4195699095726013},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3084566593170166},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.2866109013557434},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13786479830741882},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08005210757255554}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.923247218132019},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6837462186813354},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6811290979385376},{"id":"https://openalex.org/C2780882242","wikidata":"https://www.wikidata.org/wiki/Q14235582","display_name":"Literal (mathematical logic)","level":2,"score":0.6301836371421814},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.589816689491272},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.541476309299469},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49355852603912354},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4372156262397766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4231565594673157},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4195699095726013},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3084566593170166},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2866109013557434},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13786479830741882},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08005210757255554},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1613/jair.4016","is_oa":true,"landing_page_url":"https://doi.org/10.1613/jair.4016","pdf_url":"https://www.jair.org/index.php/jair/article/download/10839/25868","source":{"id":"https://openalex.org/S139930977","display_name":"Journal of Artificial Intelligence Research","issn_l":"1076-9757","issn":["1076-9757","1943-5037"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315760","host_organization_name":"AI Access Foundation","host_organization_lineage":["https://openalex.org/P4310315760"],"host_organization_lineage_names":["AI Access Foundation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Artificial Intelligence Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1613/jair.4016","is_oa":true,"landing_page_url":"https://doi.org/10.1613/jair.4016","pdf_url":"https://www.jair.org/index.php/jair/article/download/10839/25868","source":{"id":"https://openalex.org/S139930977","display_name":"Journal of Artificial Intelligence Research","issn_l":"1076-9757","issn":["1076-9757","1943-5037"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315760","host_organization_name":"AI Access Foundation","host_organization_lineage":["https://openalex.org/P4310315760"],"host_organization_lineage_names":["AI Access Foundation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Artificial Intelligence Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2149445267.pdf","grobid_xml":"https://content.openalex.org/works/W2149445267.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W21188937","https://openalex.org/W32700456","https://openalex.org/W91781137","https://openalex.org/W100746824","https://openalex.org/W103439665","https://openalex.org/W128869332","https://openalex.org/W1494190982","https://openalex.org/W1518705996","https://openalex.org/W1585537805","https://openalex.org/W1598380601","https://openalex.org/W1815010250","https://openalex.org/W1823248434","https://openalex.org/W1960236202","https://openalex.org/W1988466359","https://openalex.org/W2043829066","https://openalex.org/W2055043227","https://openalex.org/W2085575316","https://openalex.org/W2099980081","https://openalex.org/W2107974651","https://openalex.org/W2122765794","https://openalex.org/W2142785340","https://openalex.org/W2147442986","https://openalex.org/W2150470619","https://openalex.org/W2293009092","https://openalex.org/W3096948300","https://openalex.org/W3098041469","https://openalex.org/W4210551050","https://openalex.org/W4231793453","https://openalex.org/W4233090747","https://openalex.org/W4239089959","https://openalex.org/W4248795023","https://openalex.org/W6603729602","https://openalex.org/W6604141196","https://openalex.org/W6629454889","https://openalex.org/W6635994516","https://openalex.org/W6638571292","https://openalex.org/W6646146904","https://openalex.org/W6647559714","https://openalex.org/W6814292443","https://openalex.org/W7037462566"],"related_works":["https://openalex.org/W2282636749","https://openalex.org/W2004425492","https://openalex.org/W2917772249","https://openalex.org/W94249243","https://openalex.org/W1598581090","https://openalex.org/W2106144871","https://openalex.org/W2394027715","https://openalex.org/W2159664993","https://openalex.org/W2349171103","https://openalex.org/W4253828685"],"abstract_inverted_index":{"I":[0,24],"prove":[1],"that":[2],"an":[3],"implementation":[4,108],"technique":[5],"for":[6],"scanning":[7],"lists":[8],"in":[9,32,39,55,59,74,112],"backtracking":[10],"search":[11,81],"algorithms":[12],"is":[13,101,121],"optimal.":[14],"The":[15,93],"result":[16],"applies":[17,85],"to":[18,48,124],"a":[19,35,80],"simple":[20],"general":[21],"framework,":[22],"which":[23],"present:":[25],"applications":[26],"include":[27],"watched":[28,44],"literal":[29],"unit":[30,110],"propagation":[31,111,116],"SAT":[33],"and":[34,53],"number":[36],"of":[37,97,109],"examples":[38],"constraint":[40],"satisfaction.":[41],"Techniques":[42],"like":[43],"literals":[45],"are":[46],"known":[47],"be":[49,91],"highly":[50],"space":[51],"efficient":[52],"effective":[54],"practice.":[56],"When":[57],"implemented":[58],"the":[60,98,105],"`circular'":[61],"approach":[62],"described":[63],"here,":[64],"these":[65],"techniques":[66],"also":[67,84],"have":[68],"optimal":[69],"run":[70,127],"time":[71,128],"per":[72],"branch":[73],"big-O":[75],"terms":[76],"when":[77,86],"amortized":[78],"across":[79],"tree.":[82],"This":[83],"multiple":[87],"list":[88],"elements":[89],"must":[90],"found.":[92],"constant":[94],"factor":[95],"overhead":[96],"worst":[99],"case":[100],"only":[102],"2.":[103],"Replacing":[104],"existing":[106],"non-optimal":[107],"MiniSat":[113],"speeds":[114],"up":[115],"by":[117],"29%,":[118],"though":[119],"this":[120],"not":[122],"enough":[123],"improve":[125],"overall":[126],"significantly.":[129]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}