154 citations
- Czech Academy of Sciences, Institute of MathematicsCZ2 papers
- Dong A University2 papers
- Florida State UniversityUS2 papers
- Kyungsung UniversityKR2 papers
- University of TorontoCA2 papers
- Czech Academy of SciencesCZ1 paper
- Environmental and Occupational Health Sciences InstituteUS1 paper
- Institut de Mathématiques de ToulonFR1 paper
- Kyungil UniversityKR1 paper
- Kyungpook National UniversityKR1 paper
- National Institute for Mathematical SciencesKR1 paper
- Rutgers, The State University of New JerseyUS1 paper
Showing 2019Show all
2 papers · 1 filter
cs.AI2019
Extending and Automating Basic Probability Theory with Propositional Computability Logic
Keehang Kwon
Classical probability theory is formulated using sets. In this paper, we extend classical probability theory with propositional computability logic. Unlike other formalisms, comput…
cs.AI2019★ 1 cited
Towards Distributed Logic Programming based on Computability Logic
Keehang Kwon
{\em Computability logic} (CoL) is a powerful computational model which views computational problems as games played by a machine and its environment. In this paper, we show that C…