Results 21 to 30 of about 1,320,893 (348)
Clustering Complex Data Represented as Propositional Formulas
, 2017 Clustering has been extensively studied to deal with different kinds of data. Usually, datasets are represented as a n-dimensional vector of attributes described by numerical or nominal categorical values. Symbolic data is another concept where the objects are more complex such as intervals, multi-categorical or modal.
Abdelhamid Boudane +3 more
openalex +5 more sources
Unified theory of integral true degrees in NM theory
Xibei Gongye Daxue Xuebao, 2023 Based on the NM propositional logic system of nilpotent minimum logic, the concept of the integral truth degree of the formula is firstly proposed by integrating the function induced by the formula, and the MP rule and HS rule of the integral truth ...
WANG Bo, HUI Xiaojing, LU Xing
doaj +1 more source
Fullness and Decidability in Continuous Propositional Logic
Mathematics, 2022 In this paper we consider general continuous propositional logics and prove some basic properties about them. First, we characterize full systems of continuous connectives of the form {¬,∸,f} where f is a unary connective.
Xuanzhi Ren
doaj +1 more source
An Analytic Propositional Proof System on Graphs [PDF]
Log. Methods Comput. Sci., 2020 In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This means that we lose
Matteo Acclavio +2 more
semanticscholar +1 more source
A Sound Interpretation of Leśniewski's Epsilon in Modal Logic KTB
Bulletin of the Section of Logic, 2022 In this paper, we shall show that the following translation \(I^M\) from the propositional fragment \(\bf L_1\) of Leśniewski's ontology to modal logic \(\bf KTB\) is sound: for any formula \(\phi\) and \(\psi\) of \(\bf L_1\), it is defined as (M1 ...
Takao Inoue
doaj +1 more source
On the Succinctness of Atoms of Dependency [PDF]
Logical Methods in Computer Science, 2019 Propositional team logic is the propositional analog to first-order team logic. Non-classical atoms of dependence, independence, inclusion, exclusion and anonymity can be expressed in it, but for all atoms except dependence only exponential translations ...
Martin Lück, Miikka Vilander
doaj +1 more source
Logical derivation search with assumption traceability
Lietuvos Matematikos Rinkinys, 2021 In this paper authors research the problem of traceability of assumptions in logical derivation. The essence of this task is to trace which assumptions from the available knowledge base of assumptions are necessary to derive a certain conclusion.
Adomas Birštunas, Elena Reivytytė
doaj +1 more source
Polynomial Algorithm of Verication for Subset of PLTL Logic
Моделирование и анализ информационных систем, 2015 In this article a polynomial algorithm is described of verification of dynamic properties of Markov chains described by formulas of a subset of temporal logic PLTL (propositional temporal logic of linear time). The algorithm allows to find probability of
P. V. Lebedev
doaj +3 more sources
Isomorphic formulae in classical propositional logic [PDF]
Mathematical Logic Quarterly, 2011 AbstractIsomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This equality is motivated by generality of deductions.
Kosta Došen, Zoran Petric
openaire +3 more sources