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...

At least also introduces an implication of speaker ignorance ([9, 1, 12, 19]). (1) conveys that the speaker is uncertain about the exact number of cooks Al hired. In one view, pioneered by Büring ([1]), this ignorance implication is a Gricean Quantity implicature. Büring proposes to capitalize on a striking similarity between at least and disjunction. Just like 1, 3 below lacks the upper-boundi...

Lukasiewicz implication algebras are the {→, 1}-subreducts of MV algebras. They are the algebraic counterpart of SuperLukasiewicz Implicational Logics. We give a description of free Lukasiewicz implication algebras in the context of McNaughton functions. More precisely, we show that the |X|-free Lukasiewicz implication algebra is isomorphic to ⋃ x∈X [xθ) for a certain congruence θ over the |X|-...

A quasi-implication algebra is introduced as an algebraic counterpart of an implication reduct of propositional logic having noninvolutory negation (e.g. intuitionistic logic). We show that every pseudocomplemented semilattice induces a quasi-implication algebra (but not conversely). On the other hand, a more general algebra, a so-called pseudocomplemented q-semilattice is introduced and a mutu...

(Abstract) In this paper, we propose a new method for discovering hidden information from large-scale transaction databases by considering a property of cofactor implication. Cofactor implication is an extension or generalization of symmetric itemsets, which has been presented recently. Here we discuss the meaning of cofactor implication for the data mining applications, and show an efficient a...

a heyting algebra is a distributive lattice with implication and a dual $bck$-algebra is an algebraic system having as models logical systems equipped with implication. the aim of this paper is to investigate the relation of heyting algebras between dual $bck$-algebras. we define notions of $i$-invariant and $m$-invariant on dual $bck$-semilattices and prove that a heyting semilattice is equiva...

This dissertation introduces a path constraint language and investigates its associated implication and finite implication problems. This path constraint language has proven useful in a variety of database contexts, ranging from semistructured data as found for instance on the Web, to structured data such as data in object-oriented databases. It is capable of expressing natural integrity constr...

Professor Rasiowa [HR49] considers implication algebras (A,⇒, V ) such that ⇒ is a binary operation on the universe A and V ∈ A. In particular, there are studied implicative algebras, positive implication algebras and implication algebras; the second kind corresponds to the logic of positive implication, and the third one to the logic of classical implication. In each case, the distinguished el...