نتایج جستجو برای: lattice valued logic

تعداد نتایج: 278300  

Journal: :Logic Journal of the IGPL 2014
Marcelo E. Coniglio Luiz Henrique Da Cruz Silvestrini

In 1986, I. Mikenberg, N. da Costa and R. Chuaqui introduced the semantic notion of quasi-truth defined by means of partial structures. In such structures, the predicates are seen as triples of pairwise disjoint sets: the set of tuples which satisfies, does not satisfy and can satisfy or not the predicate, respectively. The syntactical counterpart of the logic of partial truth is a rather compl...

Journal: :Notre Dame Journal of Formal Logic 1977

Due to the high density and the low consumption power in the digital integrated circuits, mostly technology of CMOS is used. During the past times, the Metal oxide silicon field effect transistors (MOSFET) had been used for the design and implementation of the digital integrated circuits because they are compact and also they have the less consumption power and delay to the other transistors. B...

Journal: :Fuzzy Sets and Systems 2006
Yongming Li

Some uniform categorical theoretical treatment of automata and lattice-valued fuzzy automata using quantale theory is studied in this paper. First, L-relational sheaves on a monoidM andQ-enriched categories are introduced for quantales L andQ, the equivalence of the corresponding categories are proved next. Then lattice-valued (fuzzy) automata are described by Q-enriched categories. In fact, la...

2005
Davy Van Nieuwenborgh Stijn Heymans Dirk Vermeir

We describe the design of the OLPS system, an implementation of the preferred answer set semantics for ordered logic programs. The basic algorithm we propose computes the extended answer sets of a simple program using an intuitive 9-valued lattice, called T9. During the computation, this lattice is employed to keep track of the status of the literals and the rules while evolving to a solution. ...

Journal: :J. Log. Comput. 1995
Chiaki Sakama Katsumi Inoue

This paper presents declarative semantics of possibly inconsistent disjunctive logic programs. We introduce the paraconsistent minimal and stable model semantics for extended disjunctive programs, which can distinguish inconsistent information from others in a program. These semantics are based on lattice-structured multi-valued logics, and are characterized by a new xpoint semantics of extende...

2003
Yang Xu Keyun Qin Da Ruan Jun Liu

In this age of modern era, the use of internet must be maximized. Yeah, internet will help us very much not only for important thing but also for daily activities. Many people now, from any level can use internet. The sources of internet connection can also be enjoyed in many places. As one of the benefits is to get the on-line lattice valued logic an alternative approach to treat fuzziness and...

Journal: :SIAM J. Discrete Math. 2010
Jovisa D. Zunic

A two-dimensional threshold function of k-valued logic can be viewed as coloring of the points of a k × k square lattice into two colors such that there exists a straight line separating points of different colors. For the number of such functions only asymptotic bounds are known. We give an exact formula for the number of two-dimensional threshold functions and derive more accurate asymptotics.

1996
Reiner Hähnle

We provide a concise axiomatization of a broad class of generalized quantiiers in many-valued logic, so-called distribution quantiiers. Although sound and complete axiomatizations for such quantiiers exist, their size renders them virtually useless for practical purposes. We show that for certain lattice-based quan-tiiers relatively small axiomatizations can be obtained in a schematic way. This...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید