229 research outputs found
The Combination of Paradoxical, Uncertain, and Imprecise Sources of Information based on DSmT and Neutro-Fuzzy Inference
The management and combination of uncertain, imprecise, fuzzy and even
paradoxical or high conflicting sources of information has always been, and
still remains today, of primal importance for the development of reliable
modern information systems involving artificial reasoning. In this chapter, we
present a survey of our recent theory of plausible and paradoxical reasoning,
known as Dezert-Smarandache Theory (DSmT) in the literature, developed for
dealing with imprecise, uncertain and paradoxical sources of information. We
focus our presentation here rather on the foundations of DSmT, and on the two
important new rules of combination, than on browsing specific applications of
DSmT available in literature. Several simple examples are given throughout the
presentation to show the efficiency and the generality of this new approach.
The last part of this chapter concerns the presentation of the neutrosophic
logic, the neutro-fuzzy inference and its connection with DSmT. Fuzzy logic and
neutrosophic logic are useful tools in decision making after fusioning the
information using the DSm hybrid rule of combination of masses.Comment: 20 page
Reasoning with Inconsistencies in Hybrid MKNF Knowledge Bases
This article is concerned with the handling of inconsistencies occurring in the combination of description logics and rules, especially in hybrid MKNF knowledge bases. More precisely, we present a paraconsistent semantics for hybrid MKNF knowledge bases (called para-MKNF knowledge bases) based on four-valued logic as proposed by Belnap. We also reduce this paraconsistent semantics to the stable model semantics via a linear transformation operator, which shows the relationship between the two semantics and indicates that the data complexity in our paradigm is not higher than that of classical reasoning. Moreover, we provide fixpoint operators to compute paraconsistent MKNF models, each suitable to different kinds of rules. At last we present the data complexity of instance checking in different para-MKNF knowledge bases
Inconsistency and Incompleteness in Relational Databases and Logic Programs
The aim of this thesis is to study the role played by negation in databases and to develop data models that can handle inconsistent and incomplete information. We develop models that also allow incompleteness through disjunctive information under both the CWA and the OWA in relational databases. In the area of logic programming, extended logic programs allow explicit representation of negative information. As a result, a number of extended logic programs have an inconsistent semantics. We present a translation of extended logic programs to normal logic programs that is more tolerant to inconsistencies. Extended logic programs have also been used widely in order to compute the repairs of an inconsistent database. We present some preliminary ideas on how source information can be incorporated into the repair program in order to produce a subset of the set of all repairs based on a preference for certain sources over others
05171 Abstracts Collection -- Nonmonotonic Reasoning, Answer Set Programming and Constraints
From 24.04.05 to 29.04.05, the Dagstuhl Seminar
05171 ``Nonmonotonic Reasoning, Answer Set Programming and Constraints\u27\u27
was held in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
- …