Volition Elicitation: Operational Semantics for People and Their Machines

summary

Video file (mp4)

The gist

The gist The most prevalent distributed systems today include people and their personal machines (smartphones), and this paper defines volition-guarded GLP (vGLP) to elicit volitions from a person's

In short

The paper proposes a method to design user interfaces for grassroots platforms by eliciting human volitions directly from the person's head. It introduces Volition-Guarded GLP (vGLP), which extends logic programming to include questions that require a person's input. This allows AI to derive functional smartphone apps based on abstract specifications, enabling interactive and personalized system design.

Key concepts

Volition-Guarded Multiagent Atomic Transactions
This is an abstract language for systems where actions are driven by people's will, like making a payment or befriending someone. A transaction succeeds only if both the machine states and the personal desires (volitions) of all participating agents are met.
Volition-Guarded GLP (vGLP)
This is an extension of standard logic programming that incorporates 'volitional procedures.' These procedures pose interactive questions to a person, whose answers determine the next step in the program's execution. The goal is to make formal specifications interactive.
Communicating Volitional Agents (CVA)
CVA defines how volitional agents interact. In this context, a volition-guarded clause can only be executed if the person wills it, and once willed, that volition is fulfilled. This operational semantics ensures that the system correctly models human choice within the computation.

Terminology used across episodes

This episode discusses

The paper

Volition Elicitation: Operational Semantics for People and Their Machines · Read on arXiv

London School of Economics · Weizmann Institute of Science

The most prevalent distributed systems today include people and their personal machines (smartphones), and computations in them are driven by people's volitions. Volition-guarded multiagent atomic transactions were proposed as an abstract specification language for such systems, in which a transaction has a precondition on the machine states of its participants and is guarded by the volitions of some of them. Here we develop an abstraction cascade that derives smartphone apps from such specifications and prove it correct down to the base programming language, GLP. The cascade consists of: (1) communicating volitional agents (CVA), which implement every local volition-guarded specification with simple guards, correctly, and completely for its strongly fair runs, by two-phase commit coordinated by the initiating agent; (2) volition-guarded GLP (vGLP), an extension of GLP with volitional procedures, whose goals put an interactively-typed question to the person, into which that implementation compiles; and (3) GLP, which implements vGLP by eliciting the person's answers through the widgets of their interactive types, correctly, and completely for complete widgets. We demonstrate the approach on three grassroots platforms --- a social graph, a social network, and currencies: a compiler carries the social graph and the currencies down the cascade to GLP programs that run with scripted persons, and earlier programs of the three run as mini-apps of one smartphone app.

Transcript

Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.

Tom: Today's paper: "Volition Elicitation: Operational Semantics for People and Their Machines".

Jane: The gist The most prevalent distributed systems today include people and their personal machines (smartphones), and this paper defines volition-guarded GLP (vGLP) to elicit volitions from a person's head,

Tom: First, who's behind it and why it matters.

Title and authors: Jane: So, what exactly is this paper proposing as its core mechanism? What are they building to solve that manual UI problem?

Tom: They define something new called volition-guarded GLP, or vGLP. It extends the original GLP with these volition-guarded clauses <ref:2607.14138#pg3>. Think of a volition guard as a question, like (Xone=T1,..., Xi=Ti, Y1?,..., Yj?), where Xl are the writers and Yl? are the readers defining the context <ref:2607.14138#pg5>.

Lu: The operational semantics for vGLP are defined as an instance of Communicating Volitional Agents, or CVA <ref:2607.14138#pg5>. This means a volition-guarded clause can only reduce if the person wills that reduction and that will is fulfilled once it’s taken <ref:2607.14138#pg6>.

Meng: So, the core idea is making the machine's behavior conditional on the person's actual will, not just a command being sent to it <ref:2607.14138#pg3>. That sounds like a huge leap from standard programming where input just drives computation.

Jane: It does sound like it, and this leads into how they connect the formal language to what we actually see on a screen. How do you translate this abstract volition guard into something tangible?

