The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Automated reasoning has become the research hotspot among researchers, and family relations are common logic knowledge, which can be reasoned. This paper presents four basic relations on family relations, which can deduce others new complex relations. The relation knowledge was stored in knowledge database as forms of basic relations. Some common questions could be deduced successfully and receive...
This paper presents the problem of the identification of the causal relations that agents, in front of a sequence of reported events, may attribute on the basis of their beliefs on the course of things and available pieces of information. In particular, we focus on graphical models exploiting the idea of “intervention”, initially proposed in the probability framework by Pearl, and developed in the...
Quantified logic in the many-valued logic system is established by Wang G J, which is based on linear evaluation lattice frame. The variable truth degree is defined in the propositional logic system associated with rhombus evaluation lattice and Gaines-Rescher implication operation, the fundamental nature of the variable truth degree is studied, the distribution of truth degree of formulae and inference...
For the approximate reasoning method based on truth degree is extended to the case of non-uniform assignment, we define assignment weight vector in discrete probability space and quasi-truth degree of formula in Lukasiewicz 4-valued logic system which is popularized from truth degree of formula. We also prove that the set of quasi-truth degree of all formulas in the range of [0,1] is dense and give...
In pattern recognition, data integration is a processing method to combine multiple sources so that the combined result can be more accurate than a single source. Evidence theory is one of the methods that have been successfully applied to the data integration task. Since Dempster-Shafer theory as the first evidence theory can be against our intuitive reasoning with some data sets, many researchers...
This article first extends Description Logics ALC and put forward ALC+, which is extended on ALC by adding transitive role, inverse role, role disjunction, role composition and general number restriction, and defines its syntax and semantics. Then, we discuss the mainly knowledge reasoning problem about concept satisfiability of ALC+, and give the determinant algorithm of the concept satisfiability...
Nowadays the utility of domain ontologies is widely acknowledged in many area, such as information systems, software engineer, nature language processing, artificial intelligence, electronic commerce and so on. Ontologies are enable to fulfill knowledge appearance, information retrieval and search. However, there still exists several drawbacks that must be resolved before ontologies become practical...
DSmT would resolve the issue of evidence portfolios when the high conflict of evidences appeared. But the computation oversized more easily because more focus elements were additional in the DSmT rules. And the fusion result was worse than that of DST when the low conflict situation was occurred. In order to efficiently combine high conflicting evidences, an improved fusion algorithm on conflict evidence...
Four kinds of basic decision rule sets are respectively produced from the formal concept lattice, the dual formal concept lattice, the object-oriented concept lattice and the attribute-oriented concept lattice in a formal context. Based on these sets, two types of decision inferences are established via an inclusion degree. The corresponding decisions by inferences are proved to be the lower and the...
This paper presented an approach for trust computing using fuzzy cognitive map and D-S evidence reasoning theory. As fuzzy inference can deal with variable dependencies in the system by decoupling dependable variables, FCM provides an efficient way to trust deducing, and also the difficulty and complexity of trust computing. The approach of DS evidence overcomes the problem of over-precision.
Statistical default logic is an expansion of classical (i.e. Reiter's) default logic that allows us to model common inference patterns found in standard inferential statistics, which is an expansion with an error-bound parameter. This paper proposes statistical default inference based on dynamic fuzzy logic (DFL) and constructs a method of computing extensions of fuzzy statistical default theory.
It is important to constitute agent with motivation in agent-based computing. Recent study of the definition of motivation and its effects on reasoning mechanism of agent are not complete. This paper presents a model of agent based on norms, policies and contracts, in which the motivation from external environment can be explicitly expressed and integrated into agent's reasoning process. In order...
In this paper, some logical-metric expressions are proposed, which are resulted from D-random truth degree, truth degree and conditional truth degree. All the expressions can be used in the approximate reasoning and turned into the numerical methods in the error analysis.
In this paper, we propose the basic framework of point- wise topological logic on completely distributive lattices and explore approximate reasoning in it. The logic of this paper is based on pointwise characterization, therefore the pointwise conception is pervasive. We explore approximate reasoning in abstract logical framework Fl on completely distributive lattice L. We propose the structure of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.