Based on the definition of a logic structure feature to relate logically functional requirements to geometric representation independent upon detailed geometric representation, this paper presents an idea of logical s...Based on the definition of a logic structure feature to relate logically functional requirements to geometric representation independent upon detailed geometric representation, this paper presents an idea of logical structure modeling for computer aided conceptual design and makes attempt to establish a representation formalism of logic structure modeling. The definition and representation of logical structure feature are given and an assembly module definition for supporting top down conceptual design is also proposed. The proposed scheme contributes to several aspects of conceptual design research, especially to provide elementarily a formal methodology for computer aided conceptual design system development and operation.展开更多
Formal concept analysis （FCA） is a discipline that studied the hierarchical structures induced by a binary relation between a pair of sets, and applies in data analysis, information retrieval, knowledge discovery, e...Formal concept analysis （FCA） is a discipline that studied the hierarchical structures induced by a binary relation between a pair of sets, and applies in data analysis, information retrieval, knowledge discovery, etc. In this paper, it is shown that a formal context T is equivalent to a set-valued mapping S ： G → P（М）, and formal concepts could be defined in the set-valued mapping S. It is known that the topology and set-valued mapping are linked. Hence, the advantage of this paper is that the conclusion make us to construct formal concept lattice based on the topology.展开更多
The current extended fuzzy description logics lack reasoning algorithms with TBoxes. The problem of the satisfiability of the extended fuzzy description logic EFALC cut concepts w. r. t. TBoxes is proposed, and a reas...The current extended fuzzy description logics lack reasoning algorithms with TBoxes. The problem of the satisfiability of the extended fuzzy description logic EFALC cut concepts w. r. t. TBoxes is proposed, and a reasoning algorithm is given. This algorithm is designed in the style of tableau algorithms, which is usually used in classical description logics. The transformation rules and the process of this algorithm is described and optimized with three main techniques： recursive procedure call, branch cutting and introducing sets of mesne results. The optimized algorithm is proved sound, complete and with an EXPTime complexity, and the satisfiability problem is EXPTime-complete.展开更多
文摘Based on the definition of a logic structure feature to relate logically functional requirements to geometric representation independent upon detailed geometric representation, this paper presents an idea of logical structure modeling for computer aided conceptual design and makes attempt to establish a representation formalism of logic structure modeling. The definition and representation of logical structure feature are given and an assembly module definition for supporting top down conceptual design is also proposed. The proposed scheme contributes to several aspects of conceptual design research, especially to provide elementarily a formal methodology for computer aided conceptual design system development and operation.
基金the Young Foundation of Sichuan Province(06ZQ026-037) the Education Department Foundation of Sichuan Province(2005A1212006A084)
文摘Formal concept analysis （FCA） is a discipline that studied the hierarchical structures induced by a binary relation between a pair of sets, and applies in data analysis, information retrieval, knowledge discovery, etc. In this paper, it is shown that a formal context T is equivalent to a set-valued mapping S ： G → P（М）, and formal concepts could be defined in the set-valued mapping S. It is known that the topology and set-valued mapping are linked. Hence, the advantage of this paper is that the conclusion make us to construct formal concept lattice based on the topology.
基金The National Natural Science Foundation of China(No60403016),the Weaponry Equipment Foundation of PLA Equip-ment Ministry (No51406020105JB8103)
文摘The current extended fuzzy description logics lack reasoning algorithms with TBoxes. The problem of the satisfiability of the extended fuzzy description logic EFALC cut concepts w. r. t. TBoxes is proposed, and a reasoning algorithm is given. This algorithm is designed in the style of tableau algorithms, which is usually used in classical description logics. The transformation rules and the process of this algorithm is described and optimized with three main techniques： recursive procedure call, branch cutting and introducing sets of mesne results. The optimized algorithm is proved sound, complete and with an EXPTime complexity, and the satisfiability problem is EXPTime-complete.
