Incidence Calculus on Lukasiewicz's Three-valued Logic

نویسندگان

  • Guilin Qi
  • Peter Milligan
  • Paul Sage
چکیده

Incidence calculus is a probabilistic logic which possesses both numerical and symbolic approaches. However, Liu in [5] pointed out that the original incidence calculus had some drawbacks and she established a generalized incidence calculus theory (GICT) based on Łukasiewicz’s threevalued logic to improve it. In a GICT, an incidence function is defined to relate each proposition φ in the axioms of the theory to a set of possible worlds in which φ has truth value true. But the incidence function only represents those absolute true states of propositions, so it can not deal with the uncertain states. In this paper, we use two incidence functions i∗ and i∗ to relate the axioms to the sets of possible worlds. For an axiom φ, i∗(φ) is to be thought of as the set of possible worlds in which φ has truth value true, while i∗(φ) is the set of possible worlds in which φ is true or undeterminable. Since i∗ can represent the undeterminable state, our newly defined theory is more efficient to handle vague information than GICT.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Epistemic semantics for classical and intuitionistic logic

1 In this paper I propose to explain how several nonstandard semantic systems for the propositional logic can be seen as employing essentially the same principles for defining the notion of logical entailment and the more basic idea of assignment of truth-values to molecular sentences. The systems are Kleene's three-valued matrix for the strong connectives, Lukasiewicz's three-valued matrix, su...

متن کامل

Lukasiewicz and Modal Logic

Lukasiewicz's four-valued modal logic is surveyed and analyzed.

متن کامل

Well-Founded Inference and 3-Valued Logics

We deene a simple logical semantics based on minimal models in Lukasiewicz's 3-valued logic, L 3. On normal logic programs it is equivalent to the well-founded semantics (WFS), and on disjunctive programs it is equivalent to the P-stable semantics of Eiter, Leone and Saccc a, hence to Przymusinski's 3-valued stable semantics. One advantage is that it is char-acterised by simple conditions on mo...

متن کامل

On Lukasiewicz's Four-Valued Modal Logic

à Lukasiewicz’s four-valued modal logic is surveyed and analyzed, together with à Lukasiewicz’s motivations to develop it. A faithful interpretation of it into classical (non-modal) two-valued logic is presented, and some consequences are drawn concerning its classification and its algebraic behaviour. Some counter-intuitive aspects of this logic are discussed under the light of the presented r...

متن کامل

A Complete Axiomatization of the Three-Valued Completion of Logic Programs

We prove the completeness of extended SLDNF-resolution for the new class of ε-programs with respect to the three-valued completion of a logic program. Not only the class of allowed programs but also the class of definite programs are contained in the class of ε-programs. To understand better the three-valued completion of a logic program we introduce a formal system for three-valued logic in wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fundam. Inform.

دوره 68  شماره 

صفحات  -

تاریخ انتشار 2005