{"id":"https://openalex.org/W4399116287","doi":"https://doi.org/10.1017/s1471068424000140","title":"A Novel Framework for Systematic Propositional Formula Simplification Based on Existential Graphs","display_name":"A Novel Framework for Systematic Propositional Formula Simplification Based on Existential Graphs","publication_year":2025,"publication_date":"2025-05-01","ids":{"openalex":"https://openalex.org/W4399116287","doi":"https://doi.org/10.1017/s1471068424000140"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068424000140","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068424000140","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/40C60F438D91B660283ABA7C85359C65/S1471068424000140a.pdf/div-class-title-a-novel-framework-for-systematic-propositional-formula-simplification-based-on-existential-graphs-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":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/40C60F438D91B660283ABA7C85359C65/S1471068424000140a.pdf/div-class-title-a-novel-framework-for-systematic-propositional-formula-simplification-based-on-existential-graphs-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035856295","display_name":"Jordina Franc\u00e8s de Mas","orcid":null},"institutions":[{"id":"https://openalex.org/I16835326","display_name":"University of St Andrews","ror":"https://ror.org/02wn5qz54","country_code":"GB","type":"education","lineage":["https://openalex.org/I16835326"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"JORDINA FRANC\u00c8S DE MAS","raw_affiliation_strings":["School of Computer Science, University of St Andrews, St Andrews, Scotland, UK (e-mail:"],"raw_orcid":"https://orcid.org/0009-0002-6608-4051","affiliations":[{"raw_affiliation_string":"School of Computer Science, University of St Andrews, St Andrews, Scotland, UK (e-mail:","institution_ids":["https://openalex.org/I16835326"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004629504","display_name":"Juliana Bowles","orcid":"https://orcid.org/0000-0002-5918-9114"},"institutions":[{"id":"https://openalex.org/I4210126338","display_name":"Software Competence Center Hagenberg (Austria)","ror":"https://ror.org/02ks3nr96","country_code":"AT","type":"company","lineage":["https://openalex.org/I4210126338"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"JULIANA BOWLES","raw_affiliation_strings":["School of Computer Science, University of St Andrews, St Andrews, Scotland, UK and Software Competence Centre Hagenberg (SCCH), Hagenberg, Austria (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of St Andrews, St Andrews, Scotland, UK and Software Competence Centre Hagenberg (SCCH), Hagenberg, Austria (e-mail:","institution_ids":["https://openalex.org/I4210126338"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00059554,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"3","first_page":"374","last_page":"393"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":0.9833999872207642,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10260","display_name":"Software Engineering Research","score":0.9833999872207642,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T13629","display_name":"Text Readability and Simplification","score":0.9800000190734863,"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.9599000215530396,"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/existentialism","display_name":"Existentialism","score":0.5607048869132996},{"id":"https://openalex.org/keywords/propositional-formula","display_name":"Propositional formula","score":0.4311988949775696},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4102594256401062},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4010063707828522},{"id":"https://openalex.org/keywords/propositional-variable","display_name":"Propositional variable","score":0.33691757917404175},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.25398045778274536},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24532240629196167},{"id":"https://openalex.org/keywords/epistemology","display_name":"Epistemology","score":0.20334038138389587}],"concepts":[{"id":"https://openalex.org/C127882523","wikidata":"https://www.wikidata.org/wiki/Q38066","display_name":"Existentialism","level":2,"score":0.5607048869132996},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.4311988949775696},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4102594256401062},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4010063707828522},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.33691757917404175},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.25398045778274536},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24532240629196167},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.20334038138389587},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.0},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s1471068424000140","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068424000140","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/40C60F438D91B660283ABA7C85359C65/S1471068424000140a.pdf/div-class-title-a-novel-framework-for-systematic-propositional-formula-simplification-based-on-existential-graphs-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"},{"id":"pmh:oai:research-repository.st-andrews.ac.uk:10023/32576","is_oa":true,"landing_page_url":"https://doi.org/10.1017/S1471068424000140","pdf_url":null,"source":{"id":"https://openalex.org/S4306400230","display_name":"St Andrews Research Repository (St Andrews Research Repository)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I16835326","host_organization_name":"University of St Andrews","host_organization_lineage":["https://openalex.org/I16835326"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Journal article"},{"id":"pmh:oai:arXiv.org:2405.17072","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2405.17072","pdf_url":"https://arxiv.org/pdf/2405.17072","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-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2405.17072","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2405.17072","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1017/s1471068424000140","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068424000140","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/40C60F438D91B660283ABA7C85359C65/S1471068424000140a.pdf/div-class-title-a-novel-framework-for-systematic-propositional-formula-simplification-based-on-existential-graphs-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":[],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399116287.pdf","grobid_xml":"https://content.openalex.org/works/W4399116287.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W2989262635","https://openalex.org/W2031823362","https://openalex.org/W4206807714","https://openalex.org/W2047366356","https://openalex.org/W6660377283","https://openalex.org/W1518571861","https://openalex.org/W2126662120","https://openalex.org/W1513282478","https://openalex.org/W2018094844","https://openalex.org/W4248922942","https://openalex.org/W1973267383","https://openalex.org/W593705620","https://openalex.org/W6633040918"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W949976107","https://openalex.org/W2951901777","https://openalex.org/W4298267346","https://openalex.org/W2061266213","https://openalex.org/W1987118140","https://openalex.org/W2788816388","https://openalex.org/W2283591084","https://openalex.org/W229834379","https://openalex.org/W1970926634"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"presents":[3],"a":[4,37,88,126,150],"novel":[5,151],"simplification":[6,89],"calculus":[7],"for":[8],"propositional":[9,28,118],"logic":[10,29],"derived":[11],"from":[12],"Peirce\u2019s":[13],"existential":[14],"graphs\u2019":[15],"rules":[16,23,71,100,144],"of":[17,41,50,69,77,96,98,129,135],"inference":[18],"and":[19,44,46,64,74,102,107,117,123,137],"implication":[20,153],"graphs.":[21],"Our":[22,54],"can":[24,56,108,145],"be":[25,58,109,146],"applied":[26],"to":[27,111,155],"formulae":[30,119],"in":[31,120,133],"nested":[32],"form,":[33,122],"are":[34],"equivalence-preserving,":[35],"guarantee":[36],"monotonically":[38],"decreasing":[39],"number":[40],"variables,":[42],"clauses":[43],"literals,":[45],"maximise":[47],"the":[48,78,93],"preservation":[49],"structural":[51],"problem":[52],"information.":[53],"techniques":[55],"also":[57],"seen":[59],"as":[60],"higher-level":[61],"SAT":[62,81],"preprocessing,":[63],"we":[65,86,124,140],"show":[66,141],"how":[67,142],"one":[68],"our":[70,99,143],"(TWSR)":[72],"generalises":[73],"streamlines":[75],"most":[76],"known":[79,158],"equivalence-preserving":[80,159],"preprocessing":[82,160],"methods.":[83],"In":[84],"addition,":[85],"propose":[87],"procedure":[90],"based":[91],"on":[92],"systematic":[94],"application":[95],"two":[97],"(EPR":[101],"TWSR)":[103],"which":[104],"is":[105],"solver-agnostic":[106],"used":[110],"simplify":[112],"large":[113],"Boolean":[114],"satisfiability":[115],"problems":[116],"arbitrary":[121],"provide":[125],"formal":[127],"analysis":[128],"its":[130],"algorithmic":[131],"complexity":[132],"terms":[134],"space":[136],"time.":[138],"Finally,":[139],"further":[147],"extended":[148],"with":[149],"n-ary":[152],"graph":[154],"capture":[156],"all":[157],"procedures.":[161]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2024-05-29T00:00:00"}