难听的声音
发表于 2025-3-30 10:13:52
http://reply.papertrans.cn/24/2351/235056/235056_51.png
消息灵通
发表于 2025-3-30 14:14:22
MULTIKAT, a tool for comparing knowledge of multiple experts,dge of several experts both automatically and cooperatively, when such knowledge is represented through Sowa‘s conceptual graph formalism. MULTIKAT implements an algorithm of comparison and integration of several supports, and an algorithm of comparison and integration of multiple conceptual graphs
Explosive
发表于 2025-3-30 18:23:34
Towards correspondences between Conceptual Graphs and Description Logics,ovided with type definitions (which we call . and the . standard Description Logic. We prove an equivalence between a subset of . and a subset of .. Based on this equivalence, we suggest extensions of both formalisms while preserving the equivalence. In particular, regarding to standard Description
推延
发表于 2025-3-31 00:34:36
Piece resolution: Towards larger perspectives,order logic interpretation, inferences can be proven by classical theorem provers. Nevertheless, they do not use the notion of piece, which is a graph notion. So we define piece resolution over a class of first-order logical formulae: the .. An implementation of this procedure has been done, and we
吞下
发表于 2025-3-31 02:02:23
http://reply.papertrans.cn/24/2351/235056/235056_55.png
不爱防注射
发表于 2025-3-31 05:02:30
http://reply.papertrans.cn/24/2351/235056/235056_56.png
小母马
发表于 2025-3-31 09:17:42
Simple concept graphs: A logic approach,t graphs are introduced as syntactical constructs, and their semantics is defined based on relational contexts. For this contextual logic, a sound and complete system of inference rules is presented and a standard graph is introduced that entails all concept graphs being valid in a given relational
faucet
发表于 2025-3-31 13:27:20
Two FOL semantics for simple and nested conceptual graphs,his semantics. M. Chein and M.L. Mugnier have proved the completeness result, with a restriction on the form of the target graph of the projection. I propose here another FOL semantics for Simple Conceptual Graphs corresponding to a slightly different interpretation of a Conceptual Graph. Soundness
jealousy
发表于 2025-3-31 17:39:05
Peircean graphs for the modal logic S5, modal logics. In the present paper, we put forward a system of Peircean graphs for reasoning within the modal logic S5. It is proved that our graph-based formulation of S5 is indeed equivalent to the traditional Hilbert-Frege formulation. Our choice of proof-rules for the system is proof-theoretica
残忍
发表于 2025-3-31 23:22:58
https://doi.org/10.1007/BFb0054900Artificial Intelligence; Evolution; Extension; Knowledge Engineering; Mathematical Logics; Powerset; agent