{"id":"https://openalex.org/W2065795966","doi":"https://doi.org/10.1145/1233341.1233446","title":"Propositional reasoning by dimensional reduction","display_name":"Propositional reasoning by dimensional reduction","publication_year":2007,"publication_date":"2007-03-23","ids":{"openalex":"https://openalex.org/W2065795966","doi":"https://doi.org/10.1145/1233341.1233446","mag":"2065795966"},"language":"en","primary_location":{"id":"doi:10.1145/1233341.1233446","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1233341.1233446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 45th annual southeast regional conference","raw_type":"proceedings-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/A5054175103","display_name":"Robin Lohfer","orcid":null},"institutions":[{"id":"https://openalex.org/I150468666","display_name":"Emory University","ror":"https://ror.org/03czfpz43","country_code":"US","type":"education","lineage":["https://openalex.org/I150468666"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robin Lohfer","raw_affiliation_strings":["Emory University, Atlanta, GA","Emory university, Atlanta, GA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Emory University, Atlanta, GA","institution_ids":["https://openalex.org/I150468666"]},{"raw_affiliation_string":"Emory university, Atlanta, GA","institution_ids":["https://openalex.org/I150468666"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101476502","display_name":"James J. Lu","orcid":"https://orcid.org/0000-0001-7888-7412"},"institutions":[{"id":"https://openalex.org/I150468666","display_name":"Emory University","ror":"https://ror.org/03czfpz43","country_code":"US","type":"education","lineage":["https://openalex.org/I150468666"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James J. Lu","raw_affiliation_strings":["Emory University, Atlanta, GA","Emory university, Atlanta, GA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Emory University, Atlanta, GA","institution_ids":["https://openalex.org/I150468666"]},{"raw_affiliation_string":"Emory university, Atlanta, GA","institution_ids":["https://openalex.org/I150468666"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I150468666"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13764488,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"525","last_page":"526"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"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.9997000098228455,"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.9958000183105469,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9897000193595886,"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/satisfiability","display_name":"Satisfiability","score":0.6994363069534302},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6242055892944336},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6202124357223511},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.5476022958755493},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5362076163291931},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5173853635787964},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5099350214004517},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.5081322193145752},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43232786655426025},{"id":"https://openalex.org/keywords/dpll-algorithm","display_name":"DPLL algorithm","score":0.4238680899143219},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3353578746318817},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2909427285194397},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2597961127758026},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08330217003822327}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6994363069534302},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6242055892944336},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6202124357223511},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.5476022958755493},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5362076163291931},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5173853635787964},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5099350214004517},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.5081322193145752},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43232786655426025},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.4238680899143219},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3353578746318817},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2909427285194397},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2597961127758026},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08330217003822327},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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":1,"locations":[{"id":"doi:10.1145/1233341.1233446","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1233341.1233446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 45th annual southeast regional conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1511155470","https://openalex.org/W1546998411","https://openalex.org/W1569872967","https://openalex.org/W1964840444","https://openalex.org/W2105210717","https://openalex.org/W3045969830"],"related_works":["https://openalex.org/W2007316622","https://openalex.org/W2408711288","https://openalex.org/W1024451821","https://openalex.org/W2094368841","https://openalex.org/W2048447692","https://openalex.org/W4399433994","https://openalex.org/W2128006027","https://openalex.org/W3176904788","https://openalex.org/W2142281466","https://openalex.org/W1598398537"],"abstract_inverted_index":{"Divide-and-conquer":[0],"is":[1,26,42],"an":[2,29],"effective":[3],"general":[4],"problem":[5,34],"solving":[6],"strategy,":[7],"and":[8],"has":[9],"been":[10],"applied":[11],"to":[12,14,27],"improve":[13],"the":[15,24,33,54,57],"performance":[16],"of":[17,32],"search":[18],"procedures.":[19],"The":[20],"challenge":[21],"in":[22],"applying":[23],"strategy":[25],"find":[28],"appropriate":[30],"decomposition":[31,41],"into":[35],"subproblems.":[36],"In":[37],"this":[38],"paper,":[39],"a":[40],"presented":[43],"for":[44,56],"n-dimensional":[45],"propositional":[46],"satisfiability":[47],"problems.":[48],"Experiments":[49],"with":[50],"timetable":[51],"scheduling":[52],"show":[53],"potential":[55],"technique.":[58]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}