A systematic and detailed presentation of a design methodology for knowledge-based systems
Data, information, and knowledge are integrated in a unified methodology
The methodology builds a maintenance mechanism into the design
A monograph for specialists interested in building maintainable knowledge based systems, giving a unified methodology for the design of such systems|This monograph describes a methodology for the design of knowledge-based systems. A knowledge-based system contains knowledge as well as information and data. The information and data in such a system can be modelled and imple mented as a database. The knowledge in such a system can be implemented either in a programming language or in an expert systems shell. This methodology has two distinguishing features. First, it is "unified". A unified methodology repre sents the data, information and knowledge in a homogeneous manner, as well as the relationships between them. Second, the methodology builds a maintenance mechanism into the design. In knowledge engineering terms, the representation used by this methodology to model knowledge bases applies equally to databases. In database terms, the representation used by this methodology to model databases applies equally to the database rules. The unified methodology unifies the design of the "knowledge base compo nent" and the "database component". "Unification" is achieved in five senses.
1 Fundamentals.- 1.1 Introduction.- 1.2 Formalisms.- 1.2.1 Logic as a knowledge language.- 1.2.2 Logic as a programming language.- 1.2.3 Logic as a database language.- 1.2.4 ?-calculus.- 1.3 Data, information and knowledge.- 1.3.1 Associations.- 1.3.2 Data things.- 1.3.3 Information things.- 1.3.4 Knowledge things.- 1.4 Knowledge-based systems.- 1.4.1 Design.- 1.4.2 Implementation.- 1.4.3 Maintenance.- 1.5 Summary.- 2 Non-unified design.- 2.1 Introduction.- 2.2 Non-unified methodology.- 2.3 Non-unified representation.- 2.3.1 Data and information representation.- 2.3.2 Knowledge representation.- 2.4 Classification.- 2.5 Representation.- 2.6 Specification.- 2.6.1 Functional model.- 2.6.2 Internal model.- 2.7 Summary.- 3 Items.- 3.1 Introduction.- 3.2 Unified representation.- 3.3 Item structure.- 3.4 Data items.- 3.5 Information items.- 3.6 Knowledge items.- 3.7 Algebra of items.- 3.8 System items.- 3.9 Summary.- 4 Objects.- 4.1 Introduction.- 4.2 Limitations of items.- 4.3 Object structure.- 4.4 Data objects.- 4.5 Information objects.- 4.5.1 Further examples.- 4.6 Knowledge objects.- 4.6.1 Further examples.- 4.7 Algebra of objects.- 4.7.1 Object composition.- 4.7.2 Object join.- 4.8 Inheritance.- 4.9 Summary.- 5 Schemas.- 5.1 Introduction.- 5.2 i-schemas.- 5.3 r-schemas.- 5.4 From r-schemas to i-schemas.- 5.5 o-schemas.- 5.6 o-schemas as operators.- 5.7 t-schemas.- 5.8 Summary.- 6 Normalisation.- 6.1 Introduction.- 6.2 Meaning of normal.- 6.3 Normalisation of items.- 6.4 Normalisation of objects.- 6.5 Classical normal forms.- 6.5.1 First classical normal form.- 6.5.2 Second classical normal form.- 6.5.3 Third classical normal form.- 6.5.4 Boyce-Codd classical normal form.- 6.5.5 Fourth and fifth classical normal forms.- 6.5.6 Summary of classical normal forms.- 6.6 Non-classical normal forms.- 6.7 Normal forms for groups.- 6.8 Summary.- 7 Specification.- 7.1 Introduction.- 7.2 Methodology structure.- 7.3 Item behaviour.- 7.4 r-schema construction.- 7.5 Application representation.- 7.5.1 Context diagram.- 7.5.2 Differentiation.- 7.5.3 Decomposition.- 7.6 Requirements identification.- 7.6.1 Prime scoping.- 7.6.2 Re-use.- 7.6.3 Feasibility.- 7.6.4 Classification.- 7.6.5 Volatility.- 7.7 Summary.- 8 Analysis.- 8.1 Introduction.- 8.2 Conceptual model.- 8.3 Basis.- 8.3.1 Data item identification.- 8.3.2 i-schema construction.- 8.3.3 Removal of equivalences.- 8.3.4 Identification of sub-types.- 8.3.5 Data normalisation.- 8.4 Conceptual view.- 8.4.1 Object identification.- 8.4.2 Object library.- 8.4.3 Removal of equivalent objects.- 8.4.4 Refining object functionality.- 8.4.5 Removal of labels.- 8.4.6 Reduction of sub-items.- 8.4.7 Mixed-type decomposition.- 8.4.8 Information normalisation.- 8.5 c-coupling map.- 8.5.1 Component relationships.- 8.5.2 Equivalence relationships.- 8.5.3 Sub-item relationships.- 8.5.4 Duplicate relationships.- 8.6 Constraints.- 8.6.1 Individual constraints.- 8.6.2 Model constraints.- 8.7 Summary.- 9 Function.- 9.1 Introduction.- 9.2 Functional model.- 9.3 Analysis of transactions.- 9.3.1 t-schema construction.- 9.3.2 Transaction linkage.- 9.4 Functional view.- 9.4.1 Identification of transaction items.- 9.4.2 Identification of input items.- 9.4.3 Intermediate item selection.- 9.4.4 Knowledge normalisation.- 9.5 f-coupling map.- 9.6 Constraints.- 9.7 System function problem.- 9.7.1 Problem complexity.- 9.7.2 Complexity measures.- 9.7.3 Sub-optimal item selection.- 9.8 Summary.- 10 Layout.- 10.1 Introduction.- 10.2 Internal model.- 10.3 Operational requirements.- 10.4 Internal view.- 10.5 i-coupling map.- 10.6 Constraints.- 10.7 System layout problem.- 10.7.1 Calculation of minimal storage.- 10.7.2 Problem complexity.- 10.7.3 Sub-optimal storage layout.- 10.8 Summary.- 11 Maintenance.- 11.1 Introduction.- 11.2 Methodology.- 11.3 Set constraints.- 11.4 Strategy for maintenance.- 11.4.1 Alterations.- 11.4.2 Examinations.- 11.5 Significance of normalisation.- 11.6 System constraints.- 11.7 Management of maintenance.- 11.8 Summary.- 12 Case study.- 12.1 Introduction.- 12.2 Requirements specification (1).- 12.2.1 Context diagram.- 12.2.2 Differentiation.- 12.2.3 Decomposition.- 12.2.4 Requirements identification.- 12.3 Analysis (1).- 12.4 Function (1).- 12.5 Second prime r-schema.- 12.5.1 Requirements specification (2).- 12.5.2 Analysis (2).- 12.5.3 Function (2).- 12.6 Layout.- 12.7 Maintenance.- References.
This book is a systematic and detailed deillegalscription of a design methodology for knowledge-based systems. Such systems contain knowledge as well as information and data. The information and data can be modeled and implemented as a database, the knowledge can be implemented either in a programming language or in an expert systems shell. The methodology has two special features: It is unified, i.e., it represents the data, information, and knowledge in a homogeneous manner, as well as the relationships between them. Also, it builds a maintenance mechanism into the design.
An additional benefit of the book is its thorough treatment of constraints for knowledge and for knowledge-based systems. Presenting the material in both a formal and a practical way, it is intended for practitioners as well as researchers and advanced students.
This monograph describes a methodology for the design of knowledge-based systems. A knowledge-based system contains knowledge as well as information and data. The information and data in such a system can be modelled and imple mented as a database. The knowledge in such a system can be implemented either in a programming language or in an expert systems shell. This methodology has two distinguishing features. First, it is "unified". A unified methodology repre sents the data, information and knowledge in a homogeneous manner, as well as the relationships between them. Second, the methodology builds a maintenance mechanism into the design. In knowledge engineering terms, the representation used by this methodology to model knowledge bases applies equally to databases. In database terms, the representation used by this methodology to model databases applies equally to the database rules. The unified methodology unifies the design of the "knowledge base compo nent" and the "database component". "Unification" is achieved in five senses.
1 Fundamentals.- 1.1 Introduction.- 1.2 Formalisms.- 1.3 Data, information and knowledge.- 1.4 Knowledge-based systems.- 1.5 Summary.- 2 Non-unified design.- 2.1 Introduction.- 2.2 Non-unified methodology.- 2.3 Non-unified representation.- 2.4 Classification.- 2.5 Representation.- 2.6 Specification.- 2.7 Summary.- 3 Items.- 3.1 Introduction.- 3.2 Unified representation.- 3.3 Item structure.- 3.4 Data items.- 3.5 Information items.- 3.6 Knowledge items.- 3.7 Algebra of items.- 3.8 System items.- 3.9 Summary.- 4 Objects.- 4.1 Introduction.- 4.2 Limitations of items.- 4.3 Object structure.- 4.4 Data objects.- 4.5 Information objects.- 4.6 Knowledge objects.- 4.7 Algebra of objects.- 4.8 Inheritance.- 4.9 Summary.- 5 Schemas.- 5.1 Introduction.- 5.2 i-schemas.- 5.3 r-schemas.- 5.4 From r-schemas to i-schemas.- 5.5 o-schemas.- 5.6 o-schemas as operators.- 5.7 t-schemas.- 5.8 Summary.- 6 Normalisation.- 6.1 Introduction.- 6.2 Meaning of normal.- 6.3 Normalisation of items.- 6.4 Normalisation of objects.- 6.5 Classical normal forms.- 6.6 Non-classical normal forms.- 6.7 Normal forms for groups.- 6.8 Summary.- 7 Specification.- 7.1 Introduction.- 7.2 Methodology structure.- 7.3 Item behaviour.- 7.4 r-schema construction.- 7.5 Application representation.- 7.6 Requirements identification.- 7.7 Summary.- 8 Analysis.- 8.1 Introduction.- 8.2 Conceptual model.- 8.3 Basis.- 8.4 Conceptual view.- 8.5 c-coupling map.- 8.6 Constraints.- 8.7 Summary.- 9 Function.- 9.1 Introduction.- 9.2 Functional model.- 9.3 Analysis of transactions.- 9.4 Functional view.- 9.5 f-coupling map.- 9.6 Constraints.- 9.7 System function problem.- 9.8 Summary.- 10 Layout.- 10.1 Introduction.- 10.2 Internal model.- 10.3 Operational requirements.- 10.4 Internal view.- 10.5 i-coupling map.- 10.6 Constraints.- 10.7System layout problem.- 10.8 Summary.- 11 Maintenance.- 11.1 Introduction.- 11.2 Methodology.- 11.3 Set constraints.- 11.4 Strategy for maintenance.- 11.5 Significance of normalisation.- 11.6 System constraints.- 11.7 Management of maintenance.- 11.8 Summary.- 12 Case study.- 12.1 Introduction.- 12.2 Requirements specification (1).- 12.3 Analysis (1).- 12.4 Function (1).- 12.5 Second prime r-schema.- 12.6 Layout.- 12.7 Maintenance.- References.
Inhaltsverzeichnis
1 Fundamentals.- 1.1 Introduction.- 1.2 Formalisms.- 1.2.1 Logic as a knowledge language.- 1.2.2 Logic as a programming language.- 1.2.3 Logic as a database language.- 1.2.4 ?-calculus.- 1.3 Data, information and knowledge.- 1.3.1 Associations.- 1.3.2 Data things.- 1.3.3 Information things.- 1.3.4 Knowledge things.- 1.4 Knowledge-based systems.- 1.4.1 Design.- 1.4.2 Implementation.- 1.4.3 Maintenance.- 1.5 Summary.- 2 Non-unified design.- 2.1 Introduction.- 2.2 Non-unified methodology.- 2.3 Non-unified representation.- 2.3.1 Data and information representation.- 2.3.2 Knowledge representation.- 2.4 Classification.- 2.5 Representation.- 2.6 Specification.- 2.6.1 Functional model.- 2.6.2 Internal model.- 2.7 Summary.- 3 Items.- 3.1 Introduction.- 3.2 Unified representation.- 3.3 Item structure.- 3.4 Data items.- 3.5 Information items.- 3.6 Knowledge items.- 3.7 Algebra of items.- 3.8 System items.- 3.9 Summary.- 4 Objects.- 4.1 Introduction.- 4.2 Limitations of items.- 4.3 Object structure.- 4.4 Data objects.- 4.5 Information objects.- 4.5.1 Further examples.- 4.6 Knowledge objects.- 4.6.1 Further examples.- 4.7 Algebra of objects.- 4.7.1 Object composition.- 4.7.2 Object join.- 4.8 Inheritance.- 4.9 Summary.- 5 Schemas.- 5.1 Introduction.- 5.2 i-schemas.- 5.3 r-schemas.- 5.4 From r-schemas to i-schemas.- 5.5 o-schemas.- 5.6 o-schemas as operators.- 5.7 t-schemas.- 5.8 Summary.- 6 Normalisation.- 6.1 Introduction.- 6.2 Meaning of normal.- 6.3 Normalisation of items.- 6.4 Normalisation of objects.- 6.5 Classical normal forms.- 6.5.1 First classical normal form.- 6.5.2 Second classical normal form.- 6.5.3 Third classical normal form.- 6.5.4 Boyce-Codd classical normal form.- 6.5.5 Fourth and fifth classical normal forms.- 6.5.6 Summary of classical normal forms.- 6.6 Non-classical normal forms.- 6.7 Normal forms for groups.- 6.8 Summary.- 7 Specification.- 7.1 Introduction.- 7.2 Methodology structure.- 7.3 Item behaviour.- 7.4 r-schema construction.- 7.5 Application representation.- 7.5.1 Context diagram.- 7.5.2 Differentiation.- 7.5.3 Decomposition.- 7.6 Requirements identification.- 7.6.1 Prime scoping.- 7.6.2 Re-use.- 7.6.3 Feasibility.- 7.6.4 Classification.- 7.6.5 Volatility.- 7.7 Summary.- 8 Analysis.- 8.1 Introduction.- 8.2 Conceptual model.- 8.3 Basis.- 8.3.1 Data item identification.- 8.3.2 i-schema construction.- 8.3.3 Removal of equivalences.- 8.3.4 Identification of sub-types.- 8.3.5 Data normalisation.- 8.4 Conceptual view.- 8.4.1 Object identification.- 8.4.2 Object library.- 8.4.3 Removal of equivalent objects.- 8.4.4 Refining object functionality.- 8.4.5 Removal of labels.- 8.4.6 Reduction of sub-items.- 8.4.7 Mixed-type decomposition.- 8.4.8 Information normalisation.- 8.5 c-coupling map.- 8.5.1 Component relationships.- 8.5.2 Equivalence relationships.- 8.5.3 Sub-item relationships.- 8.5.4 Duplicate relationships.- 8.6 Constraints.- 8.6.1 Individual constraints.- 8.6.2 Model constraints.- 8.7 Summary.- 9 Function.- 9.1 Introduction.- 9.2 Functional model.- 9.3 Analysis of transactions.- 9.3.1 t-schema construction.- 9.3.2 Transaction linkage.- 9.4 Functional view.- 9.4.1 Identification of transaction items.- 9.4.2 Identification of input items.- 9.4.3 Intermediate item selection.- 9.4.4 Knowledge normalisation.- 9.5 f-coupling map.- 9.6 Constraints.- 9.7 System function problem.- 9.7.1 Problem complexity.- 9.7.2 Complexity measures.- 9.7.3 Sub-optimal item selection.- 9.8 Summary.- 10 Layout.- 10.1 Introduction.- 10.2 Internal model.- 10.3 Operational requirements.- 10.4 Internal view.- 10.5 i-coupling map.- 10.6 Constraints.- 10.7 System layout problem.- 10.7.1 Calculation of minimal storage.- 10.7.2 Problem complexity.- 10.7.3 Sub-optimal storage layout.- 10.8 Summary.- 11 Maintenance.- 11.1 Introduction.- 11.2 Methodology.- 11.3 Set constraints.- 11.4 Strategy for maintenance.- 11.4.1 Alterations.- 11.4.2 Examinations.- 11.5 Significance of normalisation.- 11.6 System constraints.- 11.7 Management of maintenance.- 11.8 Summary.- 12 Case study.- 12.1 Introduction.- 12.2 Requirements specification (1).- 12.2.1 Context diagram.- 12.2.2 Differentiation.- 12.2.3 Decomposition.- 12.2.4 Requirements identification.- 12.3 Analysis (1).- 12.4 Function (1).- 12.5 Second prime r-schema.- 12.5.1 Requirements specification (2).- 12.5.2 Analysis (2).- 12.5.3 Function (2).- 12.6 Layout.- 12.7 Maintenance.- References.
Klappentext
This monograph describes a methodology for the design of knowledge-based systems. A knowledge-based system contains knowledge as well as information and data. The information and data in such a system can be modelled and imple mented as a database. The knowledge in such a system can be implemented either in a programming language or in an expert systems shell. This methodology has two distinguishing features. First, it is "unified". A unified methodology repre sents the data, information and knowledge in a homogeneous manner, as well as the relationships between them. Second, the methodology builds a maintenance mechanism into the design. In knowledge engineering terms, the representation used by this methodology to model knowledge bases applies equally to databases. In database terms, the representation used by this methodology to model databases applies equally to the database rules. The unified methodology unifies the design of the "knowledge base compo nent" and the "database component". "Unification" is achieved in five senses.
A systematic and detailed presentation of a design methodology for knowledge-based systems
Data, information, and knowledge are integrated in a unified methodology
The methodology builds a maintenance mechanism into the design
