{"id":"https://openalex.org/W2394717198","doi":"https://doi.org/10.1090/dimacs/026/23","title":"Efficiency and stability of hypergraph SAT algorithms","display_name":"Efficiency and stability of hypergraph SAT algorithms","publication_year":1996,"publication_date":"1996-10-01","ids":{"openalex":"https://openalex.org/W2394717198","doi":"https://doi.org/10.1090/dimacs/026/23","mag":"2394717198"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/026/23","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/026/23","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://iris.unimore.it/bitstream/11380/746223/1/DIMACS93.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070031423","display_name":"Daniele Pretolani","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"D Pretolani","raw_affiliation_strings":["A T & T Bell Laboratories, Murray Hill, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"A T & T Bell Laboratories, Murray Hill, NJ","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070031423"],"corresponding_institution_ids":["https://openalex.org/I1283103587"],"apc_list":null,"apc_paid":null,"fwci":3.5666,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.93164436,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"479","last_page":"498"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9936000108718872,"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.9936000108718872,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9801999926567078,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9800999760627747,"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/hypergraph","display_name":"Hypergraph","score":0.7444421052932739},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.5979946851730347},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5240633487701416},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47106048464775085},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3301995098590851},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2767842411994934},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14527621865272522},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.036576300859451294}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7444421052932739},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.5979946851730347},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5240633487701416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47106048464775085},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3301995098590851},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2767842411994934},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14527621865272522},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.036576300859451294}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1090/dimacs/026/23","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/026/23","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:iris.unimore.it:11380/746223","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/746223","pdf_url":"https://iris.unimore.it/bitstream/11380/746223/1/DIMACS93.pdf","source":{"id":"https://openalex.org/S4377196326","display_name":"Iris Unimore (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/bookPart"}],"best_oa_location":{"id":"pmh:oai:iris.unimore.it:11380/746223","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/746223","pdf_url":"https://iris.unimore.it/bitstream/11380/746223/1/DIMACS93.pdf","source":{"id":"https://openalex.org/S4377196326","display_name":"Iris Unimore (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/bookPart"},"sustainable_development_goals":[{"score":0.5099999904632568,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2394717198.pdf","grobid_xml":"https://content.openalex.org/works/W2394717198.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W1514729613","https://openalex.org/W1972848853","https://openalex.org/W1976816453","https://openalex.org/W2002233041","https://openalex.org/W2103824021","https://openalex.org/W2112660220"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W4376608589","https://openalex.org/W3138003926","https://openalex.org/W4300037846","https://openalex.org/W1630514295","https://openalex.org/W1537073411","https://openalex.org/W2963081352","https://openalex.org/W2472555608","https://openalex.org/W4376608938","https://openalex.org/W4288275998"],"abstract_inverted_index":{"We":[0,14,40],"discuss":[1,41],"some":[2],"topics":[3],"related":[4],"to":[5],"the":[6,46],"practical":[7],"efficiency":[8],"of":[9,48,54],"exact":[10],"methods":[11],"for":[12,51],"satisfiability.":[13],"use":[15],"directed":[16],"hypergraphs":[17],"as":[18],"an":[19],"algorithmic":[20],"and":[21],"modeling":[22],"tool;":[23],"in":[24],"particular,":[25],"we":[26],"propose":[27],"a":[28,34],"new":[29],"relaxation":[30],"technique,":[31],"based":[32],"on":[33],"hypergraph":[35],"depth":[36],"first":[37],"search":[38],"procedure.":[39],"our":[42],"computational":[43],"experience,":[44],"comparing":[45],"suitability":[47],"different":[49],"approaches":[50],"various":[52],"classes":[53],"instances.":[55]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-10-10T00:00:00"}