Related papers: Two-layered logics for paraconsistent probabilitie…
This work is divided between two main areas: in the theory of multialgebras, we focus mostly on a new definition of what a freely generated object should be in their category, and on how this category is equivalent to another with partially…
Bilinear restriction estimates have been appeared in work of Bourgain, Klainerman, and Machedon. In this paper we develop the theory of these estimates (together with the analogues for Kakeya estimates). As a consequence we improve the…
Probabilistic justification logic is a modal logic with two kind of modalities: probability measures and explicit justification terms. We present a tableau procedure that can be used to decide the satisfiability problem for this logic in…
Fuzzy description logics serve the representation of vague knowledge, typically letting concepts take truth degrees in the unit interval. Expressiveness, logical properties, and complexity vary strongly with the choice of propositional…
Unbounded {\L}ukasiewicz logic is a substructural logic that combines features of infinite-valued {\L}ukasiewicz logic with those of abelian logic. The logic is finitely strongly complete w.r.t.~the additive $\ell$-group on the reals…
Over the past three decades, the logic programming paradigm has been successfully expanded to support probabilistic modeling, inference and learning. The resulting paradigm of probabilistic logic programming (PLP) and its programming…
We describe a representation and a set of inference methods that combine logic programming techniques with probabilistic network representations for uncertainty (influence diagrams). The techniques emphasize the dynamic construction and…
We prove L^p estimates for a tri-linear operator, whose symbol is given by the product of two standard symbols, satisfying the well known Marcinkiewicz-Hormander-Mihlin condition. Our main result contains in particular the classical…
In this paper, we establish three Landau-type theorems for certain bounded poly-analytic functions, which generalize the corresponding result for bi-analytic functions given by Liu and Ponnusamy [Canad. Math. Bull. 67(1): 2024, 152-165].…
The semantic web is an open and distributed environment in which it is hard to guarantee consistency of knowledge and information. Under the standard two-valued semantics everything is entailed if knowledge and information is inconsistent.…
We present Bluebell, a program logic for reasoning about probabilistic programs where unary and relational styles of reasoning come together to create new reasoning tools. Unary-style reasoning is very expressive and is powered by…
We study a real valued propositional logic with unbounded positive and negative truth values that we call R-valued logic. Such logic slightly extends continuous propositional logic which, in turn, builds on Lukasiewicz many-valued logic.…
In probabilistic logic entailments, even moderate size problems can yield linear constraint systems with so many variables that exact methods are impractical. This difficulty can be remedied in many cases of interest by introducing a three…
This article introduces probabilistic disjunctive normal forms (PDNFs) as a framework for representing and reasoning about uncertainty in logical systems. Unlike classical DNFs, PDNFs assign real-valued weights to variables, encoding…
We introduce BPDL, a combination of propositional dynamic logic PDL with the basic four-valued modal logic BK studied by Odintsov and Wansing (`Modal logics with Belnapian truth values', J. Appl. Non-Class. Log. 20, 279--301 (2010)). We…
The paper is dedicated to the problem of adding a modality to the \Lukasiewicz many-valued logics in the purpose of obtaining completeness results for Kripke semantics. We define a class of modal many-valued logics and their corresponding…
We study $[0,1]$-valued logics that are closed under the {\L}ukasiewicz-Pavelka connectives; our primary examples are the the continuous logic framework of Ben Yaacov and Usvyatsov \cite{Ben-Yaacov-Usvyatsov:2010} and the…
We establish two-sided Gaussian bounds for the fundamental solution of second-order parabolic operators in non-divergence form under minimal regularity assumptions. Specifically, we show that the upper and lower bounds follow from the local…
Possibilistic logic is a well-known graded logic of uncertainty suitable to reason under incomplete information and partially inconsistent knowledge, which is built upon classical first order logic. There exists for Possibilistic logic a…
A new kind of graded Lie algebra (we call it $Z_{2,2}$ graded Lie algebra) is introduced as a framework for formulating parasupersymmetric theories. By choosing suitable bose subspace of the $Z_{2,2}$ graded Lie algebra and using relevant…