Enumerating Independent Linear Inferences
A linear inference is a valid inequality of Boolean algebra in which each variable occurs at most once on each side. In this work we leverage recently developed graphical representations of linear formulae to build an implementation that is capable of more efficiently searching for switch-medial-i...
Main Authors: | Anupam Das, Alex Rice |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2023-05-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/8695/pdf |
Similar Items
-
On the relative proof complexity of deep inference via atomic flows
by: Anupam Das
Published: (2015-03-01) -
On the enumeration of closures and environments with an application to random generation
by: Maciej Bendkowski, et al.
Published: (2019-10-01) -
Enumerating Answers to First-Order Queries over Databases of Low Degree
by: Arnaud Durand, et al.
Published: (2022-05-01) -
On the logical complexity of cyclic arithmetic
by: Anupam Das
Published: (2020-01-01) -
A Functional (Monadic) Second-Order Theory of Infinite Trees
by: Anupam Das, et al.
Published: (2020-10-01)