{"id":"https://openalex.org/W2559012721","doi":"https://doi.org/10.23638/lmcs-14(2:16)2018","title":"On Sub-Propositional Fragments of Modal Logic","display_name":"On Sub-Propositional Fragments of Modal Logic","publication_year":2018,"publication_date":"2018-06-22","ids":{"openalex":"https://openalex.org/W2559012721","doi":"https://doi.org/10.23638/lmcs-14(2:16)2018","mag":"2559012721"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-14(2:16)2018","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-14(2:16)2018","pdf_url":"https://lmcs.episciences.org/4632/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/4632/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087985917","display_name":"Davide Bresolin","orcid":"https://orcid.org/0000-0003-2253-9878"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Davide Bresolin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010550710","display_name":"Emilio Mu\u00f1oz\u2010Velasco","orcid":"https://orcid.org/0000-0002-0117-4219"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Emilio Mu\u00f1oz-Velasco","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5003911860","display_name":"Guido Sciavicco","orcid":"https://orcid.org/0000-0002-9221-879X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guido Sciavicco","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5087985917"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00611959,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 14, Issue 2","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9986000061035156,"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.9986000061035156,"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.9962000250816345,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9925000071525574,"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/fragment","display_name":"Fragment (logic)","score":0.8223389387130737},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7449146509170532},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.5619825720787048},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5592514872550964},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.5175149440765381},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5097324252128601},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.5022599697113037},{"id":"https://openalex.org/keywords/normal-modal-logic","display_name":"Normal modal logic","score":0.5019631385803223},{"id":"https://openalex.org/keywords/horn-clause","display_name":"Horn clause","score":0.49321144819259644},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.47162318229675293},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.46840307116508484},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.46337026357650757},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44453370571136475},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.435281366109848},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3524126708507538},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27948135137557983},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1806471049785614},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14377427101135254},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.10953953862190247}],"concepts":[{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.8223389387130737},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7449146509170532},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.5619825720787048},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5592514872550964},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.5175149440765381},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5097324252128601},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.5022599697113037},{"id":"https://openalex.org/C114092440","wikidata":"https://www.wikidata.org/wiki/Q840226","display_name":"Normal modal logic","level":4,"score":0.5019631385803223},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.49321144819259644},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.47162318229675293},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.46840307116508484},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.46337026357650757},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44453370571136475},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.435281366109848},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3524126708507538},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27948135137557983},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1806471049785614},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14377427101135254},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.10953953862190247},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-14(2:16)2018","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-14(2:16)2018","pdf_url":"https://lmcs.episciences.org/4632/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1611.08800","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1611.08800","pdf_url":"https://arxiv.org/pdf/1611.08800","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1611.08800","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1611.08800","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-14(2:16)2018","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-14(2:16)2018","pdf_url":"https://lmcs.episciences.org/4632/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320311030","display_name":"Istituto Nazionale di Alta Matematica \"Francesco Severi\"","ror":"https://ror.org/01vx64p53"},{"id":"https://openalex.org/F4320334079","display_name":"Gruppo Nazionale per il Calcolo Scientifico","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2559012721.pdf","grobid_xml":"https://content.openalex.org/works/W2559012721.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1036492","https://openalex.org/W340109471","https://openalex.org/W1581108661","https://openalex.org/W1582149310","https://openalex.org/W1606647729","https://openalex.org/W1866624891","https://openalex.org/W1971043386","https://openalex.org/W1978654873","https://openalex.org/W1980167179","https://openalex.org/W2002672992","https://openalex.org/W2004532354","https://openalex.org/W2005920582","https://openalex.org/W2031823362","https://openalex.org/W2041433942","https://openalex.org/W2041701185","https://openalex.org/W2073491323","https://openalex.org/W2087588854","https://openalex.org/W2093824806","https://openalex.org/W2206596198","https://openalex.org/W2289330807","https://openalex.org/W3124696891"],"related_works":["https://openalex.org/W1537541219","https://openalex.org/W2743317844","https://openalex.org/W4388294910","https://openalex.org/W1528305443","https://openalex.org/W2158696987","https://openalex.org/W155019843","https://openalex.org/W4386297898","https://openalex.org/W2042883980","https://openalex.org/W3106280715","https://openalex.org/W1494843553"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,15,70,79,107],"consider":[4],"the":[5,23,27,30,36,39,42,51,63,89,95,102,109],"well-known":[6],"modal":[7],"logics":[8],"$\\mathbf{K}$,":[9],"$\\mathbf{T}$,":[10],"$\\mathbf{K4}$,":[11],"and":[12,14,41,55,78],"$\\mathbf{S4}$,":[13],"study":[16,108],"some":[17],"of":[18,38,53,67,75,88,101,112],"their":[19,46,113],"sub-propositional":[20],"fragments,":[21,44],"namely":[22],"classical":[24],"Horn":[25,40,103],"fragment,":[26,29,33],"Krom":[28,43],"so-called":[31],"core":[32],"defined":[34],"as":[35],"intersection":[37],"plus":[45],"sub-fragments":[47],"obtained":[48],"by":[49],"limiting":[50],"use":[52],"boxes":[54],"diamonds":[56],"in":[57,99,118],"clauses.":[58],"We":[59],"focus,":[60],"first,":[61],"on":[62],"relative":[64],"expressive":[65,76,97],"power":[66],"such":[68],"languages:":[69],"introduce":[71],"a":[72,81],"suitable":[73],"measure":[74],"power,":[77,98],"obtain":[80],"complex":[82],"hierarchy":[83],"that":[84],"encompasses":[85],"all":[86],"fragments":[87,104],"considered":[90],"logics.":[91],"Then,":[92],"after":[93],"observing":[94],"low":[96],"particular,":[100],"without":[105],"diamonds,":[106],"computational":[110],"complexity":[111],"satisfiability":[114],"problem,":[115],"proving":[116],"that,":[117],"general,":[119],"it":[120],"becomes":[121],"polynomial.":[122]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}
