Efficient Implementation of Semantic Relations in Lexical Databases

In this paper we develop a formalization of semantic relations that facilitates efficient implementations of relations in lexical databases or knowledge representation systems using bases. The formalization of relations is based on a modeling of hierarchical relations in Formal Concept Analysis. Further, relations are analyzed according to Relational Concept Analysis, which allows a representation of semantic relations consisting of relational components and quantificational tags. This representation utilizes mathematical properties of semantic relations. The quantificational tags imply inheritance rules among semantic relations that can be used to check the consistency of relations and to reduce the redundancy in implementations by storing only the basis elements of semantic relations. The research presented in this paper is an example of an application of Relational Concept Analysis to lexical databases and knowledge representation systems (cf. Priss 1996) which is part of a larger framework of research on natural language analysis and formalization.     

A risk management ontology for Quality-by-Design based on a new development approach according GAMP 5.0

A new approach to the development of a risk management ontology is presented. This method meets the requirements of a pharmaceutical Quality by Design approach, good manufacturing practice and good automated manufacturing practice. The need for a risk management ontology for a pharmaceutical environment is demonstrated, and the term “ontology” is generally defined and described with regard to the knowledge domain of quality risk management.To fulfill software development requirements defined by good manufacturing practice regulations and good automated manufacturing practice 5.0 for the novel development approach, we used a V-model as a process model, which is discussed in detail. The development steps for the new risk management ontology, such as requirement specification, conceptualization, formalization, implementation and validation approach, are elaborated.     

A Full Formalization of SLD-Resolution in the Calculus of Inductive Constructions

This paper presents a full formalization of the semantics of definite programs, in the calculus of inductive constructions. First, we describe a formalization of the proof of first-order terms unification: this proof is obtained from a similar proof dealing with quasi-terms, thus showing how to relate an inductive set with a subset defined by a predicate. Then, SLD-resolution is explicitely defined: the renaming process used in SLD-derivations is made explicit, thus introducing complications, usually overlooked, during the proofs of classical results. Last, switching and lifting lemmas and soundness and completeness theorems are formalized. For this, we present two lemmas, usually omitted, which are needed. This development also contains a formalization of basic results on operators and their fixpoints in a general setting. All the proofs of the results, presented here, have been checked with the proof assistant Coq.     

Meta-relation and ontology closure in Conceptual Structure Theory

This paper presents an enhanced ontology formalization, combining previous work in Conceptual Structure Theory and Order-Sorted Logic. Most existing ontology formalisms place greater importance on concept types, but in this paper we focus on relation types, which are in essence predicates on concept types. We formalize the notion of ‘predicate of predicates’ as meta-relation type and introduce the new hierarchy of meta-relation types as part of the ontology definition. The new notion of closure of a relation or meta-relation type is presented as a means to complete that relation or meta-relation type by transferring extra arguments and properties from other related types. The end result is an expanded ontology, called the closure of the original ontology, on which automated inference could be more easily performed. Our proposal could be viewed as a novel and improved ontology formalization within Conceptual Structure Theory and a contribution to knowledge representation and formal reasoning (e.g., to build a query-answering system for legal knowledge).     

Multi criteria analyses for managing motorway company facilities: The decision support system SINERGIE

Improvements to the decision-making process in the areas of preventive maintenance and facility repairs for a range of infrastructure include maintenance, upgrading and retrofitting operations. Depending on the available information concerning the condition of the facilities, specific types of projects can be programmed. Assigning a priority of action to a given project necessitates an evaluation process that introduces several criteria at various functional levels. This multi criteria (MC) evaluation is modelled as the aggregation of partial scores attributed to a project with regards to (w.r.t.) a given set of criteria. The scores are expressed over a finite scale which can cause some troubles when no attention is paid to the aggregation procedure. This paper deals with the consistency of the evaluation process, where scores are expressed as labels by experts (over finite discrete scales), whereas the aggregation model is supposed to deal with numerical values and cardinal scales. This is a curious but common apparent paradox in MC evaluation when engineering contexts are concerned. Adequate mathematical tools are provided to tackle the related problems. A robustness analysis of the evaluation process concludes the mathematical part of the paper.The mathematical choices regarding our information processing chain meet the ESCOTA motorway company requirements. Indeed, ESCOTA aims at the formalization and improvement of the decisional process for preventive maintenance of its assets in a MC framework. According to available pieces of knowledge on the infrastructure condition, projects are to be evaluated w.r.t. technical but also to conformity, security and financial criteria for planning purposes. ESCOTA’s engineers are used to manipulate symbolic labels but might convert them into more or less arbitrary numerical values when necessary without the necessary care. The SINERGIE decision support system has been developed for ESCOTA to implement a logically sound information processing methodology. The SINERGIE man–machine interfaces illustrate the way by which the mathematical concepts described in this paper are used in terms of infrastructure management activities. The various information processing phases laid out in SINERGIE have been illustrated for road applications.     

基于SHOIN（D）的UML类图形式化方法

