The Wayback Machine - https://webcf.waybackmachine.org/web/20211023144839/https://dl.acm.org/toc/tocl/2021/22/4
Bibliometrics
research-article
The Complexity of Counting Problems Over Incomplete Databases
October 2021, Article No.: 21, pp 1–52https://doi.org/10.1145/3461642

We study the complexity of various fundamental counting problems that arise in the context of incomplete databases, i.e., relational databases that can contain unknown values in the form of labeled nulls. Specifically, we assume that the domains of these ...

research-article
Complete Abstractions for Checking Language Inclusion
October 2021, Article No.: 22, pp 1–40https://doi.org/10.1145/3462673

We study the language inclusion problem L1L2, where L1 is regular or context-free. Our approach relies on abstract interpretation and checks whether an overapproximating abstraction of L1, obtained by approximating the Kleene iterates of its least ...

research-article
Reiterman’s Theorem on Finite Algebras for a Monad
October 2021, Article No.: 23, pp 1–48https://doi.org/10.1145/3464691

Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman’s theorem states that they precisely specify pseudovarieties, i.e., classes of finite algebras closed under finite products, subalgebras and ...

research-article
EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces
October 2021, Article No.: 24, pp 1–71https://doi.org/10.1145/3465384

It is known that the satisfiability problems of the product logics K4 × S5 and S4 × S5 are NEXPTIME-hard and that the satisfiability problem of the logic SSL of subset spaces is PSPACE-hard. Furthermore, it is known that the satisfiability problems of ...

research-article
Generalized Realizability and Basic Logic
October 2021, Article No.: 25, pp 1–23https://doi.org/10.1145/3468856

Let V be a set of number-theoretical functions. We define a notion of absolute V-realizability for predicate formulas and sequents in such a way that the indices of functions in V are used for interpreting the implication and the universal quantifier. In ...

research-article
Lower Bounds on OBDD Proofs with Several Orders
October 2021, Article No.: 26, pp 1–30https://doi.org/10.1145/3468855

This article is motivated by seeking lower bounds on OBDD(∧, w, r) refutations, namely, OBDD refutations that allow weakening and arbitrary reorderings. We first work with 1 - NBP ∧ refutations based on read-once nondeterministic branching programs. These ...

Subjects

AbstractionAlgebraic language theoryComplexity theory and logicConstructive mathematicsFormal language definitionsGrammars and context-free languagesIncomplete, inconsistent, and uncertain databasesModal and temporal logicsProblems, reductions and completenessProgram reasoningProof complexityRegular languages

Comments

About Cookies On This Site

We use cookies to ensure that we give you the best experience on our website.

Learn more

Got it!