{"id":"https://openalex.org/W2078543661","doi":"https://doi.org/10.3166/jancl.15.341-357","title":"Adding clauses to poor man's logic (without increasing the complexity)","display_name":"Adding clauses to poor man's logic (without increasing the complexity)","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2078543661","doi":"https://doi.org/10.3166/jancl.15.341-357","mag":"2078543661"},"language":"en","primary_location":{"id":"doi:10.3166/jancl.15.341-357","is_oa":false,"landing_page_url":"https://doi.org/10.3166/jancl.15.341-357","pdf_url":null,"source":{"id":"https://openalex.org/S93822064","display_name":"Journal of Applied Non-Classical Logics","issn_l":"1166-3081","issn":["1166-3081","1958-5780"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Non-Classical Logics","raw_type":"journal-article"},"type":"article","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/A5101920004","display_name":"Peter J\u00f6nsson","orcid":"https://orcid.org/0000-0002-5288-3330"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Peter Jonsson","raw_affiliation_strings":["a   Department of Computer and Information Science , Link\u00f6ping University , SE-581 83,  Link\u00f6ping ,  Sweden"],"affiliations":[{"raw_affiliation_string":"a   Department of Computer and Information Science , Link\u00f6ping University , SE-581 83,  Link\u00f6ping ,  Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101920004"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11920137,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"3","first_page":"341","last_page":"357"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998999834060669,"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.9998999834060669,"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.9979000091552734,"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.9958000183105469,"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/normal-modal-logic","display_name":"Normal modal logic","score":0.6546207070350647},{"id":"https://openalex.org/keywords/modal-logic","display_name":"Modal logic","score":0.6046853065490723},{"id":"https://openalex.org/keywords/dynamic-logic","display_name":"Dynamic logic (digital electronics)","score":0.6007541418075562},{"id":"https://openalex.org/keywords/accessibility-relation","display_name":"Accessibility relation","score":0.6003780364990234},{"id":"https://openalex.org/keywords/multimodal-logic","display_name":"Multimodal logic","score":0.5941734910011292},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5691893100738525},{"id":"https://openalex.org/keywords/intermediate-logic","display_name":"Intermediate logic","score":0.5595827102661133},{"id":"https://openalex.org/keywords/modal-\u03bc-calculus","display_name":"Modal \u03bc-calculus","score":0.5378763675689697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5135958194732666},{"id":"https://openalex.org/keywords/t-norm-fuzzy-logics","display_name":"T-norm fuzzy logics","score":0.4707993268966675},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4467952251434326},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.4336654841899872},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.4304940700531006},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4290142059326172},{"id":"https://openalex.org/keywords/modal-operator","display_name":"Modal operator","score":0.42773517966270447},{"id":"https://openalex.org/keywords/s5","display_name":"S5","score":0.41898593306541443},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.39392635226249695},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.39139729738235474},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38418155908584595},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3649619221687317},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3428959250450134},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13021212816238403}],"concepts":[{"id":"https://openalex.org/C114092440","wikidata":"https://www.wikidata.org/wiki/Q840226","display_name":"Normal modal logic","level":4,"score":0.6546207070350647},{"id":"https://openalex.org/C27508121","wikidata":"https://www.wikidata.org/wiki/Q210841","display_name":"Modal logic","level":3,"score":0.6046853065490723},{"id":"https://openalex.org/C2777796570","wikidata":"https://www.wikidata.org/wiki/Q2351326","display_name":"Dynamic logic (digital electronics)","level":4,"score":0.6007541418075562},{"id":"https://openalex.org/C11191006","wikidata":"https://www.wikidata.org/wiki/Q2663311","display_name":"Accessibility relation","level":4,"score":0.6003780364990234},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.5941734910011292},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5691893100738525},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.5595827102661133},{"id":"https://openalex.org/C173125200","wikidata":"https://www.wikidata.org/wiki/Q5275729","display_name":"Modal \u03bc-calculus","level":5,"score":0.5378763675689697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5135958194732666},{"id":"https://openalex.org/C86602344","wikidata":"https://www.wikidata.org/wiki/Q7667918","display_name":"T-norm fuzzy logics","level":5,"score":0.4707993268966675},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4467952251434326},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.4336654841899872},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.4304940700531006},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4290142059326172},{"id":"https://openalex.org/C78344899","wikidata":"https://www.wikidata.org/wiki/Q638442","display_name":"Modal operator","level":4,"score":0.42773517966270447},{"id":"https://openalex.org/C192609573","wikidata":"https://www.wikidata.org/wiki/Q7388341","display_name":"S5","level":5,"score":0.41898593306541443},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.39392635226249695},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.39139729738235474},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38418155908584595},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3649619221687317},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3428959250450134},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13021212816238403},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C42011625","wikidata":"https://www.wikidata.org/wiki/Q1055058","display_name":"Fuzzy set","level":3,"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/C172385210","wikidata":"https://www.wikidata.org/wiki/Q5339","display_name":"Transistor","level":3,"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/C165801399","wikidata":"https://www.wikidata.org/wiki/Q25428","display_name":"Voltage","level":2,"score":0.0},{"id":"https://openalex.org/C5263885","wikidata":"https://www.wikidata.org/wiki/Q1967302","display_name":"Membership function","level":4,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3166/jancl.15.341-357","is_oa":false,"landing_page_url":"https://doi.org/10.3166/jancl.15.341-357","pdf_url":null,"source":{"id":"https://openalex.org/S93822064","display_name":"Journal of Applied Non-Classical Logics","issn_l":"1166-3081","issn":["1166-3081","1958-5780"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Non-Classical Logics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"No poverty","id":"https://metadata.un.org/sdg/1","score":0.699999988079071}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W80737574","https://openalex.org/W1511994685","https://openalex.org/W1574675058","https://openalex.org/W1965551900","https://openalex.org/W1972905214","https://openalex.org/W1980794674","https://openalex.org/W2007671683","https://openalex.org/W2011039300","https://openalex.org/W2031823362","https://openalex.org/W2073491323","https://openalex.org/W2076073997","https://openalex.org/W2081744921","https://openalex.org/W2145465694","https://openalex.org/W2160811334","https://openalex.org/W2164680823","https://openalex.org/W2166566648","https://openalex.org/W2608239929","https://openalex.org/W2610670723","https://openalex.org/W4242309855","https://openalex.org/W4301432882"],"related_works":["https://openalex.org/W4233254255","https://openalex.org/W2534562289","https://openalex.org/W4287372193","https://openalex.org/W3122667086","https://openalex.org/W4377031878","https://openalex.org/W2077061463","https://openalex.org/W4386558022","https://openalex.org/W2071180427","https://openalex.org/W2092799756","https://openalex.org/W2735599652"],"abstract_inverted_index":{"Partly":[0],"motivated":[1],"by":[2],"description":[3,132],"logics,":[4],"poor":[5,19,62,88],"man's":[6,20,63,89],"logics":[7,90],"have":[8],"been":[9],"proposed":[10],"as":[11],"an":[12],"interesting":[13],"fragment":[14],"of":[15,45,69,127],"modal":[16,25,57,70],"logics.":[17,133],"A":[18],"logic":[21,26,58,71,116],"is":[22,40,83,117],"a":[23,55,124],"propositional":[24],"where":[27],"only":[28],"literals":[29],"and":[30,35,103,109],"the":[31,43,46,60,67,98,114,128],"connectives":[32],"\u2227,":[33],"\u25a1,":[34],"\u25ca":[36],"are":[37],"allowed.":[38],"It":[39],"known":[41],"that":[42,81],"complexity":[44],"satisfiability":[47],"problem":[48],"may":[49],"drop":[50],"dramatically":[51],"when":[52,113],"going":[53],"from":[54,75],"full":[56],"to":[59,77,86,122],"corresponding":[61],"logic,":[64],"e.g.,":[65],"in":[66,131],"case":[68],"K":[72],"one":[73],"goes":[74],"PSPACE-complete":[76],"coNP-complete.":[78],"We":[79],"prove":[80],"it":[82],"sometimes":[84],"possible":[85],"extend":[87],"with":[91],"restricted":[92,125],"disjunctions":[93],"(i.e.,":[94],"clauses)":[95],"without":[96],"increasing":[97],"computational":[99],"complexity.":[100],"For":[101],"Horn":[102],"Krom":[104],"clauses,":[105],"we":[106],"provide":[107],"necessary":[108],"sufficient":[110],"conditions":[111],"for":[112],"resulting":[115],"polynomial-time.":[118],"Such":[119],"extensions":[120],"correspond":[121],"allowing":[123],"use":[126],"union":[129],"operator":[130]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}