Timed Concurrent Language for Argumentation: an Interleaving Approach
summary
A timed concurrent programming language models agents that read and write a shared timed Abstract Argumentation Framework as their knowledge base; expressions have explicit timeouts, every computation step consumes one time unit, and time elapses via separate omega/tau actions (omega = single-processor steps, tau = parallel time ticks). The implementation includes a web interface and a running oyster-farming dialogue example that constructs and updates argument graphs step-by-step, showing the model executes and visualizes timed additions, removals and acceptability checks.
AI-written summary · about
chapters (11)
- 0:00Introduction
- 2:10Agenda
- 2:45Argumentation Framework
- 6:47Language
- 8:57Interleaving Approach
- 10:47Operation
- 16:12Example
- 20:29Web Interface
- 21:24Conclusion
- 22:00Future work
- 24:25Questions
related talks
30mMonadic interpreters for concurrent memory models: Executable semantics of a concurrent(…)
01h 01mThe Future of Concurrency and Parallelism
39mConcurrent Languages are Functional
54mReasoning about Progress of Concurrent Objects
19mScenario-based Proofs for Concurrent Objects
24mTaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Pr
24mA Concurrent Program Logic with a Future and History
21mContextual Refinement of Higher-Order Concurrent Probabilistic Programs