{"id":"https://openalex.org/W1532097860","doi":"https://doi.org/10.1023/a:1012332915908","title":"Easy Cases of Probabilistic Satisfiability","display_name":"Easy Cases of Probabilistic Satisfiability","publication_year":2001,"publication_date":"2001-09-01","ids":{"openalex":"https://openalex.org/W1532097860","doi":"https://doi.org/10.1023/a:1012332915908","mag":"1532097860"},"language":"en","primary_location":{"id":"doi:10.1023/a:1012332915908","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1012332915908","pdf_url":null,"source":{"id":"https://openalex.org/S90199469","display_name":"Annals of Mathematics and Artificial Intelligence","issn_l":"1012-2443","issn":["1012-2443","1573-7470"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Mathematics and Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11380/585402","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020096885","display_name":"Kim Allan Andersen","orcid":"https://orcid.org/0000-0001-8565-8351"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Kim Allan Andersen","raw_affiliation_strings":["Afdeling for Operationsanalyse, Institut for Matematiske Fag, Aarhus Universitet, Bygning 530, Ny Munkegade, DK-8000, \u00c5rhus C, Denmark","Afdeling for Operationsanalyse, Institut for Matematiske Fag, Aarhus Universitet, Bygning 530, Ny Munkegade, DK-8000 \u00c5rhus C, Denmark E-mail:  kima@imf.au.dk"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Afdeling for Operationsanalyse, Institut for Matematiske Fag, Aarhus Universitet, Bygning 530, Ny Munkegade, DK-8000, \u00c5rhus C, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Afdeling for Operationsanalyse, Institut for Matematiske Fag, Aarhus Universitet, Bygning 530, Ny Munkegade, DK-8000 \u00c5rhus C, Denmark E-mail:  kima@imf.au.dk","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070031423","display_name":"Daniele Pretolani","orcid":null},"institutions":[{"id":"https://openalex.org/I112859197","display_name":"Universit\u00e0 di Camerino","ror":"https://ror.org/0005w8d69","country_code":"IT","type":"education","lineage":["https://openalex.org/I112859197"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Daniele Pretolani","raw_affiliation_strings":["Dipartimento di Matematica e Fisica, Universit\u00e0 di Camerino, via Madonna delle Carceri, I-62032, Camerino, Italy","Dipartimento di Matematica e Fisica, Universit\u00e0 di Camerino, via Madonna delle Carceri, I-62032 Camerino, Italy E-mail: pretola@campus.unicam.it#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica e Fisica, Universit\u00e0 di Camerino, via Madonna delle Carceri, I-62032, Camerino, Italy","institution_ids":["https://openalex.org/I112859197"]},{"raw_affiliation_string":"Dipartimento di Matematica e Fisica, Universit\u00e0 di Camerino, via Madonna delle Carceri, I-62032 Camerino, Italy E-mail: pretola@campus.unicam.it#TAB#","institution_ids":["https://openalex.org/I112859197"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020096885"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.0049,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.82869129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"33","issue":"1","first_page":"69","last_page":"91"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9958999752998352,"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.9958999752998352,"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/T10142","display_name":"Formal Methods in Verification","score":0.9891999959945679,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9745000004768372,"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/satisfiability","display_name":"Satisfiability","score":0.6666902899742126},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.6629940271377563},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.596998393535614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5866162776947021},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45904961228370667},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.44728463888168335},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4463379979133606},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.4414677023887634},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.427878737449646},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4243262708187103},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.4208261966705322},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2707716226577759},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.21892088651657104}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6666902899742126},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6629940271377563},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.596998393535614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5866162776947021},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45904961228370667},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.44728463888168335},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4463379979133606},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.4414677023887634},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.427878737449646},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4243262708187103},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.4208261966705322},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2707716226577759},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21892088651657104},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1023/a:1012332915908","is_oa":false,"landing_page_url":"https://doi.org/10.1023/a:1012332915908","pdf_url":null,"source":{"id":"https://openalex.org/S90199469","display_name":"Annals of Mathematics and Artificial Intelligence","issn_l":"1012-2443","issn":["1012-2443","1573-7470"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Mathematics and Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:iris.unimore.it:11380/585402","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/585402","pdf_url":null,"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/article"},{"id":"pmh:oai:pure.atira.dk:publications/8f3a7ab0-c02c-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/8f3a7ab0-c02c-11db-bee9-02004c4f4f50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Andersen, K A & Pretolani, D 2001, 'Easy cases of probabilistic satisfiability', Annals of Mathematics and Artificial Intelligence, vol. 33, no. 1, pp. 69-91. https://doi.org/10.1023/A:1012332915908","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:iris.unimore.it:11380/585402","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/585402","pdf_url":null,"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/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W87882328","https://openalex.org/W1482189126","https://openalex.org/W1965892141","https://openalex.org/W1979442476","https://openalex.org/W1989131954","https://openalex.org/W2011039300","https://openalex.org/W2016810775","https://openalex.org/W2030398195","https://openalex.org/W2042708383","https://openalex.org/W2046228374","https://openalex.org/W2051127798","https://openalex.org/W2054971774","https://openalex.org/W2057441901","https://openalex.org/W2069861393","https://openalex.org/W2072545857","https://openalex.org/W2083756938","https://openalex.org/W2087083200","https://openalex.org/W2112660220","https://openalex.org/W2147407736","https://openalex.org/W2502563397","https://openalex.org/W2626567252","https://openalex.org/W2912748054","https://openalex.org/W2914728526","https://openalex.org/W2914795094","https://openalex.org/W2991172340","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4376608589","https://openalex.org/W3138003926","https://openalex.org/W3089158720","https://openalex.org/W4287372456","https://openalex.org/W3123395501","https://openalex.org/W2925112333","https://openalex.org/W2962367815","https://openalex.org/W4288409376","https://openalex.org/W1594413440","https://openalex.org/W3190027049"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-02T08:42:23.175194","created_date":"2016-06-24T00:00:00"}