Towards Distributed Logic Programming based on Computability Logic

Abstract

{\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 CoL naturally supports multiagent programming models with distributed control. To be specific, we discuss a distributed logic programming model based on CoL (CL1 to be exact), which we call CL1^Ω. The key feature of this model is that it supports $dynamic/evolving$ knowledgebase of an agent. This model turns out to be a promising approach to reaching both general AI and future computing model.

8 pages. We substantially refined the execution model of a machine

References in corpus (2)

• Propositional computability logic I
• On the system CL12 of computability logic

Cited by in corpus (1)

• Agent-Based Proof Design via Lemma Flow Diagram