Results 11 to 20 of about 265,378 (263)
Towards an Algebra for Cascade Effects [PDF]
Logical Methods in Computer Science, 2017 We introduce a new class of (dynamical) systems that inherently capture cascading effects (viewed as consequential effects) and are naturally amenable to combinations.
Elie M. Adam +2 more
doaj +1 more source
Making first order linear logic a generating grammar [PDF]
Logical Methods in Computer Science, 2023 It is known that different categorial grammars have surface representation in a fragment of first order multiplicative linear logic (MLL1). We show that the fragment of interest is equivalent to the recently introduced extended tensor type calculus (ETTC)
Sergey Slavnov
doaj +1 more source
Disjoint-union partial algebras [PDF]
Logical Methods in Computer Science, 2017 Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are defined.
Robin Hirsch, Brett McLean
doaj +1 more source
Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens [PDF]
Logical Methods in Computer Science, 2022 We study finite first-order satisfiability (FSAT) in the constructive setting of dependent type theory. Employing synthetic accounts of enumerability and decidability, we give a full classification of FSAT depending on the first-order signature of non ...
Dominik Kirst +1 more
doaj +1 more source
On the shelling antimatroids of split graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids.
Jean Cardinal +2 more
doaj +1 more source
Optimizing tree decompositions in MSO [PDF]
Logical Methods in Computer Science, 2022 The classic algorithm of Bodlaender and Kloks [J. Algorithms, 1996] solves the following problem in linear fixed-parameter time: given a tree decomposition of a graph of (possibly suboptimal) width k, compute an optimum-width tree decomposition of the ...
Mikołaj Bojańczyk, Michał Pilipczuk
doaj +1 more source
Pairwise Stability in Two Sided Market with Strictly Increasing Valuation Functions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 This paper deals with two-sided matching market with two disjoint sets, i.e. the set of buyers and the set of sellers. Each seller can trade with at most with one buyer and vice versa.
Yasir Ali, Asma Javaid
doaj +1 more source
On complete classes of valuated matroids [PDF]
TheoretiCSWe characterize a rich class of valuated matroids, called R-minor valuated matroids that includes the indicator functions of matroids, and is closed under operations such as taking minors, duality, and induction by network.
Edin Husić +3 more
doaj +1 more source
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability [PDF]
TheoretiCSWe show that feasibility of the $t^\text{th}$ level of the Lasserre semidefinite programming hierarchy for graph isomorphism can be expressed as a homomorphism indistinguishability relation.
David E. Roberson, Tim Seppelt
doaj +1 more source