The basic question of our study is how we can give a possible model for handling uncertain information. This model is worked out in the framework of DATALOG. The concept of fuzzy knowledge-base will be defined as a quadruple of any background knowledge; a deduction mechanism; a connecting algorithm, and a decoding set of the program, which help us to determine the uncertainty level of the resul...

When applying rules produced by induction from training examples to a test example, there are three possible cases that demand different actions: (i) no match; (ii) single match; and (iii) multiple match. Existing techniques for dealing with the "rst and third cases are exclusively based on probability estimation. However, when there are continuous attributes in the example space, and if these ...

In this paper we make some observations about Natural Deduction derivations [Prawitz, 1965, van Dalen, 1986, Bell and Machover, 1977]. We assume the reader is familiar with it and with proof-theory in general. Our development will be simple, even simple-minded, and concrete. However, it will also be evident that general ideas motivate our examples, and we think both our specific examples and th...

An automated forward deduction system for entailment calculus is an indispensable component of many application systems – such as theorem finding, active database, knowledge discovery systems – that require an autonomous reasoning engine. The performance of an automated forward deduction system is crucial to its applicability. In this paper, we present some parallel forward deduction algorithms...

in this paper, a mechanized system for self-assessment based on process-oriented approach of iso 9004:2000 has been developed. to design of this mechanized system, the expert system has been used as in providing the assessment and scoring questions the experts’ knowledge, head auditors of quality management system, has been used and this knowledge has been saved in the access software database....

This paper describes a natural deduction formulation for Full Intuitionistic Linear Logic (FILL), an intriguing variation of multiplicative linear logic, due to Hyland and de Paiva. The system FILL resembles intuitionistic logic, in that all its connectives are independent, but resembles classical logic in that its sequent-calculus formulation has intrinsic multiple conclusions. From the intrin...

We present a variant of the Datalog language (we call it Datalog ), which is able to deal with weights on ground facts. The weights are chosen from a semiring algebraic structure. Our goal is to use this language as a semantic foundation for trust-management languages, in order to express trust relationships associated with a preference (e.g., a cost, an uncertainty, a trust or a fuzzy value). ...