×
Well done. You've clicked the tower. This would actually achieve something if you had logged in first. Use the key for that. The name takes you home. This is where all the applicables sit. And you can't apply any changes to my site unless you are logged in.

Our policy is best summarized as "we don't care about _you_, we care about _them_", no emails, so no forgetting your password. You have no rights. It's like you don't even exist. If you publish material, I reserve the right to remove it, or use it myself.

Don't impersonate. Don't name someone involuntarily. You can lose everything if you cross the line, and no, I won't cancel your automatic payments first, so you'll have to do it the hard way. See how serious this sounds? That's how serious you're meant to take these.

×
Register


Required. 150 characters or fewer. Letters, digits and @/./+/-/_ only.
  • Your password can’t be too similar to your other personal information.
  • Your password must contain at least 8 characters.
  • Your password can’t be a commonly used password.
  • Your password can’t be entirely numeric.

Enter the same password as before, for verification.
Login

Grow A Dic
Define A Word
Make Space
Set Task
Mark Post
Apply Votestyle
Create Votes
(From: saved spaces)
Exclude Votes
Apply Dic
Exclude Dic

Click here to flash read.

The use of Dynamic Epistemic Logic (DEL) in multi-agent planning has led to a
widely adopted action formalism that can handle nondeterminism, partial
observability and arbitrary knowledge nesting. As such expressive power comes
at the cost of undecidability, several decidable fragments have been isolated,
mainly based on syntactic restrictions of the action formalism. In this paper,
we pursue a novel semantic approach to achieve decidability. Namely, rather
than imposing syntactical constraints, the semantic approach focuses on the
axioms of the logic for epistemic planning. Specifically, we augment the logic
of knowledge S5$_n$ and with an interaction axiom called (knowledge)
commutativity, which controls the ability of agents to unboundedly reason on
the knowledge of other agents. We then provide a threefold contribution. First,
we show that the resulting epistemic planning problem is decidable. In doing
so, we prove that our framework admits a finitary non-fixpoint characterization
of common knowledge, which is of independent interest. Second, we study
different generalizations of the commutativity axiom, with the goal of
obtaining decidability for more expressive fragments of DEL. Finally, we show
that two well-known epistemic planning systems based on action templates, when
interpreted under the setting of knowledge, conform to the commutativity axiom,
hence proving their decidability.

Click here to read this post out
ID: 301706; Unique Viewers: 0
Voters: 0
Latest Change: July 31, 2023, 7:31 a.m. Changes:
Dictionaries:
Words:
Spaces:
Comments:
Newcom
<0:100>