نتایج جستجو برای: lattice valued logic
تعداد نتایج: 278300 فیلتر نتایج به سال:
This paper describes our multi-valued symbolic modelchecker χChek. χChek is a generalization of an existing symbolic model-checking algorithm for a multi-valued extension of the temporal logic CTL. Multi-valued modelchecking supports reasoning with values other than just TRUE and FALSE. Multi-valued logics are useful in software engineering because they support explicit modeling of uncertainty,...
In this paper we considered a moving from classical logic and Kolmogorov’s probability theory to non-classical p-adic valued logic and p-adic valued probability theory. Namely, we defined p-adic valued logic and further we constructed probability space for some ideals on truth values of p-adic valued logic. We proposed also p-adic valued inductive logic. Such a logic was considered for the firs...
We present two embeddings of in nite-valued Lukasiewicz logic L into Meyer and Slaney’s abelian logic A, the logic of lattice-ordered abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding systems for L. These include: hypersequent calculi for A and L and terminating versions of these calculi; labelled single sequent calculi for A and L of comple...
In this position paper we start with a motivation of our study of modal/description logics with values in concept lattices. Then we give a brief survey of approaches to lattice-valued modal and/or description logics. After that we study some methods of context symmetrization, because the description logic on concept lattices is defined for symmetric co ntexts only. We conclude with a list of pr...
In this paper, we study model-checking of linear-time properties in multi-valuedsystems. Safety property, invariant property, liveness property, persistence anddual-persistence properties in multi-valued logic systems are introduced. Somealgorithms related to the above multi-valued linear-time properties are discussed.The verification of multi-valued regular safety properties an...
Inconsistency is a pervasive problem in software engineering, where different aspects of a system are described in separate models. Resolving all the inconsistencies in a large set of models is often infeasible, in which case automated reasoning tools based on classical logic have limited application. In this paper we describe an automated tool for paraconsistent reasoning, using multi-valued l...
We give a classification of dual functions, they are m -al functions. We call a function m-al with respect to an operator if the operator lives any function unchanged after m times of using the operator. And 2 ≤ m ≤ k. Functions with different m have very different properties. We give theoretical results for clones of self-dual (m = 2) and selfk -al (m = k) functions in k -valued logic at k ≤ 3...
We look at extensions (i.e., stronger logics in the same language) of the Belnap-Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap-Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterize the reduced algebraic models of these new logics and prove a completeness result for the first ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید