The logic of bunched implications (BI) of O’Hearn and Pym [5] is a substructural logic which freely combines additive connectives ⊃ , ∧, ∨ from propositional logic and multiplicative connectives −?, ? from linear logic. Because of its concise yet rich representation of states of resources, BI is regarded as a logic suitable for reasoning about resources. For example, by building a model for BI ...

The Multi-Relational Boolean factor analysis is a method from the family of matrix decomposition methods which enables us analyze binary multi-relational data, i.e. binary data which are composed from many binary data tables interconnected via relation. In this paper we present a new Boolean matrix factorization algorithm for this kind of data, which use the new knowledge from the theory of the...

We discuss the relationship between the notion of independence as defined in lattice theory, matroid theory, and Boolean algebras. Collections of Boolean sub-algebras {At} are indeed endowed with the following independence relation (IB) ∩At 6= ∧ with ∧ the initial element of the Boolean algebra they belong to. However, those collections can be given several algebraic interpretations in terms of...

Boolean satisfiability (SAT) solvers have been successfully applied to a wide variety of difficult combinatorial problems. Many further problems can be solved by SAT Modulo Theory (SMT) solvers, which extend SAT solvers to handle additional types of constraints. However, building efficient SMT solvers is often very difficult. In this paper, we define the concept of a Boolean monotonic theory an...

The algebraic K-theory of Lawvere theories is a conceptual device to elucidate the stable homology symmetry groups structures such as permutation and automorphism free groups. In this paper, we fully address question how Morita equivalence classes interact with K-theory. On one hand, show that higher invariant under passage matrix theories. other not because behavior idempotents in non-additive...

dpll(t) is a central algorithm for Satisfiability Modulo Theories (smt) solvers. The algorithm combines results of reasoning about the Boolean structure of a formula with reasoning about conjunctions of theory facts to decide satisfiability. This architecture enables modern solvers to combine the performance benefits of propositional satisfiability solvers and conjunctive theory solvers. We cha...