Files in this item
A novel EGs-based framework for systematic propositional-formula simplification
Item metadata
dc.contributor.author | Francès de Mas, Jordina | |
dc.contributor.author | Kuster Filipe Bowles, Juliana | |
dc.contributor.editor | Glück, Robert | |
dc.contributor.editor | Kafle, Bishoksan | |
dc.date.accessioned | 2023-11-08T16:30:01Z | |
dc.date.available | 2023-11-08T16:30:01Z | |
dc.date.issued | 2023 | |
dc.identifier | 292981702 | |
dc.identifier | 6972bfcf-4840-43ca-94d0-442978c75ed2 | |
dc.identifier | 85175790649 | |
dc.identifier.citation | Francès de Mas , J & Kuster Filipe Bowles , J 2023 , A novel EGs-based framework for systematic propositional-formula simplification . in R Glück & B Kafle (eds) , Logic-Based Program Synthesis and Transformation : 33rd International Symposium, LOPSTR 2023, Cascais, Portugal, October 23-24, 2023, Proceedings . vol. 14330 , Lecture Notes in Computer Science , vol. 14330 , Springer , pp. 169-187 , 33rd International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2023) , Lisbon , Portugal , 23/10/23 . https://doi.org/10.1007/978-3-031-45784-5_11 | en |
dc.identifier.citation | conference | en |
dc.identifier.isbn | 9783031457838 | |
dc.identifier.isbn | 9783031457845 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.other | ORCID: /0000-0002-5918-9114/work/146465720 | |
dc.identifier.uri | https://hdl.handle.net/10023/28644 | |
dc.description | Funding: Bowles is partially supported by Austrian FWF Meitner Fellowship M-3338 N. | en |
dc.description.abstract | This paper presents a novel simplification calculus for propositional logic derived from Peirce’s Existential Graphs’ rules of inference and implication graphs. Our rules can be applied to arbitrary propositional logic formulae (not only in CNF), are equivalence-preserving, guarantee a monotonically decreasing number of clauses and literals, and maximise the preservation of structural problem information. Our techniques can also be seen as higher-level SAT preprocessing, and we show how one of our rules (TWSR) generalises and streamlines most of the known equivalence-preserving SAT preprocessing methods. We further show how this rule can be extended with a novel n-ary implication graph to capture all known equivalence-preserving preprocessing procedures. Finally, we discuss the complexity and implementation of our framework as a solver-agnostic algorithm to simplify Boolean satisfiability problems and arbitrary propositional formula. | |
dc.format.extent | 18 | |
dc.format.extent | 1047333 | |
dc.language.iso | eng | |
dc.publisher | Springer | |
dc.relation.ispartof | Logic-Based Program Synthesis and Transformation | en |
dc.relation.ispartofseries | Lecture Notes in Computer Science | en |
dc.subject | Simplification | en |
dc.subject | Existential graphs | en |
dc.subject | Equivalence-preserving preprocessing | en |
dc.subject | Propositional satisfiability | en |
dc.subject | Diagrammatic reasoning | en |
dc.subject | Knowledge representation | en |
dc.subject | Implication graphs | en |
dc.subject | Hypergraphs | en |
dc.subject | BC Logic | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | BC | en |
dc.subject.lcc | QA75 | en |
dc.title | A novel EGs-based framework for systematic propositional-formula simplification | en |
dc.type | Conference item | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.identifier.doi | https://doi.org/10.1007/978-3-031-45784-5_11 | |
dc.date.embargoedUntil | 2023-10-16 |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.