Pith. Sign in

RECORD

Implementing Agent-Based Systems via Computability Logic CL2

Artificial Intelligence · Submitted 18 Oct 2020

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim In this paper, we show that CoL naturally supports multi-agent programming models where resources (coffee for example) are involved.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2010.08925 (version 3)
Pith IDKVJYUR3E, Pith's permanent record of this paper and its review
CitationKeehang Kwon. "Implementing Agent-Based Systems via Computability Logic CL2." arXiv:2010.08925 (2020). https://pith.science/paper/KVJYUR3E
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 2,841 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.06 · human participants 0.06 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.03 · compares with prior results 0.05 · mentions code or data availability 0.04.

The abstract, sentence by sentence

arXiv listing abstract v3. Results and the main claim are underlined; .

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).

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Computability logic(CoL) is a powerful computational model. background 1.00 0.07 0.03 asserted 1.00
s1 In this paper, we show that CoL naturally supports multi-agent programming models where resources (coffee for example) are involved. contribution 0.93 0.88 0.72 asserted 1.00
s2 To be specific, we discuss an implementation of the Starbucks based on CoL (CL2 to be exact). contribution 0.94 0.91 0.17 asserted 0.99

What kind of paper the classifier reports this is: method or tool 0.94 · evidence from simulation or computation 0.46.

What was examined, and what was not

sources read
  • arXiv listing abstract v3
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original 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).

Human review

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.