no code implementations • 29 Aug 2023 • Benjamin Aminof, Giuseppe De Giacomo, Antonio Di Stasio, Hugo Francon, Sasha Rubin, Shufang Zhu
In this paper, we study LTLf synthesis under environment specifications for arbitrary reachability and safety properties.
no code implementations • 12 May 2021 • Niku Gorji, Sasha Rubin
The main idea is to view classifiers in the presence of constraints as describing partial Boolean functions, i. e., that are undefined on instances that do not satisfy the constraints.
no code implementations • 13 Aug 2020 • Julian Gutierrez, Aniello Murano, Giuseppe Perelli, Sasha Rubin, Thomas Steeples, Michael Wooldridge
The overall aim of our research is to develop techniques to reason about the equilibrium properties of multi-agent systems.
no code implementations • 24 Dec 2019 • Benjamin Aminof, Giuseppe De Giacomo, Sasha Rubin
This important difference has been overlooked in the planning literature, and we argue has led to confusion in a number of published algorithms which use reductions that were stated for state-action fairness, for which they are incorrect, while being correct for stochastic fairness.
no code implementations • 26 Sep 2019 • Blai Bonet, Giuseppe De Giacomo, Hector Geffner, Sasha Rubin
Moreover, for a broad class of problems that involve integer variables that can be increased or decreased, trajectory constraints can be compiled away, reducing generalized planning to fully observable non-deterministic planning.
no code implementations • 18 Jul 2018 • Benjamin Aminof, Giuseppe De Giacomo, Aniello Murano, Sasha Rubin
In Reasoning about Action and Planning, one synthesizes the agent plan by taking advantage of the assumption on how the environment works (that is, one exploits the environment's effects, its fairness, its trajectory constraints).
no code implementations • 17 May 2018 • Aurèle Barrière, Bastien Maubert, Aniello Murano, Sasha Rubin
We extend the classic semantics of knowledge for perfect-recall agents to account for changes of observation, and we show that this new operator strictly increases the expressivity of CTL*K. We reduce the model-checking problem for our logic to that for CTL*K, which is known to be decidable.
no code implementations • 12 Jul 2016 • Benjamin Aminof, Vadim Malvone, Aniello Murano, Sasha Rubin
Strategy Logic (SL) is a logical formalism for strategic reasoning in multi-agent systems.