Various proof methods have been proposed to solve the implication problem , i.e. proving that properties of the form : 8(P ! Q)-where P and Q denote conjunctions of atoms-are logical consequences of logic programs. Nonetheless, it is a commonplace to say that it is still quite a diicult problem. Besides, the advent of the constraint logic programming scheme constitutes not only a major step tow...

this study aims at review and discuss types of places mentioned in al-hareeri`s maqamaat and their significance and relevance to mankind`s religious, socioeconomic and literary life within the necessary righteous and healthy needed environment. this study endeavors to disclose the broad lines of hareeri`s theory and its semantic aspects of place and the mutual influence of mankind and place on ...

In this paper we extend the predicate logic introduced in [Beauquier et al. 2002] in order to deal with Semi-Markov Processes. We prove that with respect to qualitative probabilistic properties, model checking is decidable for this logic applied to SemiMarkov Processes. Furthermore we apply our logic to Probabilistic Timed Automata considering classical and urgent semantics, and considering als...

This paper presents a new abstract framework to deal in a uniform way with the increasing variety of fuzzy logics studied in the literature. By means of notions and techniques from Abstract Algebraic Logic, we perform a study of non-classical logics based on the kind of generalized implication connectives they possess. It yields the new hierarchy of implicational logics. In this framework the n...

C. I. Lewis repeatedly exempts MacColl from criticisms of his predecessors in their accounts of implication. They had all taken a true implication, or conditional, to be one with false antecedent or true consequent. MacColl uniquely, and correctly in Lewis’ view, rejected this account, identifying a true implication with the impossibility of true antecedent and false consequent. Lewis’ developm...

1. Formulation of the problem 1:1: It is necessary to represent implication in expert systems Our knowledge of complex systems is often incomplete, and therefore, we have to rely on the expert's statements, These statements are usually formulated not in mathematical terms, but in words of natural languages. Fuzzy logic is a methodology for formalizing such statements. Since a large part of expe...

We discuss paradoxes of implication in the setting of a proof-conditional theory of meaning for logical constants. We argue that a proper logic of implication should be not only relevant, but also constructive and nonmonotonic. This leads us to select as a plausible candidate LL, a fragment of linear logic which differs from R in that it rejects both contraction and