All generalisations within logic involve inverting implication. Yet, ever since Plotkin's work in the early 1970's methods of generalising rst-order clauses have involved inverting the clausal subsumption relationship. However , even Plotkin realised that this approach was incomplete. Since inversion of subsumption is central to many Inductive Logic Programming approaches, this form of incomple...

In order to investigate a many valued logical system whose proportional value is given in a lattice, in 1993 Y. Xu [12] first established the lattice implication algebra by combining lattice and implication algebra, and explored many useful structures. The ideal theory serves a vital function for the development of lattice implication algebras. Y. Xu, Y.B. Jun and E.H. Roh [6] introduced the no...

Due to the shortage of rough impHcation in [4] ~ [6], rough set and rough implication operators are redefined by using interval structure in [7], the shortages have been e improved. We have investigated the characteristics of the rough implication, and also point out that the good logic property of the rough implication in [7]. In this paper, we will study the algebraic properties of the rough ...

Partial implication semantics in the context of a background theory has been introduced to formalize partial goal satisfaction in the context of beliefs. In this paper, we introduce strong partial implication prohibiting redundancies and weak partial implication allowing side effects, we study their semantic as well as complexity properties, and we apply the three notions of partial implication...

Mittelstaedt has defined the class of quasi-implicative lattices and shown that an ortholattice (orthocomplemented lattice) is quasi-implicative exactly if it is orthomodular (quasi-modular). He has also shown that the quasi-implication operation is uniquely determined by the quasi-implicative conditions. One of Mittelstaedt's conditions, however, seems to lack immediate intuitive motivation. C...

We argue that the usual trace-based notions of implication and equivalence for linear temporal logics are too strong and should be complemented by the weaker notions of open implication and open equivalence. Although open implication is harder to compute, it can be used to advantage both in model checking and in synthesis. We study the difference between trace-based equivalence and open equival...

Fitts’ law is used as a performance measurement metric in human–computer interactions. The original formulation implied that movement time was identical for movements with the same value of index difficulty under varied amplitude and target width. An experiment designed to test this implication. result indicates related when constant. Nowadays, most icons applications are represented two-dimens...

Overlap function (which has symmetry and continuity) is widely used in image processing, data classification, multi-attribute decision making problems. In recent years, theoretical research on overlap been extended to interval valued lattice function, but intuitionistic fuzzy (IF-overlap function) not studied. this paper, the concept of IF-overlap proposed for first time, then generating method...