Implementing Agent-Based Systems via Computability Logic CL2
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).
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Towards Distributed Logic Programming based on Computability Logic
{\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 program…
Probabilistic Logic Gate in Asynchronous Game of Life with Critical Property
Metaheuristic and self-organizing criticality (SOC) could contribute to robust computation under perturbed environments. Implementing a logic gate in a computing system in a critical state is one of the intriguing ways t…
Accomplishable Tasks in Knowledge Representation
Knowledge Representation (KR) is traditionally based on the logic of facts, expressed in boolean logic. However, facts about an agent can also be seen as a set of accomplished tasks by the agent. This paper proposes a ne…
Extending and Automating Basic Probability Theory with Propositional Computability Logic
Classical probability theory is formulated using sets. In this paper, we extend classical probability theory with propositional computability logic. Unlike other formalisms, computability logic is built on the notion of …
On the Computability of Solomonoff Induction and Knowledge-Seeking
Solomonoff induction is held as a gold standard for learning, but it is known to be incomputable. We quantify its incomputability by placing various flavors of Solomonoff's prior M in the arithmetical hierarchy. We also …
reinforcement-learningReinforcement LearningReinforcement Learning (RL)