Related papers: Constraint tableaux for two-dimensional fuzzy logi…
The paper aims to develop a framework for coalgebraic fuzzy geometric logic by adding modalities to the language of fuzzy geometric logic. Using the methods of coalgebra, the modal operators are introduced in the language of fuzzy geometric…
The fuzzy modality `probably` is interpreted over probabilistic type spaces by taking expected truth values. The arising probabilistic fuzzy description logic is invariant under probabilistic bisimilarity; more informatively, it is…
The problem of minimizing fuzzy interpretations in fuzzy description logics (FDLs) is important both theoretically and practically. For instance, fuzzy or weighted social networks can be modeled as fuzzy interpretations, where individuals…
Linear implication can represent state transitions, but real transition systems operate under temporal, stochastic or probabilistic constraints that are not directly representable in ordinary linear logic. We propose a general modal…
Fekete, Jord\'an and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their…
We present a first result towards the use of entailment in- side relational dual tableau-based decision procedures. To this end, we introduce a fragment of RL(1) which admits a restricted form of composition, (R ; S) or (R ; 1), where the…
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.…
In medicine one frequently deals with vague information. As a tool for reasoning in this area, fuzzy logic suggests itself. In this paper we explore the applicability of the basic ideas of fuzzy set theory in the context of medical…
In this paper we describe an approach to constraint-based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order (MSO) logic are represented by tree automata recognizing the…
We apply to logic programming some recently emerging ideas from the field of reduction-based communicating systems, with the aim of giving evidence of the hidden interactions and the coordination mechanisms that rule the operational…
Fuzziness and randomicity widespread exist in natural science, engineering, technology and social science. The purpose of this paper is to present a new logic - uncertain propositional logic which can deal with both fuzziness by taking…
Fuzzy reasoning is a very productive research field that during the last years has provided a number of theoretical approaches and practical implementation prototypes. Nevertheless, the classical implementations, like Fril, are not adapted…
We propose a matrix model for two- and many-valued logic using families of observables in Hilbert space, the eigenvalues give the truth values of logical propositions where the atomic input proposition cases are represented by the…
We define and construct a new data structure, the tables, this structure generalizes the (finite) $k$-sets sets of Eilenberg \cite{Ei}, it is versatile (one can vary the letters, the words and the coefficients). We derive from this…
There is a growing need for abstractions in logic specification languages such as FO(.) and ASP. One technique to achieve these abstractions are templates (sometimes called macros). While the semantics of templates are virtually always…
The technique of $Q$-polinomials are used to derive the $w$- constraints in the two-matrix and Kontsevich-like model at finite $N$. These constraints are closed and form Lie algebra. They are associated with the matrices, $\lambda…
Lambeks Syntactic Calculus, commonly referred to as the Lambek calculus, was innovative in many ways, notably as a precursor of linear logic. But it also showed that we could treat our grammatical framework as a logic (as opposed to a…
Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of…
We review the separation of variables for the Kowalevski top and for its generalization to the algebra o(4). We notice that the corresponding separation equations allow an interpretation of the Kowalevski top as a B2 integrable lattice.…
Linear representations for a subclass of boolean symmetric functions selected by a parity condition are shown to constitute a generalization of the linear constraints on probabilities introduced by Boole. These linear constraints are…