{"id":"https://openalex.org/W2395966774","doi":"https://doi.org/10.29007/wm7w","title":"Implementing an Efficient SAT Solver for a Probabilistic Description Logic","display_name":"Implementing an Efficient SAT Solver for a Probabilistic Description Logic","publication_year":2018,"publication_date":"2018-01-23","ids":{"openalex":"https://openalex.org/W2395966774","doi":"https://doi.org/10.29007/wm7w","mag":"2395966774"},"language":"en","primary_location":{"id":"doi:10.29007/wm7w","is_oa":true,"landing_page_url":"https://doi.org/10.29007/wm7w","pdf_url":"https://easychair.org/publications/open/t1","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://easychair.org/publications/open/t1","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057270325","display_name":"Pavel Klinov","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Pavel Klinov","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5005432645","display_name":"Bijan Parsia","orcid":"https://orcid.org/0000-0002-3222-7571"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bijan Parsia","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057270325"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00477422,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"48","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10215","display_name":"Semantic Web and Ontologies","score":0.996399998664856,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.996399998664856,"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.9919000267982483,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9879999756813049,"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.8534737825393677},{"id":"https://openalex.org/keywords/probabilistic-ctl","display_name":"Probabilistic CTL","score":0.8111376762390137},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6318871378898621},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5964526534080505},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.5949286818504333},{"id":"https://openalex.org/keywords/probabilistic-argumentation","display_name":"Probabilistic argumentation","score":0.5514864325523376},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.49868202209472656},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.49527254700660706},{"id":"https://openalex.org/keywords/probabilistic-relevance-model","display_name":"Probabilistic relevance model","score":0.4653625786304474},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44138118624687195},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43549519777297974},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.42919105291366577},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.41207560896873474},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.40440455079078674},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3365846574306488},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3099583685398102},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.225104421377182},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1413257122039795}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.8534737825393677},{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.8111376762390137},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6318871378898621},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5964526534080505},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.5949286818504333},{"id":"https://openalex.org/C128828806","wikidata":"https://www.wikidata.org/wiki/Q7246848","display_name":"Probabilistic argumentation","level":3,"score":0.5514864325523376},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.49868202209472656},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.49527254700660706},{"id":"https://openalex.org/C143017306","wikidata":"https://www.wikidata.org/wiki/Q3318133","display_name":"Probabilistic relevance model","level":4,"score":0.4653625786304474},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44138118624687195},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43549519777297974},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.42919105291366577},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.41207560896873474},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.40440455079078674},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3365846574306488},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3099583685398102},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.225104421377182},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1413257122039795},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.29007/wm7w","is_oa":true,"landing_page_url":"https://doi.org/10.29007/wm7w","pdf_url":"https://easychair.org/publications/open/t1","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.418.669","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.418.669","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.easychair.org/publications/?page=1580488232","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.639.3690","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.639.3690","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.easychair.org/publications/?page=1580488232","raw_type":"text"}],"best_oa_location":{"id":"doi:10.29007/wm7w","is_oa":true,"landing_page_url":"https://doi.org/10.29007/wm7w","pdf_url":"https://easychair.org/publications/open/t1","source":{"id":"https://openalex.org/S4220651395","display_name":"EPiC series in computing","issn_l":"2398-7340","issn":["2398-7340"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EPiC Series in Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2395966774.pdf","grobid_xml":"https://content.openalex.org/works/W2395966774.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W34871118","https://openalex.org/W1507548050","https://openalex.org/W1545882461","https://openalex.org/W1568509943","https://openalex.org/W1593288312","https://openalex.org/W1987500336","https://openalex.org/W2021343121","https://openalex.org/W2055641305","https://openalex.org/W2151398141","https://openalex.org/W2401486045","https://openalex.org/W6629203997","https://openalex.org/W6632440936","https://openalex.org/W6632933753","https://openalex.org/W6637280203","https://openalex.org/W6682683439"],"related_works":["https://openalex.org/W4238495367","https://openalex.org/W2749065928","https://openalex.org/W2225666389","https://openalex.org/W3214184572","https://openalex.org/W1499367685","https://openalex.org/W2371210594","https://openalex.org/W3149394920","https://openalex.org/W3206245021","https://openalex.org/W2471401686","https://openalex.org/W2494523064"],"abstract_inverted_index":{"This":[0,35],"paper":[1,60],"presents":[2],"an":[3,63,113],"optimized":[4],"algorithm":[5,64,100,120],"for":[6,85,104],"solving":[7],"the":[8,13,24,43,53,86,93,98,119],"satisfiability":[9],"problem":[10,26,69],"(PSAT)":[11],"in":[12,47,131],"probabilistic":[14,22,56,107,123,129],"description":[15],"logic":[16],"P-SROIQ.":[17],"P-SROIQ":[18],"and":[19],"related":[20],"Nilsson-style":[21],"logics":[23],"PSAT":[25,81],"is":[27,71],"typically":[28],"solved":[29],"by":[30],"reduction":[31],"to":[32,65,80,92,133],"linear":[33,48],"programming.":[34],"straightforward":[36],"approach":[37],"does":[38],"not":[39],"scale":[40],"well":[41],"because":[42],"number":[44,54,136],"of":[45,55,95,112,126,137],"variables":[46],"programs":[49],"grows":[50],"exponentially":[51],"with":[52,67],"statements.":[57],"In":[58],"this":[59,68,90],"we":[61],"demonstrate":[62],"cope":[66],"which":[70,101,116],"based":[72],"on":[73],"column":[74,77],"generation.":[75],"Although":[76],"generation":[78],"approaches":[79],"have":[82],"been":[83],"known":[84],"last":[87],"two":[88],"decades,":[89],"is,":[91],"best":[94],"our":[96],"knowledge,":[97],"first":[99],"also":[102],"works":[103],"a":[105],"non-propositional":[106],"logic.":[108],"We":[109],"report":[110],"results":[111],"empirical":[114],"investigation":[115],"show":[117],"that":[118],"can":[121],"handle":[122],"knowledge":[124],"bases":[125],"about":[127],"1000":[128],"statements":[130],"addition":[132],"even":[134],"larger":[135],"classical":[138],"SROIQ":[139],"axioms.":[140]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}