{"id":"https://openalex.org/W2113726481","doi":"https://doi.org/10.1007/978-3-642-22438-6_27","title":"A Hybrid Method for Probabilistic Satisfiability","display_name":"A Hybrid Method for Probabilistic Satisfiability","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2113726481","doi":"https://doi.org/10.1007/978-3-642-22438-6_27","mag":"2113726481"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-22438-6_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-22438-6_27","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/A5057270325","display_name":"Pavel Klinov","orcid":null},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Pavel Klinov","raw_affiliation_strings":["University of Manchester, Manchester, UK","University\u00a0of\u00a0Manchester, Manchester, UK"],"affiliations":[{"raw_affiliation_string":"University of Manchester, Manchester, UK","institution_ids":["https://openalex.org/I28407311"]},{"raw_affiliation_string":"University\u00a0of\u00a0Manchester, Manchester, UK","institution_ids":["https://openalex.org/I28407311"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005432645","display_name":"Bijan Parsia","orcid":"https://orcid.org/0000-0002-3222-7571"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Bijan Parsia","raw_affiliation_strings":["University of Manchester, Manchester, UK","University\u00a0of\u00a0Manchester, Manchester, UK"],"affiliations":[{"raw_affiliation_string":"University of Manchester, Manchester, UK","institution_ids":["https://openalex.org/I28407311"]},{"raw_affiliation_string":"University\u00a0of\u00a0Manchester, Manchester, UK","institution_ids":["https://openalex.org/I28407311"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057270325"],"corresponding_institution_ids":["https://openalex.org/I28407311"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.7263,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.93965356,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"354","last_page":"368"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9994000196456909,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9994000196456909,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.991100013256073,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9876000285148621,"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.7863215208053589},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7396984696388245},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6978604793548584},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.6235384941101074},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5091769099235535},{"id":"https://openalex.org/keywords/classical-logic","display_name":"Classical logic","score":0.4477882981300354},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.44640350341796875},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.4266173839569092},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4222137928009033},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4170231521129608},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.361406147480011},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.3204415440559387},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26879894733428955},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23261356353759766},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12085837125778198}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7863215208053589},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7396984696388245},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6978604793548584},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.6235384941101074},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5091769099235535},{"id":"https://openalex.org/C32241873","wikidata":"https://www.wikidata.org/wiki/Q236975","display_name":"Classical logic","level":2,"score":0.4477882981300354},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.44640350341796875},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.4266173839569092},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4222137928009033},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4170231521129608},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.361406147480011},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.3204415440559387},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26879894733428955},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23261356353759766},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12085837125778198},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"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/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-22438-6_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-22438-6_27","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"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/e5e24e85-265d-49f8-9bee-47f8e9d03863","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/e5e24e85-265d-49f8-9bee-47f8e9d03863","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Klinov, P, Parsia, B, Bj\u00f8rner, N (ed.) & Sofronie-Stokkermans, V (ed.) 2011, A hybrid method for probabilistic satisfiability. in N Bj\u00f8rner & V Sofronie-Stokkermans (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. vol. 6803, Springer Nature, pp. 354-368, 23rd International Conference on Automated Deduction, CADE 23, Wroclaw, 1/07/11. https://doi.org/10.1007/978-3-642-22438-6_27","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/e5e24e85-265d-49f8-9bee-47f8e9d03863","is_oa":false,"landing_page_url":"https://www.research.manchester.ac.uk/portal/en/publications/a-hybrid-method-for-probabilistic-satisfiability(e5e24e85-265d-49f8-9bee-47f8e9d03863).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Klinov, P, Parsia, B, Bj\u00f8rner, N (ed.) & Sofronie-Stokkermans, V (ed.) 2011, A hybrid method for probabilistic satisfiability. in N Bj\u00f8rner & V Sofronie-Stokkermans (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. vol. 6803, Springer Nature, pp. 354-368, 23rd International Conference on Automated Deduction, CADE 23, Wroclaw, 1/07/11. https://doi.org/10.1007/978-3-642-22438-6_27","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W101127628","https://openalex.org/W744850673","https://openalex.org/W1518632789","https://openalex.org/W1563588242","https://openalex.org/W1678959094","https://openalex.org/W1965892141","https://openalex.org/W1977946745","https://openalex.org/W1987500336","https://openalex.org/W2055641305","https://openalex.org/W2066210485","https://openalex.org/W2108309071","https://openalex.org/W2154829072","https://openalex.org/W2571189784","https://openalex.org/W2584768186","https://openalex.org/W2914728526","https://openalex.org/W2914795094","https://openalex.org/W4210982795"],"related_works":["https://openalex.org/W2404668260","https://openalex.org/W2998265132","https://openalex.org/W3012061787","https://openalex.org/W2212155158","https://openalex.org/W1519385203","https://openalex.org/W2883329459","https://openalex.org/W2993327920","https://openalex.org/W2113726481","https://openalex.org/W1555272910","https://openalex.org/W2041526687"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}