{"id":"https://openalex.org/W2108637261","doi":null,"title":"Using CSP look-back techniques to solve real-world SAT instances","display_name":"Using CSP look-back techniques to solve real-world SAT instances","publication_year":1997,"publication_date":"1997-07-27","ids":{"openalex":"https://openalex.org/W2108637261","mag":"2108637261"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.102.1237","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.1237","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.bayardo.org/ps/aaai97.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5054819515","display_name":"Roberto J. Bayardo","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Roberto J. Bayardo","raw_affiliation_strings":["The University of Texas at Austin, Department of Computer Sciences, Austin, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Texas at Austin, Department of Computer Sciences, Austin, TX","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040895179","display_name":"Robert C. Schrag","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210154074","display_name":"Information Extraction & Transport (United States)","ror":"https://ror.org/04kfqps12","country_code":"US","type":"company","lineage":["https://openalex.org/I4210154074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Schrag","raw_affiliation_strings":[", Information Extraction and Transport, Inc., Arlington, VA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":", Information Extraction and Transport, Inc., Arlington, VA#TAB#","institution_ids":["https://openalex.org/I4210154074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":29.0291,"has_fulltext":false,"cited_by_count":592,"citation_normalized_percentile":{"value":0.99728618,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"203","last_page":"208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994999766349792,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":9.999999747378752e-05,"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/T10142","display_name":"Formal Methods in Verification","score":9.999999747378752e-05,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/propositional-satisfiability","display_name":"propositional satisfiability","score":0.9860000014305115},{"id":"https://openalex.org/keywords/davis-putnam-procedure","display_name":"Davis-Putnam procedure","score":0.8289999961853027},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"constraint satisfaction","score":0.8240000009536743},{"id":"https://openalex.org/keywords/cnf","display_name":"CNF","score":0.6269999742507935},{"id":"https://openalex.org/keywords/planning","display_name":"planning","score":0.527999997138977},{"id":"https://openalex.org/keywords/scheduling","display_name":"scheduling","score":0.9990000128746033},{"id":"https://openalex.org/keywords/circuit-diagnosis","display_name":"circuit diagnosis","score":0.9819999933242798},{"id":"https://openalex.org/keywords/network-synthesis","display_name":"network synthesis","score":0.9890000224113464},{"id":"https://openalex.org/keywords/gsat","display_name":"GSAT","score":0.800000011920929}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6813821196556091},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6789621114730835},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6250752210617065},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5816205739974976},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5475332736968994},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5316921472549438},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.49622923135757446},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46379026770591736},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41568922996520996},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39660733938217163},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3336285352706909},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3316144049167633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18978330492973328},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10453817248344421},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.08970022201538086},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.102.1237","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.1237","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.bayardo.org/ps/aaai97.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.30.2870","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.2870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iet.com/users/schrag/pubs/aaai97.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.50.8269","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.8269","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rakaposhi.eas.asu.edu/pap-archive/bayardo-schrag.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.51.2688","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.2688","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.almaden.ibm.com/cs/people/bayardo/ps/aaai97.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.567.8536","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.567.8536","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.berkeley.edu/~russell/classes/cs289/f04/readings/Bayardo+Schrag:1997.pdf","raw_type":"text"},{"id":"mag:2108637261","doi":null,"is_oa":false,"landing_page_url":"http://www.bayardo.org/ps/aaai97.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"National Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W18004407","https://openalex.org/W145815032","https://openalex.org/W1556434751","https://openalex.org/W1600919542","https://openalex.org/W1667614912","https://openalex.org/W2038118137","https://openalex.org/W2043829066","https://openalex.org/W2057361103","https://openalex.org/W2119815134","https://openalex.org/W2121273320","https://openalex.org/W2153096231","https://openalex.org/W2155218845","https://openalex.org/W2165372647","https://openalex.org/W2567722231"],"related_works":["https://openalex.org/W2611454273","https://openalex.org/W2153096231","https://openalex.org/W7095506225","https://openalex.org/W1520858862","https://openalex.org/W2783227024","https://openalex.org/W1506921670","https://openalex.org/W7101001150","https://openalex.org/W7095230409","https://openalex.org/W14839205","https://openalex.org/W2117188169"],"abstract_inverted_index":{"We":[0,82],"report":[1],"on":[2,20],"the":[3,10,44,103],"performance":[4],"of":[5,9,48,93],"an":[6],"enhanced":[7],"version":[8],"\u201cDavis-Putnam":[11],"\u201d":[12],"(DP)":[13],"proof":[14],"procedure":[15],"for":[16,102],"propositional":[17],"satisfiability":[18],"(SAT)":[19],"large":[21],"instances":[22],"derived":[23],"from":[24],"real-world":[25],"problems":[26,54],"in":[27,91,99],"planning,":[28],"scheduling,":[29],"and":[30,33],"circuit":[31],"diagnosis":[32],"synthesis.":[34],"Our":[35],"results":[36],"show":[37],"that":[38,84],"incorporating":[39],"CSP":[40],"look-back":[41],"techniques--":[42],"especially":[43],"relatively":[45],"new":[46],"technique":[47],"relevance-bounded":[49],"learning--":[50],"renders":[51],"easy":[52],"many":[53],"which":[55],"otherwise":[56],"are":[57,98],"beyond":[58],"DP\u2019s":[59],"reach.":[60],"Frequently":[61],"they":[62,97],"make":[63],"DP,":[64,94],"a":[65],"systematic":[66,100],"algorithm,":[67],"perform":[68],"as":[69,78,89,96],"well":[70],"or":[71,80],"better":[72],"than":[73],"stochastic":[74],"SAT":[75],"algorithms":[76,101],"such":[77,85],"GSAT":[79],"WSAT.":[81],"recommend":[83],"techniques":[86],"be":[87],"included":[88],"options":[90],"implementations":[92],"just":[95],"more":[104],"general":[105],"constraint":[106],"satisfaction":[107],"problem.":[108]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":18},{"year":2020,"cited_by_count":19},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":18},{"year":2017,"cited_by_count":16},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":27},{"year":2012,"cited_by_count":13}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}