{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:18Z","timestamp":1750220658730,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,8]]},"DOI":"10.1145\/3373718.3394763","type":"proceedings-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:23:18Z","timestamp":1590452598000},"page":"38-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Logic Beyond Formulas"],"prefix":"10.1145","author":[{"given":"Matteo","family":"Acclavio","sequence":"first","affiliation":[{"name":"Computer Science, University of Luxembourg, Esch-sur-Alzette, Luxembourg"}]},{"given":"Ross","family":"Horne","sequence":"additional","affiliation":[{"name":"Computer Science, University of Luxembourg, Esch-sur-Alzette, Luxembourg"}]},{"given":"Lutz","family":"Stra\u00dfburger","sequence":"additional","affiliation":[{"name":"Inria, Equipe Partout, Ecole Polytechnique, LIX UMR, France"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Generalized Connectives for Multiplicative Linear Logic. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)","volume":"152","author":"Acclavio Matteo","year":"2020","unstructured":"Matteo Acclavio and Roberto Maieli . 2020 . Generalized Connectives for Multiplicative Linear Logic. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020) (LIPIcs), Maribel Fern\u00e1ndez and Anca Muscholl (Eds.) , Vol. 152 . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 6:1--6:16. https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2020.6 10.4230\/LIPIcs.CSL.2020.6 Matteo Acclavio and Roberto Maieli. 2020. Generalized Connectives for Multiplicative Linear Logic. In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020) (LIPIcs), Maribel Fern\u00e1ndez and Anca Muscholl (Eds.), Vol. 152. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 6:1--6:16. https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2020.6"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129597002326"},{"volume-title":"Stable models of typed \u03bb-calculi","author":"Berry G\u00e9rard","key":"e_1_3_2_1_3_1","unstructured":"G\u00e9rard Berry . 1978. Stable models of typed \u03bb-calculi . In Automata, Languages and Programming, Giorgio Ausiello and Corrado B\u00f6hm (Eds.). Springer , Berlin, Heidelberg , 72--89. G\u00e9rard Berry. 1978. Stable models of typed \u03bb-calculi. In Automata, Languages and Programming, Giorgio Ausiello and Corrado B\u00f6hm (Eds.). Springer, Berlin, Heidelberg, 72--89."},{"volume-title":"Logic for Programming","author":"Br\u00fcnnler Kai","key":"e_1_3_2_1_4_1","unstructured":"Kai Br\u00fcnnler and Alwen Fernanto Tiu . 2001. A Local System for Classical Logic . In Logic for Programming , Artificial Intelligence, and Reasoning, Robert Nieuwenhuis and Andrei Voronkov (Eds.). Springer , Berlin, Heidelberg , 347--361. https:\/\/doi.org\/10.1007\/3-540-45653-8_24 10.1007\/3-540-45653-8_24 Kai Br\u00fcnnler and Alwen Fernanto Tiu. 2001. A Local System for Classical Logic. In Logic for Programming, Artificial Intelligence, and Reasoning, Robert Nieuwenhuis and Andrei Voronkov (Eds.). Springer, Berlin, Heidelberg, 347--361. https:\/\/doi.org\/10.1007\/3-540-45653-8_24"},{"volume-title":"A Purely Logical Account of Sequentiality in Proof Search","author":"Bruscoli Paola","key":"e_1_3_2_1_5_1","unstructured":"Paola Bruscoli . 2002. A Purely Logical Account of Sequentiality in Proof Search . In Logic Programming, Peter J. Stuckey (Ed.). Springer , Berlin, Heidelberg , 302--316. https:\/\/doi.org\/10.1007\/3-540-45619-8_21 10.1007\/3-540-45619-8_21 Paola Bruscoli. 2002. A Purely Logical Account of Sequentiality in Proof Search. In Logic Programming, Peter J. Stuckey (Ed.). Springer, Berlin, Heidelberg, 302--316. https:\/\/doi.org\/10.1007\/3-540-45619-8_21"},{"key":"e_1_3_2_1_6_1","volume-title":"WoLLIC 2017, London, UK, July 18-21, 2017, Proceedings (Lecture Notes in Computer Science), Juliette Kennedy and Ruy J. G. B. de Queiroz (Eds.)","volume":"10388","author":"Bruscoli Paola","year":"2017","unstructured":"Paola Bruscoli and Lutz Stra\u00dfburger . 2017 . On the Length of Medial-Switch-Mix Derivations. In Logic, Language, Information, and Computation - 24th International Workshop , WoLLIC 2017, London, UK, July 18-21, 2017, Proceedings (Lecture Notes in Computer Science), Juliette Kennedy and Ruy J. G. B. de Queiroz (Eds.) , Vol. 10388 . Springer, 68--79. https:\/\/doi.org\/10.1007\/978-3-662-55386-2_5 10.1007\/978-3-662-55386-2_5 Paola Bruscoli and Lutz Stra\u00dfburger. 2017. On the Length of Medial-Switch-Mix Derivations. In Logic, Language, Information, and Computation - 24th International Workshop, WoLLIC 2017, London, UK, July 18-21, 2017, Proceedings (Lecture Notes in Computer Science), Juliette Kennedy and Ruy J. G. B. de Queiroz (Eds.), Vol. 10388. Springer, 68--79. https:\/\/doi.org\/10.1007\/978-3-662-55386-2_5"},{"key":"e_1_3_2_1_7_1","unstructured":"Cameron Calk. 2016. A graph theoretical extension of boolean logic. (2016). http:\/\/www.anupamdas.com\/graph-bool.pdf Bachelor's thesis.  Cameron Calk. 2016. A graph theoretical extension of boolean logic. (2016). http:\/\/www.anupamdas.com\/graph-bool.pdf Bachelor's thesis."},{"key":"e_1_3_2_1_8_1","unstructured":"Cameron Calk Anupam Das and Tim Waring. 2020. Beyond formulas-as-cographs: an extension of Boolean logic to arbitrary graphs. arXiv:2004.12941 [cs.LO]  Cameron Calk Anupam Das and Tim Waring. 2020. Beyond formulas-as-cographs: an extension of Boolean logic to arbitrary graphs. arXiv:2004.12941 [cs.LO]"},{"key":"e_1_3_2_1_9_1","volume-title":"The Focused Calculus of Structures. In CSL'11 (LIPIcs), Marc Bezem (Ed.)","volume":"12","author":"Chaudhuri Kaustuv","year":"2011","unstructured":"Kaustuv Chaudhuri , Nicolas Guenot , and Lutz Stra\u00dfburger . 2011 . The Focused Calculus of Structures. In CSL'11 (LIPIcs), Marc Bezem (Ed.) , Vol. 12 . Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 159--173. https:\/\/doi.org\/10.4230\/LIPIcs.CSL. 2011.159 10.4230\/LIPIcs.CSL.2011.159 Kaustuv Chaudhuri, Nicolas Guenot, and Lutz Stra\u00dfburger. 2011. The Focused Calculus of Structures. In CSL'11 (LIPIcs), Marc Bezem (Ed.), Vol. 12. Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 159--173. https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2011.159"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.2307\/2273702"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01622878"},{"key":"e_1_3_2_1_12_1","volume-title":"26th International Conference on Rewriting Techniques and Applications (RTA 2015)","volume":"36","author":"Das Anupam","year":"2015","unstructured":"Anupam Das and Lutz Stra\u00dfburger . 2015 . No complete linear term rewriting system for propositional logic . In 26th International Conference on Rewriting Techniques and Applications (RTA 2015) (LIPIcs), Maribel Fern\u00e1ndez (Ed.) , Vol. 36 . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 127--142. https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2015.127 10.4230\/LIPIcs.RTA.2015.127 Anupam Das and Lutz Stra\u00dfburger. 2015. No complete linear term rewriting system for propositional logic. In 26th International Conference on Rewriting Techniques and Applications (RTA 2015) (LIPIcs), Maribel Fern\u00e1ndez (Ed.), Vol. 36. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 127--142. https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2015.127"},{"key":"e_1_3_2_1_13_1","first-page":"1","article-title":"On linear rewriting systems for Boolean logic and some applications to proof theory","volume":"12","author":"Das Anupam","year":"2016","unstructured":"Anupam Das and Lutz Stra\u00dfburger . 2016 . On linear rewriting systems for Boolean logic and some applications to proof theory . Logical Methods in Computer Science 12 , 4 (2016), 1 -- 27 . https:\/\/doi.org\/10.2168\/LMCS-12(4:9)2016 10.2168\/LMCS-12(4:9)2016 Anupam Das and Lutz Stra\u00dfburger. 2016. On linear rewriting systems for Boolean logic and some applications to proof theory. Logical Methods in Computer Science 12, 4 (2016), 1--27. https:\/\/doi.org\/10.2168\/LMCS-12(4:9)2016","journal-title":"Logical Methods in Computer Science"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129500000451"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"e_1_3_2_1_16_1","first-page":"183","article-title":"On the meaning of logical rules II: multiplicatives and additives","volume":"175","author":"Girard Jean-Yves","year":"2000","unstructured":"Jean-Yves Girard . 2000 . On the meaning of logical rules II: multiplicatives and additives . NATO ASI Series F: Computer and Systems Sciences 175 (2000), 183 -- 212 . Jean-Yves Girard. 2000. On the meaning of logical rules II: multiplicatives and additives. NATO ASI Series F: Computer and Systems Sciences 175 (2000), 183--212.","journal-title":"NATO ASI Series F: Computer and Systems Sciences"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1182613.1182614"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the 21st International Conference on Rewriting Techniques and Applications (LIPIcs), Christopher Lynch (Ed.)","volume":"6","author":"Guglielmi Alessio","year":"2010","unstructured":"Alessio Guglielmi , Tom Gundersen , and Michel Parigot . 2010 . A Proof Calculus Which Reduces Syntactic Bureaucracy . In Proceedings of the 21st International Conference on Rewriting Techniques and Applications (LIPIcs), Christopher Lynch (Ed.) , Vol. 6 . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 135--150. https:\/\/doi.org\/10.4230\/LIPIcs.RTA. 2010.135 10.4230\/LIPIcs.RTA.2010.135 Alessio Guglielmi, Tom Gundersen, and Michel Parigot. 2010. A Proof Calculus Which Reduces Syntactic Bureaucracy. In Proceedings of the 21st International Conference on Rewriting Techniques and Applications (LIPIcs), Christopher Lynch (Ed.), Vol. 6. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 135--150. https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2010.135"},{"volume-title":"Non-commutativity and MELL in the Calculus of Structures","author":"Guglielmi Alessio","key":"e_1_3_2_1_19_1","unstructured":"Alessio Guglielmi and Lutz Stra\u00dfburger . 2001. Non-commutativity and MELL in the Calculus of Structures . In Computer Science Logic, Laurent Fribourg (Ed.). Springer , Berlin, Heidelberg , 54--68. https:\/\/doi.org\/10.1007\/3-540-44802-0_5 10.1007\/3-540-44802-0_5 Alessio Guglielmi and Lutz Stra\u00dfburger. 2001. Non-commutativity and MELL in the Calculus of Structures. In Computer Science Logic, Laurent Fribourg (Ed.). Springer, Berlin, Heidelberg, 54--68. https:\/\/doi.org\/10.1007\/3-540-44802-0_5"},{"volume-title":"Logic for Programming","author":"Guglielmi Alessio","key":"e_1_3_2_1_20_1","unstructured":"Alessio Guglielmi and Lutz Stra\u00dfburger . 2002. A Non-commutative Extension of MELL . In Logic for Programming , Artificial Intelligence, and Reasoning, Matthias Baaz and Andrei Voronkov (Eds.). Springer , Berlin, Heidelberg , 231--246. https:\/\/doi.org\/10.1007\/3-540-36078-6_16 10.1007\/3-540-36078-6_16 Alessio Guglielmi and Lutz Stra\u00dfburger. 2002. A Non-commutative Extension of MELL. In Logic for Programming, Artificial Intelligence, and Reasoning, Matthias Baaz and Andrei Voronkov (Eds.). Springer, Berlin, Heidelberg, 231--246. https:\/\/doi.org\/10.1007\/3-540-36078-6_16"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S096012951100003X"},{"key":"e_1_3_2_1_22_1","volume-title":"4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, June 24-30","volume":"131","author":"Horne Ross","year":"2019","unstructured":"Ross Horne . 2019 . The Sub-Additives: A Proof Theory for Probabilistic Choice extending Linear Logic . In 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, June 24-30 , 2019, Dortmund, Germany (LIPIcs), Herman Geuvers (Ed.) , Vol. 131 . Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 23:1--23:16. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2019.23 10.4230\/LIPIcs.FSCD.2019.23 Ross Horne. 2019. The Sub-Additives: A Proof Theory for Probabilistic Choice extending Linear Logic. In 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, June 24-30, 2019, Dortmund, Germany (LIPIcs), Herman Geuvers (Ed.), Vol. 131. Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 23:1--23:16. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2019.23"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129518000452"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3325821"},{"volume-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"Howard William Alvin","key":"e_1_3_2_1_25_1","unstructured":"William Alvin Howard . 1980. The Formulae-as-Types Notion of Construction . In To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism , J. P. Seldin and J. R. Hindley (Eds.). Academic Press , London , 479--490. William Alvin Howard. 1980. The Formulae-as-Types Notion of Construction. In To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, J. P. Seldin and J. R. Hindley (Eds.). Academic Press, London, 479--490."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2006.164.1065"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/187812.187917"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00031-1"},{"volume-title":"Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Ross","key":"e_1_3_2_1_29_1","unstructured":"Ross M. McConnell and Jeremy P. Spinrad. 1994. Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs . In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms ( Arlington, Virginia, USA) (SODA '94). Society for Industrial and Applied Mathematics, USA, 536--545. Ross M. McConnell and Jeremy P. Spinrad. 1994. Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs. In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Arlington, Virginia, USA) (SODA '94). Society for Industrial and Applied Mathematics, USA, 536--545."},{"volume-title":"Extensions of Logic Programming, E Lamma and P","author":"Miller Dale","key":"e_1_3_2_1_30_1","unstructured":"Dale Miller . 1993. The π-calculus as a theory in linear logic: Preliminary results . In Extensions of Logic Programming, E Lamma and P . Mello (Eds.). Springer , Berlin, Heidelberg , 242--264. https:\/\/doi.org\/10.1007\/3-540-56454-3_13 10.1007\/3-540-56454-3_13 Dale Miller. 1993. The π-calculus as a theory in linear logic: Preliminary results. In Extensions of Logic Programming, E Lamma and P. Mello (Eds.). Springer, Berlin, Heidelberg, 242--264. https:\/\/doi.org\/10.1007\/3-540-56454-3_13"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(91)90068-W"},{"volume-title":"Computationally Tractable Classes of Ordered Sets","author":"M\u00f6hring Rolf H.","key":"e_1_3_2_1_32_1","unstructured":"Rolf H. M\u00f6hring . 1989. Computationally Tractable Classes of Ordered Sets . In Algorithms and Order, Ivan Rival (Ed.). Springer Netherlands , Dordrecht , 105--193. https:\/\/doi.org\/10.1007\/978-94-009-2639-4_4 10.1007\/978-94-009-2639-4_4 Rolf H. M\u00f6hring. 1989. Computationally Tractable Classes of Ordered Sets. In Algorithms and Order, Ivan Rival (Ed.). Springer Netherlands, Dordrecht, 105--193. https:\/\/doi.org\/10.1007\/978-94-009-2639-4_4"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90112-2"},{"key":"e_1_3_2_1_34_1","first-page":"223","article-title":"Interpretations of net theory","volume":"9","author":"Petri Carl Adam","year":"1977","unstructured":"Carl Adam Petri . 1977 . Interpretations of net theory . Comput. Surveys 9 , 3 (1977), 223 -- 252 . Carl Adam Petri. 1977. Interpretations of net theory. Comput. Surveys 9, 3 (1977), 223--252.","journal-title":"Comput. Surveys"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1755020308080040"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01379149"},{"volume-title":"Pomset logic: A non-commutative extension of classical linear logic","author":"Retor\u00e9 Christian","key":"e_1_3_2_1_37_1","unstructured":"Christian Retor\u00e9 . 1997. Pomset logic: A non-commutative extension of classical linear logic . In Typed Lambda Calculi and Applications, Philippe de Groote and J. Roger Hindley (Eds.). Springer , Berlin, Heidelberg , 300--318. https:\/\/doi.org\/10.1007\/3-540-62688-3_43 10.1007\/3-540-62688-3_43 Christian Retor\u00e9. 1997. Pomset logic: A non-commutative extension of classical linear logic. In Typed Lambda Calculi and Applications, Philippe de Groote and J. Roger Hindley (Eds.). Springer, Berlin, Heidelberg, 300--318. https:\/\/doi.org\/10.1007\/3-540-62688-3_43"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00175-X"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-007-9028-y"},{"volume-title":"Logic for Programming","author":"Stra\u00dfburger Lutz","key":"e_1_3_2_1_40_1","unstructured":"Lutz Stra\u00dfburger . 2002. A Local System for Linear Logic . In Logic for Programming , Artificial Intelligence, and Reasoning, Matthias Baaz and Andrei Voronkov (Eds.). Springer , Berlin, Heidelberg , 388--402. https:\/\/doi.org\/10.1007\/3-540-36078-6_26 10.1007\/3-540-36078-6_26 Lutz Stra\u00dfburger. 2002. A Local System for Linear Logic. In Logic for Programming, Artificial Intelligence, and Reasoning, Matthias Baaz and Andrei Voronkov (Eds.). Springer, Berlin, Heidelberg, 388--402. https:\/\/doi.org\/10.1007\/3-540-36078-6_26"},{"key":"e_1_3_2_1_42_1","volume-title":"Combinatorial Flows and Their Normalisation. In 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)","volume":"84","author":"Stra\u00dfburger Lutz","year":"2017","unstructured":"Lutz Stra\u00dfburger . 2017 . Combinatorial Flows and Their Normalisation. In 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017) (LIPIcs), Dale Miller (Ed.) , Vol. 84 . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 31:1--31:17. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2017.31 10.4230\/LIPIcs.FSCD.2017.31 Lutz Stra\u00dfburger. 2017. Combinatorial Flows and Their Normalisation. In 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017) (LIPIcs), Dale Miller (Ed.), Vol. 84. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 31:1--31:17. https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2017.31"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-2(2:4)2006"},{"key":"e_1_3_2_1_45_1","unstructured":"Timothy Waring. 2019. A Graph theoretic extension of Boolean logic. (2019). http:\/\/anupamdas.com\/thesis_tim-waring.pdf Master's thesis.  Timothy Waring. 2019. A Graph theoretic extension of Boolean logic. (2019). http:\/\/anupamdas.com\/thesis_tim-waring.pdf Master's thesis."}],"event":{"name":"LICS '20: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"Saarbr\u00fccken Germany","acronym":"LICS '20"},"container-title":["Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394763","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373718.3394763","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:35Z","timestamp":1750197755000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394763"}},"subtitle":["A Proof System on Graphs"],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":43,"alternative-id":["10.1145\/3373718.3394763","10.1145\/3373718"],"URL":"https:\/\/doi.org\/10.1145\/3373718.3394763","relation":{},"subject":[],"published":{"date-parts":[[2020,7,8]]},"assertion":[{"value":"2020-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}