scholarly journals A Max-Term Counting Based Knowledge Inconsistency Checking Strategy and Inconsistency Measure Calculation of Fuzzy Knowledge Based Systems

2015 ◽  
Vol 2015 ◽  
pp. 1-7
Author(s):  
Hui-lai Zhi

The task of finding all the minimal inconsistent subsets plays a vital role in many theoretical works especially in large knowledge bases and it has been proved to be a NP-complete problem. In this work, at first we propose a max-term counting based knowledge inconsistency checking strategy. And, then, we put forward an algorithm for finding all minimal inconsistent subsets, in which we establish a Boolean lattice to organize the subsets of the given knowledge base and use leaf pruning to optimize the algorithm efficiency. Comparative experiments and analysis also show the algorithm’s improvement over past approaches. Finally, we give an application for inconsistency measure calculation of fuzzy knowledge based systems.

Author(s):  
Kun Sun ◽  
Boi Faltings

Abstract Knowledge-based CAD systems limit designers’ creativity by constraining them to work with the prototypes provided by the systems’ knowledge bases. We investigate knowledge-based CAD systems capable of supporting creative designs in the example domain of elementary mechanisms. We present a technique based on qualitative explanations which allows a designer to extend the knowledge base by demonstrating a structure which implements a function in a creative way. Structure is defined as the geometry of the parts, and function using a general logical language based on qualitative physics. We argue that the technique can accommodate any creative design in the example domain, and we demonstrate the technique using an example of a creative design. The use of qualitative physics as a tool for extensible knowledge-based systems points out a new and promising application area for qualitative physics.


Author(s):  
I. D. Tommelein ◽  
B. Hayes-Roth ◽  
R. E. Levitt

SightPlan refers to several knowledge-based systems that address construction site layout. Five different versions were implemented and their components of expertise are described here. These systems are alterations of one another, differing either in the problems they solve, the problem-solving methods they apply, or the tasks they address. Because they share either control knowledge, domain concepts, or heuristics, and such knowledge is implemented in well-defined modular knowledge bases, these systems could easily re-use parts of one another. Experiments like those presented here may clarify the role played by different types of knowledge during problem solving, enabling researchers to gain a broader understanding of the generality of the domain and task knowledge that is embedded in KBSs and of the power of their systems.


1997 ◽  
Vol 06 (01) ◽  
pp. 27-36 ◽  
Author(s):  
Bertrand Mazure ◽  
Lakhdar Saïs ◽  
Éric Grégoire

In this paper, we address a fundamental problem in the formalization and implementation of cooperative knowledge bases: the difficulty of preserving consistency while interacting or combining them. Indeed, knowledge bases that are individually consistent can exhibit global inconsistency. This stumbling-block problem is an even more serious drawback when knowledge and reasoning are expressed using logical terms. Indeed, on the one hand, two contradictory pieces of information lead to global inconsistency under complete standard rules of deduction: every assertion and its contrary can be deduced. On the other hand, checking the logical consistency of a propositional knowledge base is an NP-complete problem and is often out of reach for large real-life applications. In this paper, a new practical technique to locate inconsistent interacting pieces of information is presented in the context of cooperative logical knowledge bases. Based on a recently discovered heuristic about the work performed by local search techniques, it can be applied in the context of large interacting knowledge bases.


2021 ◽  
Author(s):  
Valeriya V. Gribova ◽  
Elena A. Shalfeeva

Abstract With highly increased competition, intelligent product manufacturing based on interpretable knowledge bases has been recognized as an effective method for building applications of explainable Artificial Intelligence that is the hottest topic in the field of Artificial Intelligence. The success of product family directly depends on how effective the viability mechanisms are laid down in its design. In this paper, a systematic cloud-based set of tool family is proposed to develop viable knowledge-based systems. For productive participation of domain and cognitive specialists in manufacturing, the knowledge base should be declarative, testable and integratable with other architectural components. Mechanisms to ensure KBS viability are provided in an ontology-oriented development environment, where each component is formed in terms of domain ontology by using the adaptable instrumental support. Due to the explicit separation of ontology from knowledge, it became possible to divide competencies between specialists creating an ontology and specialists creating a knowledge base. We rely on the fact that the activity of creating an ontology is significantly different from the activity of creating a knowledge base. Creating an ontology is a creative process that requires a systematic analysis of the domain area in order to identify common patterns among its knowledge.The characteristic properties of knowledge-based systems related to viability are described. It is explained, how these properties are provided in development environments implemented on cloud platform. The concept of a specialized manufacturing environment for knowledge-based system is introduced. The necessary set of tools for such ontology-oriented environment construction is determined. The example of tools for creating specialized manufacturing environments is the instruments implemented on the «IACPaaS» platform. The IACPaaS is already used for collective development of thematic cloud knowledge portals with viable knowledge-based systems. This specialized manufacturing environment has enabled the creation of multi-purpose medical software services to support specialist solutions based on knowledge being remotely improved by experts.


Author(s):  
Ram Kumar ◽  
Shailesh Jaloree ◽  
R. S. Thakur

Knowledge-based systems have become widespread in modern years. Knowledge-base developers need to be able to share and reuse knowledge bases that they build. As a result, interoperability among different knowledge-representation systems is essential. Domain ontology seeks to reduce conceptual and terminological confusion among users who need to share various kind of information. This paper shows how these structures make it possible to bridge the gap between standard objects and Knowledge-based Systems.


1995 ◽  
Vol 10 (1) ◽  
pp. 67-68
Author(s):  
Nicolaas J. I. Mars

A number of groups developing knowledge-based systems have found (or at least posited) that the design and representation of a limitative set of concepts and relations, a so-called ontology, can contribute to sharing and reusing knowledge bases. However, very few descriptions of implemented ontologies have appeared in the literature. No comparison of competing proposals is available, let alone an empirical determination of the benefits of using an ontology. There is no accepted method for designing and building such ontologies, nor is it clear how ontologies can best be evaluated.


Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 252
Author(s):  
Gonzalo A. Aranda-Corral ◽  
Joaquín Borrego-Díaz ◽  
Juan Galán-Páez ◽  
Daniel Rodríguez-Chavarría

In the paradigm of Knowledge-Based Systems (KBS), the design of methods to simplify the reasoning leads to more efficient processes. A point of view that provides valuable insights is the algebraic one. In this work, a notion of basis (and dimension) for Knowledge Bases in Propositional Logic associated with knowledge forgetting is introduced. It is based on ideas that come from the translation of such logic in (Computer) Algebra, particularly from the interpretation of variable forgetting. In this paper, the concept of weak base is defined as a set of variables sufficient to decide the consistency using variable forgetting. Several applications of weak bases are presented in order to show their usefulness in KBS reasoning and to justify their study and use in solving problems within this topic.


Sign in / Sign up

Export Citation Format

Share Document