UML模型一致性自动检测的主要任务是解决形式化问题。描述逻辑是一阶谓词逻辑的可判定子集,具备强大的知识表示和推理功能。针对UML模型形式化问题,提出基于描述逻辑的形式化方法,分析UML类图各模型元素与描述逻辑SHOIN（D）的对应关系,提出UML类图的SHOIN（D）形式化方法,给出UML类图转换为SHOIN（D）知识库的正确性证明。     

A product lifecycle management methodology for supporting knowledge reuse in the consumer packaged goods domain

The present globalized market is forcing many companies to invest in new strategies and tools for supporting knowledge management. This aspect is becoming a key factor in the industrial competitiveness for the presence of extended enterprises that normally deal with huge data exchange and share processes. This scenario is due to the presence of partners geographically distributed over the entire globe, that participate in different steps of the product lifecycle (product development, maintenance and recycling). At present, Product Lifecycle Management (PLM) seems to be the appropriate solution to support enterprises in this complex scenario, even though a real standardized approach for the implementation of knowledge sharing and management tools does not exist today. For this reason, the aim of this paper is to develop a knowledge management operative methodology able to support the formalization and the reuse of the enterprise expertise acquired while working on previous products. By focusing on consumer packaged goods enterprises and on the concept development phase (which is one of the most knowledge intensive phases of the whole product lifecycle), this research work has developed a new systematic methodology to support knowledge codification and knowledge management operations. The new methodology integrates the Quality Function Deployment (QFD) and the Teoriya Resheniya Izobreatatelskikh Zadatch (TRIZ). Also, a case study on the problem of waste disposal has been conducted to validate the proposed methodology.     

Formalization of Fixed-Point Arithmetic in HOL

This paper addresses the formalization in higher-order logic of fixed-point arithmetic. We encoded the fixed-point number system and specified the different quantization modes in fixed-point arithmetic such as the directed and even quantization modes. We also considered the formalization of exceptions detection and their handling like overflow and invalid operation. An error analysis is then performed to check the correctness of the quantized result after carrying out basic arithmetic operations, such as addition, subtraction, multiplication and division against their mathematical counterparts. Finally, we showed by an example how this formalization can be used to enable the verification of the transition from floating-point to fixed-point algorithmic level in the signal processing design flow.     

面向领域知识库的"五化"本体创建

利用本体论的方法来实现形式化、可共享领域知识库,提出了基于本体的领域知识库的架构及"五化"构建方法.解决了领域知识库的知识共享、互操作和一致性检查等问题.     

Modelling and engineering the requirements engineering process: An overview of the NATURE approach

This paper presents an overview of the process theory developed in the context of the ESPRIT project NATURE.¹ This theory proposes means for modelling and engineering the requirements engineering (RE) process. The key element of this theory is a situation-and decision-based process meta-model independent of any RE methodology. The process meta-model acts as a shell for defining process models by instantiation. An enactment mechanism implemented in a tool environment has been defined. It allows execution of process models and provides effective guidance to the requirements engineer. Construction of process models is also supported based on generic method knowledge chunks. The formalization of our approach is based on a free algebra.     

基于柔性总线的嵌入式系统防火墙研究

给出了一种嵌入式系统总线防火墙模型，在系统底层实现入侵免疫功能。通过引入嵌入式系统柔性总线并对其进行形式化数学描述，实现具有通用性的底层架构，在此基础上采用正向规则映射思想建立防火墙规则。实验表明，该防火墙具有良好的可移植性和高入侵识别率。     

Managing architectural decision models with dependency relations, integrity constraints, and production rules

Software architects consider capturing and sharing architectural decisions increasingly important; many tacit dependencies exist in this architectural knowledge. Architectural decision modeling makes these dependencies explicit and serves as a foundation for knowledge management tools. In practice, however, text templates and informal rich pictures rather than models are used to capture the knowledge; a formal definition of model entities and their relations is missing in the current state of the art. In this paper, we propose such a formal definition of architectural decision models as directed acyclic graphs with several types of nodes and edges. In our models, architectural decision topic groups, issues, alternatives, and outcomes form trees of nodes connected by edges expressing containment and refinement, decomposition, and triggers dependencies, as well as logical relations such as (in)compatibility of alternatives. The formalization can be used to verify integrity constraints and to organize the decision making process; production rules and dependency patterns can be defined. A reusable architectural decision model supporting service-oriented architecture design demonstrates how we use these concepts. We also present tool support and give a quantitative evaluation.     

Behavioral specification of reactive systems using stream-based I/O tables

A core problem in formal methods is the transition from informal requirements to formal specifications. Especially when specifying the behavior of reactive systems, many formalisms require the user to either understand a complex mathematical theory and notation or to derive details not given in the requirements, such as the state space of the problem. For many approaches also a consistent set of requirements is needed, which enforces to resolve requirements conflicts prior to formalization. This paper describes a specification technique, where not states but signal patterns are the main elements. The notation is based on tables of regular expressions and supports a piece-wise formalization of potentially inconsistent requirements. Many properties, such as input completeness and consistency, can be checked automatically for these specifications. The detection and resolution of conflicts can be performed within our framework after formalization. Besides the formal foundation of our approach, this paper presents prototypical tool support and results from an industrial case study.     

