Treffer: Theory and algorithm for rule base refinement
Title:
Theory and algorithm for rule base refinement
Authors:
Source:
Developments in applied artificial intelligence (Loughborough, 23-26 June 2003)Lecture notes in computer science. :187-196
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 21 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Intelligence artificielle, Artificial intelligence, Apprentissage et systèmes adaptatifs, Learning and adaptive systems, Base connaissance, Knowledge base, Base conocimiento, Fermeture, Closure, Cerradura, Méthode raffinement, Refinement method, Método afinamiento, Outil logiciel, Software tool, Herramienta software, Redondance, Redundancy, Redundancia, Système expert, Expert system, Sistema experto, Théorie algorithme, Algorithm theory
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Knowledge Grid Research Group, Key Lab of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Science, 100080, Beijing, China
Department of Computer Science, College of Information Science, Beijing Normal University, 100875, Beijing, China
Department of Computer Science, College of Information Science, Beijing Normal University, 100875, Beijing, China
ISSN:
0302-9743
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15551789
Database:
PASCAL Archive
Weitere Informationen
Rule base refinement plays an important role in enhancing the efficacy and efficiency of utilizing a rule base. A rule base concerns three types of redundancies: implication-rule redundancy, abstraction-rule redundancy and dead-end-condition redundancy. This paper proposes two approaches: one is to remove implication redundant rules by using the closure of literal set and the other is to remove abstraction redundant rules by using rule-abstraction. We have developed a software tool to support the first approach. Experiments show that the tool can work correctly and efficiently. The proposed approach can be applied to more application fields.