Tom: They show that the UI is derived directly from these semantics <ref:2607.14138#pg6>. Specifically, a pending reduction determines the question posed and what answers are awaited, and it looks at sibling clauses where the person chooses <ref:2607.14138#pg6>.

Lalam: The manifest of a vGLP program assigns each volition-guarded clause a specific user interface construct based on its context, the writers of the guard, and buttons labeled by the ground term of its volition guard <ref:2607.14138#pg6>.

The paper's summary: Tom: So if we boil it down, they are proposing this vGLP to give AI a formal foundation so it can systematically develop the UI for those abstract grassroots platforms <ref:2607.14138#pg3>. They want to move away from that ad hoc UI design process entirely.

Jane: The paper summarizes that the goal is to have a single smartphone app, running this GLP engine, that can support multiple different grassroots platforms written in GLP <ref:2607.14138#pg3>. This means we don't need a separate UI for every new platform.

Lu: The paper is focused on getting the formal foundations right for unary volition-guarded transactions <ref:2607.14138#pg5>. They are trying to achieve mathematical elegance and completeness, but more importantly, they want something practical that AI can use to methodically develop the UI <ref:2607.14138#pg3>.

Meng: From a deployment standpoint, this sounds like it could be useful if we’re shipping complex applications where human choice is central, but I have to ask how much overhead this formal layer adds to the runtime <ref:2607.14138#pg6>. What does it cost to run this volition engine on a mobile device?

Tom: They address that with their implementation: they compile vGLP onto GLP, and the volitional layer is implemented on the channel by compilation itself <ref:2607.14138#pg6>. They use a mediator to escrow pending reductions in a pending table rendered as inbox cards <ref:2607.14138#pg6>.

The paper's improvements: Jane: So, what’s the real win here? What did they actually prove that makes this approach better than just guessing how to design a good interface?

Tom: They have some formal guarantees. Theorem five point three proves an elicitation completeness guarantee, which says that for every configuration, a volition over M is offered at p if and only if it is pending at p <ref:2607.14138#pg6>.

Lu: That means the UI will correctly present every choice the person needs to make <ref:2607.14138#pg6>. It formalizes what we mean by eliciting volitions from the person's head <ref:2607.14138#pg3>.

Meng: That sounds promising, but I need more than a proof for me to deploy it. Is there a guarantee on how well this maps to real-world user behavior?

Tom: They have Theorem four point one three, the Realisation theorem, which proves that every CVA platform has a correct implementation by the vmaGLP transition system over P and M with a simple vGLP program <ref:2607.14138#pg6>. It shows that the system is mathematically sound across all configurations <ref:2607.14138#pg6>.

Jane: So, they’re not just giving us a nice idea for design; they’re giving us a formal proof that if we build it this way, the resulting app will correctly implement the transaction defined by the people's wills <ref:2607.14138#pg2>.

Conclusion: Tom: So to wrap up, this paper introduces Volition Elicitation: Operational Semantics for People and Their Machines as a way to formally design user interfaces that can elicit volitions from people's heads <ref:2607.14138#pg3>. The key is defining vGLP and its operational semantics within CVA <ref:2607.14138#pg5>.

Jane: It seems the big implication is that AI can move from just processing inputs to actively designing interactions based on these formal rules, rather than relying on manual guesswork for every single platform <ref:2607.14138#pg4>.

Lu: The paper sets up the framework for taking abstract specifications and systematically deriving deployable apps from them, which is a major step in bridging the gap between high-level logic and user experience <ref:2607.14138#pg6>.

Meng: From my side, it suggests a way to standardize how we define what a 'transaction' means when human choice is involved, so at scale, things don't break because the underlying logic isn't clear <ref:2607.14138#pg6>.

Lalam: I’m fairly sure this direction is where the future of agent systems needs to go because it ties the human element directly into the core transaction structure of what these systems do <ref:2607.14138#pg2>.

Tom: We'll keep an eye on how they implement this on those actual grassroots platforms, which is where we’ll see if they can move from paper to a real working app <ref:2607.14138#pg6>.

More episodes

← Home