Related papers: Algorithmic complexity of monadic multimodal predi…
Description logics are knowledge representation languages that have been designed to strike a balance between expressivity and computational tractability. Many different description logics have been developed, and numerous computational…
The paper is devoted to modal properties of the ternary strict betweenness relation as used in the development of various systems of geometry. We show that such a relation is non-definable in a basic similarity type with a binary operator…
We survey recent progress on efficient algorithms for approximately diagonalizing a square complex matrix in the models of rational (variable precision) and finite (floating point) arithmetic. This question has been studied across several…
We investigate the role of coalgebraic predicate logic, a logic for neighborhood frames first proposed by Chang, in the study of monotonic modal logics. We prove analogues of the Goldblatt-Thomason Theorem and Fine's Canonicity Theorem for…
We analyze the computational complexity of admissibility and unifiability with parameters in transitive modal logics. The class of cluster-extensible (clx) logics was introduced in the first part of this series of papers. We completely…
Relative to the large literature on upper bounds on complexity of convex optimization, lesser attention has been paid to the fundamental hardness of these problems. Given the extensive use of convex optimization in machine learning and…
We show that products of propositional modal logics containing the logic of reflexive frames T as a factor are embeddable into their single-variable fragments. The proof is a simplified version of the proof, to appear, of a similar result…
This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. Given imprecise information represented by probability bounds and conditional…
We compute the degree complexity of a family of birational mappings of the plane with high order singularities.
We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present…
In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of…
We investigate some finitely-valued generalizations of propositional dynamic logic with tests. We start by introducing the (n+1)-valued Kripke models and a corresponding language based on a modal extension of {\L}ukasiewicz many-valued…
The notion of non-deterministic logical matrix (where connectives are interpreted as multi-functions) preserves many good properties of traditional semantics based on logical matrices (where connectives are interpreted as functions) whilst…
We propose stratified institutions (a decade old generalised version of the theory of institutions of Goguen and Burstall) as a fully abstract model theoretic approach to modal logic. This allows for a uniform treatment of model theoretic…
In this paper we survey some surprising connections between group theory, the theory of automata and formal languages, the theory of ends, infinite games of perfect information, and monadic second-order logic.
We generalize methods, developed by S. Ghilardi, and apply them to a subsystem J$_2$ of bimodal provability logic GLB. We describe projective formulas in J$_2$ in terms of Kripke semantics and prove that logic J$_2$ has finitary unification…
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
Within the model-theoretic framework for supervised learning introduced by Grohe and Tur\'an (TOCS 2004), we study the parameterized complexity of learning concepts definable in monadic second-order logic (MSO). We show that the problem of…
While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…
We introduce quantum monadic and quantum cylindric algebras. These are adaptations to the quantum setting of the monadic algebras of Halmos, and cylindric algebras of Henkin, Monk and Tarski, that are used in algebraic treatments of…