作者: Paul Leemans , Jan Treur , Mark Willems
DOI: 10.1016/S0169-023X(01)00045-3
关键词: Computer science 、 Artificial intelligence 、 Semantics (computer science) 、 Soundness 、 Forcing (recursion theory) 、 Natural language processing 、 Data mining 、 Knowledge representation and reasoning 、 Structure (mathematical logic) 、 Relation (database) 、 Representation (systemics) 、 Completeness (logic)
摘要: The usual approaches to verification of knowledge in the literature have a rather practical nature, and are sometimes ad hoc depending on syntactical structure particular representation language definitions properties that tested. In this paper, more principled investigation provides well-defined semantical basis, independent any representation, various can be tested, their logical relationships. Central unifying framework is notion domain description forcing relation used as standard for inferences. Properties covered include consistency, three variants soundness, completeness, empirically foundedness, well-informedness.