{"id":"https://openalex.org/W3008962280","doi":"https://doi.org/10.1017/s1471068420000022","title":"selp: <i>A Single-Shot Epistemic Logic Program Solver</i>","display_name":"selp: <i>A Single-Shot Epistemic Logic Program Solver</i>","publication_year":2020,"publication_date":"2020-02-26","ids":{"openalex":"https://openalex.org/W3008962280","doi":"https://doi.org/10.1017/s1471068420000022","mag":"3008962280"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068420000022","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068420000022","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/40284C0BCBA7A614634D66E873BA500F/S1471068420000022a.pdf/div-class-title-selp-span-class-italic-a-single-shot-epistemic-logic-program-solver-span-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/40284C0BCBA7A614634D66E873BA500F/S1471068420000022a.pdf/div-class-title-selp-span-class-italic-a-single-shot-epistemic-logic-program-solver-span-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109482747","display_name":"M. Bichler","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"MANUEL BICHLER","raw_affiliation_strings":["TU Wien, Vienna, Austria, (e-mails:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria, (e-mails:","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050387054","display_name":"Michael Morak","orcid":"https://orcid.org/0000-0002-2077-7672"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"MICHAEL MORAK","raw_affiliation_strings":["TU Wien, Vienna, Austria, (e-mails:"],"raw_orcid":"https://orcid.org/0000-0002-2077-7672","affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria, (e-mails:","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006053030","display_name":"Stefan Woltran","orcid":"https://orcid.org/0000-0003-1594-8972"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"STEFAN WOLTRAN","raw_affiliation_strings":["TU Wien, Vienna, Austria, (e-mails:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria, (e-mails:","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.4011,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.69522547,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"20","issue":"4","first_page":"435","last_page":"455"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9997000098228455,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9997000098228455,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9957000017166138,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9858999848365784,"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/answer-set-programming","display_name":"Answer set programming","score":0.9415313005447388},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7522271871566772},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7159884572029114},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5756350755691528},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5602714419364929},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5536389350891113},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5118705630302429},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5031902194023132},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.4908509850502014},{"id":"https://openalex.org/keywords/stable-model-semantics","display_name":"Stable model semantics","score":0.440216600894928},{"id":"https://openalex.org/keywords/logic-program","display_name":"Logic program","score":0.4389667510986328},{"id":"https://openalex.org/keywords/automated-reasoning","display_name":"Automated reasoning","score":0.4306357502937317},{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.41041818261146545},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.41013896465301514},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.2312464714050293},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.21097040176391602},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15425041317939758},{"id":"https://openalex.org/keywords/multimodal-logic","display_name":"Multimodal logic","score":0.1135500967502594}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.9415313005447388},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7522271871566772},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7159884572029114},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5756350755691528},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5602714419364929},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5536389350891113},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5118705630302429},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5031902194023132},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.4908509850502014},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.440216600894928},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.4389667510986328},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.4306357502937317},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.41041818261146545},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.41013896465301514},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.2312464714050293},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21097040176391602},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15425041317939758},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.1135500967502594},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1471068420000022","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068420000022","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/40284C0BCBA7A614634D66E873BA500F/S1471068420000022a.pdf/div-class-title-selp-span-class-italic-a-single-shot-epistemic-logic-program-solver-span-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s1471068420000022","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068420000022","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/40284C0BCBA7A614634D66E873BA500F/S1471068420000022a.pdf/div-class-title-selp-span-class-italic-a-single-shot-epistemic-logic-program-solver-span-div.pdf","source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3867201627","display_name":"HyperTrac:hypergraph Decompositions and Tractability","funder_award_id":"P30930","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3008962280.pdf","grobid_xml":"https://content.openalex.org/works/W3008962280.grobid-xml"},"referenced_works_count":57,"referenced_works":["https://openalex.org/W165019675","https://openalex.org/W1484403583","https://openalex.org/W1493657719","https://openalex.org/W1514021129","https://openalex.org/W1544757461","https://openalex.org/W1586014657","https://openalex.org/W1672891595","https://openalex.org/W1694306392","https://openalex.org/W1986999264","https://openalex.org/W2049791401","https://openalex.org/W2050890691","https://openalex.org/W2064864283","https://openalex.org/W2076698873","https://openalex.org/W2087432892","https://openalex.org/W2091138122","https://openalex.org/W2134039900","https://openalex.org/W2151485489","https://openalex.org/W2157334516","https://openalex.org/W2159003936","https://openalex.org/W2255903435","https://openalex.org/W2295164601","https://openalex.org/W2345230773","https://openalex.org/W2468539056","https://openalex.org/W2510852717","https://openalex.org/W2518299550","https://openalex.org/W2555704690","https://openalex.org/W2577869962","https://openalex.org/W2607115772","https://openalex.org/W2617661790","https://openalex.org/W2740349328","https://openalex.org/W2742047667","https://openalex.org/W2796002101","https://openalex.org/W2808399616","https://openalex.org/W2905529543","https://openalex.org/W2913952264","https://openalex.org/W2914398864","https://openalex.org/W2962950580","https://openalex.org/W2963234253","https://openalex.org/W2964023786","https://openalex.org/W2986773320","https://openalex.org/W4211177236","https://openalex.org/W4252933876","https://openalex.org/W6628889352","https://openalex.org/W6630562728","https://openalex.org/W6635164272","https://openalex.org/W6637298476","https://openalex.org/W6662876076","https://openalex.org/W6682828956","https://openalex.org/W6683227944","https://openalex.org/W6721425529","https://openalex.org/W6730582142","https://openalex.org/W6738388615","https://openalex.org/W6741749958","https://openalex.org/W6742053817","https://openalex.org/W6750578673","https://openalex.org/W6752991255","https://openalex.org/W6758868416"],"related_works":["https://openalex.org/W2176973685","https://openalex.org/W1607801167","https://openalex.org/W2529281881","https://openalex.org/W2124627636","https://openalex.org/W2597189952","https://openalex.org/W1484108514","https://openalex.org/W1575307414","https://openalex.org/W1512767","https://openalex.org/W95816","https://openalex.org/W2092211394"],"abstract_inverted_index":{"Abstract":[0],"Epistemic":[1],"logic":[2],"programs":[3],"(ELPs)":[4],"are":[5],"an":[6,41],"extension":[7],"of":[8,21,120],"answer":[9],"set":[10,119],"programming":[11],"(ASP)":[12],"with":[13,68],"epistemic":[14],"operators":[15],"that":[16,23,56],"allow":[17],"for":[18],"a":[19,60,80,118],"form":[20],"meta-reasoning,":[22],"is,":[24],"reasoning":[25],"over":[26],"multiple":[27,38],"possible":[28],"worlds.":[29],"Existing":[30],"ELP":[31,102,121],"solving":[32,103],"approaches":[33],"generally":[34],"rely":[35],"on":[36,117],"making":[37],"calls":[39],"to":[40,46,93],"ASP":[42,67,73,97],"solver":[43,113],"in":[44,51,79,109],"order":[45],"evaluate":[47],"the":[48,100],"ELP.":[49],"However,":[50],"this":[52,86,110],"paper,":[53],"we":[54,107],"show":[55],"there":[57],"also":[58],"exists":[59],"direct":[61],"translation":[62],"from":[63],"ELPs":[64],"into":[65,99],"non-ground":[66,96],"bounded":[69],"arity.":[70],"The":[71],"resulting":[72],"program":[74],"can":[75],"thus":[76],"be":[77],"solved":[78],"single":[81],"shot.":[82],"We":[83],"then":[84],"implement":[85],"encoding":[87],"method,":[88],"using":[89],"recently":[90],"proposed":[91],"techniques":[92],"handle":[94],"large,":[95],"rules,":[98],"prototype":[101],"system":[104],"\u201cselp,\u201d":[105],"which":[106],"present":[108],"paper.":[111],"This":[112],"exhibits":[114],"competitive":[115],"performance":[116],"benchmark":[122],"instances.":[123]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-08-12T07:12:00.856984","created_date":"2025-10-10T00:00:00"}