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...
Huvudupphovsmän: | Banihashemi, B, De Giacomo, G, Lesperance, Y |
---|---|
Materialtyp: | Conference item |
Språk: | English |
Publicerad: |
International Joint Conferences on Artificial Intelligence
2023
|
Liknande verk
-
Abstraction of situation calculus concurrent game structures
av: Lespérance, Y, et al.
Publicerad: (2024) -
LTLf best-effort synthesis in nondeterministic planning domains
av: De Giacomo, G, et al.
Publicerad: (2023) -
NONDETERMINISTIC DECISION RULES
av: Piotr Paszek
Publicerad: (2015-04-01) -
NONDETERMINISTIC DECISION RULES
av: Piotr Paszek
Publicerad: (2015-04-01) -
NONDETERMINISTIC DECISION RULES
av: Piotr Paszek
Publicerad: (2015-04-01)