Abstract: From the web discussion on a difference between knowing and believing, we have chosen in this paper the statements fulfilling enough our seeing the topic, corresponding to our knowledge level of cognitive science. The aim of paper shows one of the capabilities of our Resource Description Framework Clausal Form Logic (RDF CFL) graph language using as an example a well- known Castaněda’s puzzle. RDF CFL is an appropriate tool that contains a package of inference methods working especially in closed-worlds that have been developed in the clausal form of first order predicate logics.
DOI: *As the DOI is a unique identifier, it is already available in the pdf version. **The DOI link will be activated in the first midst of January 2026.
Martin Žáček, Alena Lukasová, "Knowing and/or Believing a Think: Deriving Knowledge Using RDF CFL," WSEAS Transactions on Computers, vol. 14, pp. 202-207, 2017, DOI:
Martin Žáček, Alena Lukasová. Knowing and/or Believing a Think: Deriving Knowledge Using RDF CFL.
WSEAS Transactions on Computers. 2017;14:202-207.