English
Related papers

Related papers: Abstracting Probabilistic Actions

200 papers

Abstraction and realization are bilateral processes that are key in deriving intelligence and creativity. In many domains, the two processes are approached through rules: high-level principles that reveal invariances within similar yet…

Machine Learning · Computer Science 2018-03-13 Haizi Yu , Tianxi Li , Lav R. Varshney

General-purpose agents require fine-grained controls and rich sensory inputs to perform a wide range of tasks. However, this complexity often leads to intractable decision-making. Traditionally, agents are provided with task-specific action…

Machine Learning · Computer Science 2024-06-25 Rafael Rodriguez-Sanchez , George Konidaris

Autonomous robots operating in dynamic environments must maintain beliefs over a hypothesis space that is rich enough to represent the activities of interest at different scales. This is important both in order to accommodate the…

Artificial Intelligence · Computer Science 2016-07-26 Majd Hawasly , Florian T. Pokorny , Subramanian Ramamoorthy

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…

Logic in Computer Science · Computer Science 2023-05-24 Bita Banihashemi , Giuseppe De Giacomo , Yves Lespérance

As trajectories sampled by policies used by reinforcement learning (RL) and generative flow networks (GFlowNets) grow longer, credit assignment and exploration become more challenging, and the long planning horizon hinders mode discovery…

The probabilistic abstract interpretation framework of neural network analysis analyzes a neural network by analyzing its density distribution flow of all possible inputs. The grids approximation is one of abstract domains the framework…

Artificial Intelligence · Computer Science 2026-03-27 Zhuofan Zhang , Herbert Wiklicky

Approximations during program analysis are a necessary evil, as they ensure essential properties, such as soundness and termination of the analysis, but they also imply not always producing useful results. Automatic techniques have been…

Programming Languages · Computer Science 2018-12-18 Isabel Garcia-Contreras , Jose F. Morales , Manuel V. Hermenegildo

Abstraction is one of the most important strategies for dealing with the state space explosion problem in model checking. In the abstract model, although the state space is largely reduced, however, a counterexample found in such a model…

Logic in Computer Science · Computer Science 2010-07-27 Cong Tian , Zhenhua Duan

Automatic summarization is the process of shortening a set of textual data computationally, to create a subset (a summary) that represents the most important pieces of information in the original text. Existing summarization methods can be…

Computation and Language · Computer Science 2022-04-21 Meng Cao

Abstraction plays an important role in the generalisation of knowledge and skills and is key to sample efficient learning. In this work, we study joint temporal and state abstraction in reinforcement learning, where temporally-extended…

Machine Learning · Computer Science 2022-06-09 Dongge Han , Sebastian Tschiatschek

Abstraction is a well-known approach to simplify a complex problem by over-approximating it with a deliberate loss of information. It was not considered so far in Answer Set Programming (ASP), a convenient tool for problem solving. We…

Logic in Computer Science · Computer Science 2021-07-01 Zeynep G. Saribatur , Thomas Eiter

Reasoning about uncertainty is vital in many real-life autonomous systems. However, current state-of-the-art planning algorithms cannot either reason about uncertainty explicitly, or do so with a high computational burden. Here, we focus on…

Artificial Intelligence · Computer Science 2022-01-31 Moran Barenboim , Vadim Indelman

In this paper we consider the problem of configuring partial predicate abstraction that combines two techniques that have been effective in analyzing infinite-state systems: predicate abstraction and fixpoint approximations. A fundamental…

Logic in Computer Science · Computer Science 2018-01-09 Tuba Yavuz , Chelsea Metcalf

In a previous paper the authors applied the Abstract Interpretation approach for approximating the probabilistic semantics of biological systems, modeled specifically using the Chemical Ground Form calculus. The methodology is based on the…

Logic in Computer Science · Computer Science 2009-12-01 Roberta Gori , Francesca Levi

Planning in adversarial and uncertain environments can be modeled as the problem of devising strategies in stochastic perfect information games. These games are generalizations of Markov decision processes (MDPs): there are two…

Artificial Intelligence · Computer Science 2012-07-09 Krishnendu Chatterjee , Thomas A. Henzinger , Ranjit Jhala , Rupak Majumdar

Markov decision processes are a ubiquitous formalism for modelling systems with non-deterministic and probabilistic behavior. Verification of these models is subject to the famous state space explosion problem. We alleviate this problem by…

Artificial Intelligence · Computer Science 2022-06-07 Sebastian Junges , Matthijs T. J. Spaan

Novel user interfaces based on artificial intelligence, such as natural-language agents, present new categories of engineering challenges. These systems need to cope with uncertainty and ambiguity, interface with machine learning…

Programming Languages · Computer Science 2017-09-18 Alex Renda , Harrison Goldstein , Sarah Bird , Chris Quirk , Adrian Sampson

The abilities of humans to understand the world in terms of cause and effect relationships, as well as to compress information into abstract concepts, are two hallmark features of human intelligence. These two topics have been studied in…

Machine Learning · Computer Science 2024-02-26 Kevin Xia , Elias Bareinboim

Abductive explanations (AXp's) are widely used for understanding decisions of classifiers. Existing definitions are suitable when features are independent. However, we show that ignoring constraints when they exist between features may lead…

Artificial Intelligence · Computer Science 2024-09-19 Martin Cooper , Leila Amgoud

Contracts are a well-established approach for describing and analyzing behavioral aspects of web service compositions. The theory of contracts comes equipped with a notion of compatibility between clients and servers that ensures that every…

Programming Languages · Computer Science 2011-01-26 Maria Grazia Buscemi , Hernán Melgratti