. The technique of default reasoning is to specify a predicate (or property or situation) by stating sufficient conditions for a general rule, and then stating exceptions to it. Logic programming supports the expression of default reasoning quite directly with negation as failure. Tight derivations were employed

-ordinated decision making, and decentralized execution, which provide a superior social morphology for all human action. Networks de-centre performance and share decision-making. By denition, a network has no centre. It works on a binar y logic: inclusion/exclusion. All there is in the network is useful and necessar

A b s t r a c t. This paper deals with axiomatization problems for varieties of residuated meet semilattice-ordered monoids (RSs). An internal characterization of the finitely subdirectly irreducible RSs is proved, and it is used to investigate the varieties of RSs within which the finitely based

doi:10.3233/978-1-61499-098-7-103

I herewith certify that all material in this dissertation which is not my own work has been properly acknowledged.

Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con-cepts. This main goal is motivated by the basic fact, constituting also the main problem of KDD, that languages we may choose for knowledge description are incomplete. A fortiori, we have to describe concepts of interest (features, proper-ties, relations etc.) not completely but by means of their reflections (i.e. approx-imations) in the chosen language. The most important issues in this induction process are: – construction of relevant primitive concepts from which approximations of more complex concepts are assembled, – measures of inclusion and similarity (closeness) on concepts, – construction of operations producing complex concepts from the primitive ones.

as Failure (MKNF), which allows statements about individuals to be jointly derived via entailment from an ontology and inferences from rules. Nonetheless, the practical usefulness of MKNF has not always been clear, although recent work has formalized a general resolution-based method for querying MKNF when

institutional exclusion, the extent to which the market was beyond the control of the NYCHA, using the percentage of banking organizations that were not affiliated with the NYCHA in a year. We predicted that the NYCHA member banks' failure rate would be higher when the percentage of banking organizations

ACKNOWLEDGMENTS I would like to give many thanks to Dr. Shengli Fu and Dr. Yan Huang as my advi-

In presenting this thesis in partial fulfilment of the requirements for a Postgraduate degree