English
Related papers

Related papers: Strategic Dominance: A New Preorder for Nondetermi…

200 papers

Markov decision processes model systems subject to nondeterministic and probabilistic uncertainty. A plethora of verification techniques addresses variations of reachability properties, such as: Is there a scheduler resolving the…

Logic in Computer Science · Computer Science 2025-05-26 Lina Gerlach , Tobias Winkler , Erika Ábrahám , Borzoo Bonakdarpour , Sebastian Junges

The relational semantics of linear logic is a powerful framework for defining resource-aware models of the $\lambda$-calculus. However, its quantitative aspects are not reflected in the preorders and equational theories induced by these…

Logic in Computer Science · Computer Science 2026-04-30 Adrienne Lancelot , Giulio Manzonetto , Guy McCusker , Gabriele Vanoni

First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification…

Logic in Computer Science · Computer Science 2024-05-31 Luca Geatti , Alessandro Gianola , Nicola Gigante

We present efficient algorithms to reduce the size of nondeterministic B\"uchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages. Additionally, we describe methods to solve PSPACE-complete…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Lorenzo Clemente , Richard Mayr

This paper addresses non-prehensile rearrangement planning problems where a robot is tasked to rearrange objects among obstacles on a planar surface. We present an efficient planning algorithm that is designed to impose few assumptions on…

Robotics · Computer Science 2019-01-14 Joshua A. Haustein , Isac Arnekvist , Johannes Stork , Kaiyu Hang , Danica Kragic

Strategic classification studies learning in settings where self-interested users can strategically modify their features to obtain favorable predictive outcomes. A key working assumption, however, is that "favorable" always means…

Machine Learning · Computer Science 2022-06-22 Sagi Levanon , Nir Rosenfeld

Post-training alignment optimizes language models to match human preference signals, but this objective is not equivalent to modeling observed human behavior. We compare 120 base-aligned model pairs on more than 10,000 real human decisions…

Computation and Language · Computer Science 2026-05-27 Eilam Shapira , Moshe Tennenholtz , Roi Reichart

The rationalizability concept was introduced in \cite{Ber84} and \cite{Pea84} to assess what can be inferred by rational players in a non-cooperative game in the presence of common knowledge. However, this notion can be defined in a number…

Computer Science and Game Theory · Computer Science 2007-06-13 Krzysztof R. Apt

Behavior domination is proposed as a tool for understanding and harnessing the power of evolutionary systems to discover and exploit useful stepping stones. Novelty search has shown promise in overcoming deception by collecting diverse…

Neural and Evolutionary Computing · Computer Science 2017-04-20 Elliot Meyerson , Risto Miikkulainen

In order to enrich dynamic semantic theories with a `pragmatic' capacity, we combine dynamic and nonmonotonic (preferential) logics in a modal logic setting. We extend a fragment of Van Benthem and De Rijke's dynamic modal logic with…

cmp-lg · Computer Science 2008-02-03 Jan Jaspars , Megumi Kameyama

When users stand to gain from certain predictions, they are prone to act strategically to obtain favorable predictive outcomes. Whereas most works on strategic classification consider user actions that manifest as feature modifications, we…

Machine Learning · Computer Science 2024-06-25 Guy Horowitz , Yonatan Sommer , Moran Koren , Nir Rosenfeld

Many classical planning frameworks are built on first-order languages. The first-order expressive power is desirable for compactly representing actions via schemas, and for specifying quantified conditions such as $\neg\exists…

Logic in Computer Science · Computer Science 2020-06-04 Andrés Occhipinti Liberman , Andreas Achen , Rasmus Kræmmer Rendsvig

History-determinism is a restricted notion of nondeterminism in automata, where the nondeterminism can be successfully resolved based solely on the prefix read so far. History-deterministic automata still allow for exponential succinctness…

Formal Languages and Automata Theory · Computer Science 2026-05-28 Karoliina Lehtinen , Keya Prakash

This paper asks whether a bounded neural architecture can exhibit a meaningful division of labor between intuition and deliberation on a classic 64-item syllogistic reasoning benchmark. More broadly, the benchmark is relevant to ongoing…

Artificial Intelligence · Computer Science 2026-03-25 Laurence Anthony

Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…

Logic in Computer Science · Computer Science 2025-05-01 Nikolaos Galatos , Vitor Greati , Revantha Ramanayake , Gavin St. John

Strategic classification studies the problem where self-interested individuals or agents manipulate their response to obtain favorable decision outcomes made by classifiers, typically turning to dishonest actions when they are less costly…

Machine Learning · Computer Science 2026-05-07 Ziyuan Huang , Lina Alkarmi , Mingyan Liu

Large Language Models (LLMs) have rapidly transformed the landscape of artificial intelligence, enabling natural language interfaces and dynamic orchestration of software components. However, their reliance on probabilistic inference limits…

Machine Learning · Computer Science 2025-07-01 Claudionor Coelho , Yanen Li , Philip Tee

The predominant approach for language modeling is to process sequences from left to right, but this eliminates a source of information: the order by which the sequence was generated. One strategy to recover this information is to decode…

Computation and Language · Computer Science 2021-11-01 Xuanlin Li , Brandon Trabucco , Dong Huk Park , Michael Luo , Sheng Shen , Trevor Darrell , Yang Gao

Recent studies have analyzed whether one forecast method dominates another under a class of consistent scoring functions. While the existing literature focuses on empirical tests of forecast dominance, little is known about the theoretical…

Methodology · Statistics 2019-12-19 Fabian Krüger , Johanna F. Ziegel

This paper introduces a sampling-based strategy synthesis algorithm for nondeterministic hybrid systems with complex continuous dynamics under temporal and reachability constraints. We model the evolution of the hybrid system as a…

Systems and Control · Electrical Eng. & Systems 2023-12-27 Qi Heng Ho , Zachary N. Sunberg , Morteza Lahijanian