Abstraction of nondeterministic situation calculus action theories
We develop a general framework for abstracting the behavior of an agent that operates in a nondeterministic domain, i.e., where the agent does not control the outcome of the nondeterministic actions, based on the nondeterministic situation calculus and the ConGolog programming language. We assume th...
Main Authors: | Banihashemi, B, De Giacomo, G, Lesperance, Y |
---|---|
Format: | Conference item |
Language: | English |
Published: |
International Joint Conferences on Artificial Intelligence
2023
|
Similar Items
-
Abstraction of situation calculus concurrent game structures
by: Lespérance, Y, et al.
Published: (2024) -
LTLf best-effort synthesis in nondeterministic planning domains
by: De Giacomo, G, et al.
Published: (2023) -
NONDETERMINISTIC DECISION RULES
by: Piotr Paszek
Published: (2015-04-01) -
NONDETERMINISTIC DECISION RULES
by: Piotr Paszek
Published: (2015-04-01) -
NONDETERMINISTIC DECISION RULES
by: Piotr Paszek
Published: (2015-04-01)