AUTHORS: Martin Žáček, Alena Lukasová
Download as PDF
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 closedworlds that have been developed in the clausal form of first order predicate logics.
KEYWORDS: Resource Desription Framework, RDF, logic puzzle, first order logic, CFL, knowing, believing, deriving
REFERENCES:
[1] Shapiro, Stuart C. & Rapaport, William J. (1992). The SNePS Family. Computers and Mathematics with Applications 23:243-275.
[2] Shapiro, S.C., Rapaport, W.J.: Models and Minds. Knowledge Representation for NaturalLanguage Competence. Philosophy and AI: Essays at the Interface, 215-259. 1991.
[3] Manisha Kumar: Difference Between Knowing and Believing. In DifferenceBetween.net, January 10, 2010. http://www.differencebetween.net/miscellaneo us/difference-between-knowing-and-believing/
[4] Castaněda, H.N.: Philosophy as a Scienceand as a Worldview. In A.Cohen and M. Dascal (eds), The Institution of Philosophy (Peru, IL: Open Court), 1989.
[5] Lukasová, A., Vajgl, M., Žáček, M.: Knowledge Represented Using RDF Semantic Net-work In The Concept of Semantic Web. Proceedings of the International Conference Of Numerical Analysis And Applied Mathematics 2015 (ICNAAM-2015). USA: AMER INST PHYSICS, 2016.
[6] Lukasová, A., Žáček, M., Vajgl, M.: Reasoning in Graph-based Clausal Form Logic. IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 1, No 3, 2012, pp. 37-43. ISSN (Online) 1694-0814.
[7] Lukasová, A., Žáček, M. a Vajgl, M. Carstairsmccarthy?s morphological rules of english language in RDFCFL graphs. In: 1st International Conference on Applied Physics, System Science and Computers, APSAC 2016: Lecture Notes in Electrical Engineering 2016- 09-28 Dubrovnik; Croatia. Springer Verlag, 2018. s. 169-174. ISBN 978-331953933-1.
[8] Lukasová, A., Žáček, M. a Vajgl, M. Building a Non-monotonic Default Theory in GCFL Graph-Version of RDF. In: Modern Trends and Techniques in Computer Science, AISC 285. Switzerland: Springer International Publishing, 2014. Springer International Publishing, 2014. s. 455-466. ISBN 978-3-319-06740-7.
[9] Miarka, R. a Žáček, M. Knowledge patterns for conversion of sentences in natural language into RDF graph language. In: Proceedings of the Federated Conference on Computer Science and Information Systems. USA: IEEE Computer Society Press, 2011. IEEE Computer Society Press, 2011. s. 63-68. ISBN 978-1-4577-0041-5.
[10] Miarka, R. a Žáček, M. Knowledge patterns in RDF graph language for English sentences. In: Proceedings of the Federated Conference on Computer Science and Information Systems. USA: IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA, 2012. IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA, 2012. s. 109- 115. ISBN 978-83-60810-48-4.
[11] Miarka, R. a Žáček, M. Representation of Knowledge patterns in RDF(S). In: Proceedings of the 13th International Conference WWW/Internet 2014. Porto, Portugalsko: International Association for Development of the Information Society, 2014. International Association for Development of the Information Society, 2014. s. 147-154. ISBN 978-989-8533-24-1.
[12] Žáček, M., Lukasová, A., Miarka, R. Modeling knowledge base and derivation without pre-defined structure by Graph-based Clausal Form Logic. Proceedings of the 2013 International Conference on Advanced ICT and Education. France: Atlantis Press: AISR, 2013. s. 546-549. ISBN 978-90786-77-79-6.
[13] Žáček, M., Lukasová, A. English grammatical rules representation by a metalanguage based on RDF model and predicate clausal form. INFORMATION-An International Interdiscipli-nary Journal - ISSN 1343-4500, 2016.
