English
Related papers

Related papers: Modal operators and toric ideals

200 papers

This paper is focused on the study of modal logics defined from valued Kripke frames, and particularly, on computability and expressibility questions of modal logics of transitive Kripke frames evaluated over certain residuated lattices. It…

Logic in Computer Science · Computer Science 2019-04-03 Amanda Vidal

The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic. In this…

Logic in Computer Science · Computer Science 2016-11-23 Corina Cirstea , Clemens Kupke , Dirk Pattinson

In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…

Algebraic Geometry · Mathematics 2021-10-19 Marc Maliar

We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width…

Logic in Computer Science · Computer Science 2023-06-22 Erich Grädel , Martin Grohe , Benedikt Pago , Wied Pakusa

The modal systems S1--S3 were introduced by C. I. Lewis as logics for strict implication. While there are Kripke semantics for S2 and S3, there is no known natural semantics for S1. We extend S1 by a Substitution Principle SP which…

Logic in Computer Science · Computer Science 2014-12-09 Steffen Lewitzka

We prove several representation theorems for infinitary predicate modal logic

Logic · Mathematics 2013-04-04 Tarek Sayed Ahmed

It is well known that modal satisfiability is PSPACE-complete (Ladner 1977). However, the complexity may decrease if we restrict the set of propositional operators used. Note that there exist an infinite number of propositional operators,…

Computational Complexity · Computer Science 2008-12-18 Edith Hemaspaandra , Henning Schnoor , Ilka Schnoor

We set up an algebraic theory of multivariable integration, based on a hierarchy of Rota-Baxter operators and an action of the matrix monoid as linear substitutions. Given a suitable coefficient domain with a bialgebra structure, this…

Rings and Algebras · Mathematics 2020-07-27 Markus Rosenkranz , Xing Gao , Li Guo

To each prime ideal in a polynomial ring over a field we associate an algebraic matroid and show that it is preserved under tropicalization. This gives a necessary condition for a tropical variety to be set-theoretically realizable from a…

Combinatorics · Mathematics 2016-08-12 Josephine Yu

The main focus of this paper is on the problem of relating an ideal $I$ in the polynomial ring $\mathbb Q[x_1, \dots, x_n]$ to a corresponding ideal in $\mathbb F_p[x_1,\dots, x_n]$ where $p$ is a prime number; in other words, the…

Commutative Algebra · Mathematics 2019-12-13 John Abbott , Anna Maria Bigatti , Lorenzo Robbiano

In the first chapter we present new results related on monomial ideals of Borel type. Also, we introduce a new class of monomial ideals, called $\de$-fixed ideals, which generalize the class of $p$-Borel ideals and we extend several results…

Commutative Algebra · Mathematics 2007-08-29 Mircea Cimpoeas

Conditional independence is a crucial concept supporting adequate modelling and efficient reasoning in probabilistics. In knowledge representation, the idea of conditional independence has also been introduced for specific formalisms, such…

Artificial Intelligence · Computer Science 2024-12-19 Jesse Heyninck

Let $\Bbbk$ be a field and let $I$ be a monomial ideal in the polynomial ring $Q=\Bbbk[x_1,\ldots,x_n]$. In her thesis, Taylor introduced a complex which provides a finite free resolution for $Q/I$ as a $Q$-module. Later, Gemeda constructed…

Rings and Algebras · Mathematics 2021-09-02 Luigi Ferraro , Desiree Martin , W. Frank Moore

We introduce a two-sort weighted modal logic for possibilistic reasoning with fuzzy formal contexts. The syntax of the logic includes two types of weighted modal operators corresponding to classical necessity ($\Box$) and sufficiency…

Logic in Computer Science · Computer Science 2026-01-01 Prosenjit Howlader , Churn-Jung Liau

While finite-variable fragments of the propositional modal logic S5--complete with respect to reflexive, symmetric and transitive frames--are polynomial-time decidable, the restriction to finite-variable formulas for logics of reflexive and…

Logic · Mathematics 2019-10-08 Mikhail Rybakov , Dmitry Shkatov

Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and $I \subset S$ a monomial ideal. Given a vector $\mathfrak{c}\in\mathbb{N}^n$, the ideal $I_{\mathfrak{c}}$ is the ideal generated by those monomials…

Commutative Algebra · Mathematics 2025-06-03 Takayuki Hibi , Seyed Amin Seyed Fakhari

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

Logic in Computer Science · Computer Science 2024-04-26 Hashimoto Go , Daniel Găină , Ionuţ Ţuţu

In this paper we explore the idea of looking at the Dirac quantisation conditions as $\hbar$-dependent constraints on the tangent bundle to phase-space. Starting from the path-integral version of classical mechanics and using the natural…

dg-ga · Mathematics 2016-08-31 Ennio Gozzi

We provide a logical framework in which a resource-bounded agent can be seen to perform approximations of probabilistic reasoning. Our main results read as follows. First we identify the conditions under which propositional probability…

Logic in Computer Science · Computer Science 2022-05-09 Paolo Baldi , Hykel Hosni

We explore a fuzzy modal logic that can formalise probabilistic reasoning about actions and knowledge. In particular, we deal with contexts involving statements about events expressed via modal formulas, e.g., "after doing $a$, the…

Logic in Computer Science · Computer Science 2026-04-27 Daniil Kozhemiachenko , Igor Sedlár