Distributed Computation Multi-agent System

This article addresses a formal model of a distributed computation multi-agent system. This model has evolved from the experimental research on using multi-agent systems as a ground for developing fuzzy cognitive maps. The main paper contribution is a distributed computation multi-agent system definition and mathematical formalization based on automata theory. This mathematical formalization is tested by developing distributed computation multi-agent systems for fuzzy cognitive maps and artificial neural networks – two typical distributed computation systems. Fuzzy cognitive maps are distributed computation systems used for qualitative modeling and behavior simulation, while artificial neural networks are used for modeling and simulating complex systems by creating a non-linear statistical data model. An artificial neural network encapsulates in its structure data patterns that are hidden in the data used to create the network. Both of these systems are well suited for formal model testing. We have used evolutionary incremental development as an agent design method which has shown to be a good approach to develop multi-agent systems according to the formal model of a distributed computation multi-agent system.     

Causal design knowledge: Alternative representation method for product development knowledge management

This paper presents a mathematical comparison of procedural knowledge and causal knowledge, and discusses the potential roles and feasibility of causal knowledge across product development knowledge management. Since reuse of knowledge is so important in product development, various knowledge management approaches have been introduced. Most of the product design knowledge is represented by procedural knowledge, which unfortunately requires cumbersome processes to define, and is typically inadequate for representing the kind of knowledge generated during the product development process. A causal knowledge representation, however, can help us to overcome this limitation and is an alternative formalism for representing product design knowledge. In this paper we compare the procedural and causal knowledge representations. We present the mathematical definitions of two knowledge paradigms, then mathematically describe the relationship between the two. Both knowledge paradigms are then compared based on the perspective of knowledge expression, decision alternative representation, reasoning capability, and knowledge cultivation. This paper concludes that causal knowledge representation is superior to procedural knowledge representation based on the four perspectives. Finally, the knowledge systems are modeled using Systems Modeling Language (SysML), and we present a case study that demonstrates the causal knowledge features using a realistic example from industry.     

General and specific formalization approach for a Balanced Scorecard: An expert system with application in health care

The Balanced Scorecard (BSC) presents the essentials of strategic and performance management in clear, straightforward manner which is also usable in health care. If a BSC for a clinical department is an agreement, the first question to consider is the method by which it can be ascertained whether a strategy has been accomplished. There are many different techniques like AHP (analytic hierarchy process) and fuzzy systems to calculate indices.However, how does a formalized mathematical groundwork looks like that integrates current approaches and is still general enough to incorporate future expert systems with applications?The purpose of this paper is the formalization of BSC evaluation by respecting current research. The formalized expert system was implemented in an information system for health care management.     

Proof Pearl: a Formal Proof of Higman��s Lemma in ACL2

Higman??s lemma is an important result in infinitary combinatorics, which has been formalized in several theorem provers. In this paper we present a formalization and proof of Higman??s Lemma in the ACL2 theorem prover. Our formalization is based on a proof by Murthy and Russell, where the key termination argument is justified by the multiset relation induced by a well-founded relation. To our knowledge, this is the first mechanization of this proof.     

A knowledge-based framework for complex, proactive and service-oriented e-negotiation systems

Advances in information technology and knowledge management change the way that e-negotiations, which constitute an important aspect of worldwide e-trading, can be structured and represented. In this paper, a novel approach that focuses on knowledge modeling, formalization, representation and management in the domain of e-negotiation is described. The proposed approach exploits Ontologies, Service Oriented Architectures, Semantic Web Services, software agent platforms, and Knowledge-Bases to construct a framework that favors dynamically adapted negotiation protocols, negotiation process visualization and management, modeling and preference elicitation of the negotiated object and automatic deployment of negotiation interfaces. Negotiation process, protocol and strategy are examined, and a hybrid approach that integrates rules and workflow diagrams to describe and represent them is introduced.     

炼油生产调度专家系统的应用研究

基于知识的优化设计应用于炼油化工厂,采用专家系统技术将生产中成功的经验和领域专家的知识组织起来,协调并参与数学规划建模过程,优化编排调度作业计划,并进行优化控制和管理.文章结合大型炼油厂的生产实际,探索智能化的管控一体化的新模式.     

The Role of the Mizar Mathematical Library for Interactive Proof Development in Mizar

The Mizar system is one of the pioneering systems aimed at supporting mathematical proof development on a computer that have laid the groundwork for and eventually have evolved into modern interactive proof assistants. We claim that an important milestone in the development of these systems was the creation of organized libraries accumulating all previously available formalized knowledge in such a way that new works could effectively re-use all previously collected notions. In the case of Mizar, the turning point of its development was the decision to start building the Mizar Mathematical Library as a centrally-managed knowledge base maintained together with the formalization language and the verification system. In this paper we show the process of forming this library, the evolution of its design principles, and also present some data showing its current use with the modern version of the Mizar proof checker, but also as a rich corpus of semantically linked mathematical data in various areas including web-based and natural language proof presentation, maths education, and machine learning based automated theorem proving.