Semantics Computation: Towards Identifying Answers from Problem Expressions

Abstract

Multiple semantics may be bundled with a concept(CPT) or an expression composed of concepts. We extend an investigation on fundamental semantics from concepts of type (TYPE) and instance (INS) to reveal relationships of expressions and semantics on problem expressions vs. answers. Core semantics of unlimited and completeness are identified as classification characteristics for clarifying and formalizing semantics of expressions towards bridging the understanding of the integration of semantics of problem expressions and answers. An approach of semantic computation which distinguishes from current conceptual modeling and problem solving is proposed with demonstrative cases. The framework of the approach is presented from core concepts, knowledge management and problem solving perspectives.