Knowing and/or Believing a Think: Deriving Knowledge Using RDF CFL
| Autor: | Petr Raunigr, Martin Žáček, Alena Lukasová |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
First-order predicate
business.industry Programming language Knowledge level Inference computer.file_format computer.software_genre First-order logic TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Graph (abstract data type) Artificial intelligence Conjunctive normal form RDF business computer Mathematics |
| Zdroj: | Lecture Notes in Electrical Engineering ISBN: 9783030215064 |
| DOI: | 10.1007/978-3-030-21507-1_10 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|