Implementing Agent-Based Systems via Computability Logic CL2

Abstract

Computability logic(CoL) is a powerful computational model. In this paper, we show that CoL naturally supports multi-agent programming models where resources (coffee for example) are involved. To be specific, we discuss an implementation of the Starbucks based on CoL (CL2 to be exact).

12 pages. This is a revised version and some errors are fixed. arXiv admin note: substantial text overlap with arXiv:1909.07036

References in corpus (2)

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