[
Lists Home |
Date Index |
Thread Index
]
A question I would have is if the operations that
Sowa/Majumdar post in the cited article for CGs
apply to analogical reasoning work on RDF.
http://www.jfsowa.com/pubs/analog.htm
Note that the authors begin by stating that:
"Logical and analogical reasoning are sometimes
viewed as mutually exclusive alternatives but
formal logic is actually a highly constrained and
stylized method of using analogies. Before any
subject can be formalized to the stage where logic
can be applied to it, analogies must be used to
derive an abstract representation from a mass of
irrelevant detail. After the formalization is
complete, every logical step -- of deduction,
induction, and abduction -- involved the application
of some version of analogy... The same operations
used to process analogies can be combined with
Peirce's rules of inference to support an inference
engine. Those operations, called the canonical formation
rules for conceptual graphs, are widely used in CG
systems for language understanding and scene
recognition as well as analogy finding and
theorem proving. The same algorithms used to optimize
analogy finding can be used to speed up all the
methods of reasoning based on the canonical formation
rules."
len
From: Thomas B. Passin [mailto:tpassin@comcast.net]
[Danny Ayers]
>
> Probably this particular example for a start. The Conceptual Graph model
> Sowa uses throughout his work isn't that far removed from the one
underlying
> RDF. In fact Tim Berners-Lee [1] and others have considered mappings.
I think it is a long reach to say that RDF is anywhere near close to CGs,
notwithstanding that you can draw a graph for each.
|
