{"id":"https://openalex.org/W1916519491","doi":"https://doi.org/10.1007/3-540-46135-3_14","title":"Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation","display_name":"Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1916519491","doi":"https://doi.org/10.1007/3-540-46135-3_14","mag":"1916519491"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-46135-3_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-46135-3_14","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5101985940","display_name":"Lintao Zhang","orcid":"https://orcid.org/0009-0005-7527-8183"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lintao Zhang","raw_affiliation_strings":["Department of Electrical Engineering, Princeton University, Princeton, NJ, 08544","Princeton University#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Princeton University, Princeton, NJ, 08544","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University#TAB#","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085975362","display_name":"Sharad Malik","orcid":"https://orcid.org/0000-0002-0837-5443"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sharad Malik","raw_affiliation_strings":["Department of Electrical Engineering, Princeton University, Princeton, NJ, 08544","Princeton University#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Princeton University, Princeton, NJ, 08544","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University#TAB#","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101985940"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":13.3802,"has_fulltext":false,"cited_by_count":119,"citation_normalized_percentile":{"value":0.99149771,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"200","last_page":"215"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9988999962806702,"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.9988999962806702,"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/T10211","display_name":"Computational Drug Discovery Methods","score":0.9876000285148621,"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.9810000061988831,"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/dpll-algorithm","display_name":"DPLL algorithm","score":0.9435807466506958},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.8278859257698059},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.7851842641830444},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.6999316215515137},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6943957805633545},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6449447870254517},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.618475079536438},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49566638469696045},{"id":"https://openalex.org/keywords/constraint-learning","display_name":"Constraint learning","score":0.48133477568626404},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4432026743888855},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4371016025543213},{"id":"https://openalex.org/keywords/disjunctive-normal-form","display_name":"Disjunctive normal form","score":0.4340325593948364},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4110392928123474},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.36590707302093506},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24747365713119507},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24095124006271362},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15834930539131165},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1419786810874939},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.08508548140525818}],"concepts":[{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.9435807466506958},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.8278859257698059},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.7851842641830444},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.6999316215515137},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6943957805633545},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6449447870254517},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.618475079536438},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49566638469696045},{"id":"https://openalex.org/C29230964","wikidata":"https://www.wikidata.org/wiki/Q5164376","display_name":"Constraint learning","level":5,"score":0.48133477568626404},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4432026743888855},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4371016025543213},{"id":"https://openalex.org/C136726353","wikidata":"https://www.wikidata.org/wiki/Q903789","display_name":"Disjunctive normal form","level":2,"score":0.4340325593948364},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4110392928123474},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.36590707302093506},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24747365713119507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24095124006271362},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15834930539131165},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1419786810874939},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.08508548140525818},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-46135-3_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-46135-3_14","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1495266209","https://openalex.org/W1501554968","https://openalex.org/W1505590927","https://openalex.org/W1511155470","https://openalex.org/W1553278548","https://openalex.org/W1571893670","https://openalex.org/W1597057550","https://openalex.org/W1787074469","https://openalex.org/W1789541852","https://openalex.org/W1836852804","https://openalex.org/W1862403209","https://openalex.org/W1976876676","https://openalex.org/W1979840340","https://openalex.org/W2005573219","https://openalex.org/W2012165860","https://openalex.org/W2044560939","https://openalex.org/W2057361103","https://openalex.org/W2096307462","https://openalex.org/W2108637261","https://openalex.org/W2135989067","https://openalex.org/W2142785340","https://openalex.org/W2153096231","https://openalex.org/W3045969830","https://openalex.org/W3098378096","https://openalex.org/W4231640108","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2061097805","https://openalex.org/W1496518193","https://openalex.org/W138251527","https://openalex.org/W2504339508","https://openalex.org/W2098087031","https://openalex.org/W2407696767","https://openalex.org/W1881465754","https://openalex.org/W4388328356","https://openalex.org/W2611506716","https://openalex.org/W1916519491"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}