English
Related papers

Related papers: Epistemic BL-Algebras

200 papers

Recently, description logic LE-ALC was introduced for reasoning in the semantic environment of enriched formal contexts, and a polynomial-time tableaux algorithm was developed to check the consistency of knowledge bases with acyclic TBoxes.…

Logic in Computer Science · Computer Science 2025-06-09 Yiwen Ding , Krishna Manoorkar

A review is presented of the correspondence existing in both classical bivalent logic (BL) and canonical fuzzy logic (CFL) between each law or tautology in propositional calculus and a law in set theory. The latter law consists of the…

General Mathematics · Mathematics 2023-03-13 Osvaldo Skliar , Sherry Gapper , Ricardo E. Monge

We introduce the concept of quasi-coincidence of a fuzzy interval value with an interval valued fuzzy set. By using this new idea, we introduce the notions of interval valued $(\in,\ivq)$-fuzzy filters of pseudo $BL$-algebras and…

Logic · Mathematics 2009-02-22 J. Zhan , W. A. Dudek , Y. B. Jun

Logics with analogous semantics, such as Fuzzy Logic, have a number of explanatory and application advantages, the most well-known being the ability to help experts develop control systems. From a cognitive systems perspective, such…

Artificial Intelligence · Computer Science 2022-01-24 Hedda R. Schmidtke , Sara Coelho

We present a fuzzy (or quantitative) version of the van Benthem theorem, which characterizes propositional modal logic as the bisimulation-invariant fragment of first-order logic. Specifically, we consider a first-order fuzzy predicate…

Logic in Computer Science · Computer Science 2018-02-06 Paul Wild , Lutz Schröder , Dirk Pattinson , Barbara König

Fuzzy Description Logics (FDLs) are logic-based formalisms used to represent and reason with vague or imprecise knowledge. It has been recently shown that reasoning in most FDLs using truth values from the interval [0,1] becomes undecidable…

Artificial Intelligence · Computer Science 2015-09-30 Stefan Borgwardt , Rafael Peñaloza

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

Classical logic has a serious limitation in that it cannot cope with the issues of vagueness and uncertainty into which fall most modes of human reasoning. In order to provide a foundation for human knowledge representation and reasoning in…

Artificial Intelligence · Computer Science 2016-08-30 Van Hung Le

In this paper, we introduce a fundamental framework to create a bridge between Probability Theory and Fuzzy Logic. Indeed, our theory formulates a random experiment of selecting crisp elements with the criterion of having a certain fuzzy…

Logic in Computer Science · Computer Science 2022-05-31 Amir Saki , Usef Faghihi

Kripke frames (and models) provide a suitable semantics for sub-classical logics, for example Intuitionistic Logic (of Brouwer and Heyting) axiomatizes the reflexive and transitive Kripke frames (with persistent satisfaction relations), and…

Logic · Mathematics 2019-07-02 Parvin Safari , Saeed Salehi

Description logics (DLs) are a suitable formalism for representing knowledge about domains in which objects are described not only by attributes but also by binary relations between objects. Fuzzy extensions of DLs can be used for such…

Logic in Computer Science · Computer Science 2020-08-10 Linh Anh Nguyen , Quang-Thuy Ha , Ngoc Thanh Nguyen , Thi Hong Khanh Nguyen , Thanh-Luong Tran

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

We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes…

Logic in Computer Science · Computer Science 2015-03-24 Vilem Vychodil

Description Logics (DLs) are suitable, well-known, logics for managing structured knowledge. They allow reasoning about individuals and well defined concepts, i.e., set of individuals with common properties. The experience in using DLs in…

Artificial Intelligence · Computer Science 2011-06-06 U. Straccia

Intuitionistic fuzzy Banach algebra is introduced and a few properties of it is studied. The properties of invertible elements and relation among invertible elements, open set, closed set are emphasized. Topological divisors of zero is…

General Mathematics · Mathematics 2010-09-20 Bivas Dinda , T. K. Samanta , U. K. Bera

Classical logics of knowledge and belief are usually interpreted on Kripke models, for which a mathematically well-developed model theory is available. However, such models are inadequate to capture dynamic phenomena. Therefore, epistemic…

Logic in Computer Science · Computer Science 2015-03-13 Lorenz Demey

In this paper, we introduce the subvariety of quasi-MV* algebras in order to characterize the logic which is related to complex fuzzy logic. First, we give the definitions of strong quasi-MV* algebra and strong quasi-Wajsberg* algebra and…

Logic · Mathematics 2025-03-19 Lei Cai , Wenjuan Chen

Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…

Artificial Intelligence · Computer Science 2013-02-28 Bernhard Hollunder

We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…

Logic · Mathematics 2026-01-16 Georgi Nakov , Davide Emilio Quadrellaro

Using an algebraic framework we solve a problem posed in [5] and [7] about the axiomatizability of a quantum computational type logic related to fuzzy logic. A Hilbert-style calculus is developed obtaining an algebraic strong completeness…

Quantum Physics · Physics 2013-07-30 Hector Freytes , Graciela Domenech