English
Related papers

Related papers: Bounded Situation Calculus Action Theories

200 papers

We investigate quantitative extensions of modal logic and the modal mu-calculus, and study the question whether the tight connection between logic and games can be lifted from the qualitative logics to their quantitative counterparts. It…

Logic in Computer Science · Computer Science 2008-02-21 Diana Fischer , Erich Grädel , Lukasz Kaiser

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

Logic in Computer Science · Computer Science 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner

We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained during execution of one task has value for the execution of…

Machine Learning · Computer Science 2012-09-06 Christos Dimitrakakis

We develop a well-posedness theory for second order systems in bounded domains where boundary phenomena like glancing and surface waves play an important role. Attempts have previously been made to write a second order system consisting of…

Analysis of PDEs · Mathematics 2010-12-08 Heinz-Otto Kreiss , Omar E. Ortiz , N. Anders Petersson

Causal analysis may be affected by selection bias, which is defined as the systematic exclusion of data from a certain subpopulation. Previous work in this area focused on the derivation of identifiability conditions. We propose instead a…

Machine Learning · Statistics 2022-08-03 Marco Zaffalon , Alessandro Antonucci , Rafael Cabañas , David Huber , Dario Azzimonti

We analyze boundedly rational updating from aggregate statistics in a model with binary actions and binary states. Agents each take an irreversible action in sequence after observing the unordered set of previous actions. Each agent first…

Machine Learning · Computer Science 2021-01-11 Itai Arieli , Yakov Babichenko , Manuel Mueller-Frank

Concentration inequalities are indispensable tools for studying the generalization capacity of learning models. Hoeffding's and McDiarmid's inequalities are commonly used, giving bounds independent of the data distribution. Although this…

Machine Learning · Statistics 2017-02-21 Xinxing Wu , Junping Zhang

We consider a class of stationary processes exhibiting both long-range dependence and heavy tails. Separate limit theorems for sums and for extremes have been established recently in literature with novel objects appearing in the limits. In…

Probability · Mathematics 2023-09-12 Shuyang Bai , He Tang

This paper is an introduction to the theory of multivector functions of a real variable. The notions of limit, continuity and derivative for these objects are given. The theory of multivector functions of a real variable, even being similar…

General Mathematics · Mathematics 2016-08-16 A. M. Moya , V. V. Fernández , W. A. Rodrigues

Covariational reasoning -- how one thinks about the way changes in one quantity affect another quantity -- is essential to calculus and physics instruction alike. As physics is often centered on understanding and predicting changes in…

Physics Education · Physics 2019-11-20 Charlotte Zimmerman , Alexis Olsho , Michael Loverude , Suzanne White Brahmia

There is a long history in game theory on the topic of Bayesian or "rational" learning, in which each player maintains beliefs over a set of alternative behaviours, or types, for the other players. This idea has gained increasing interest…

Artificial Intelligence · Computer Science 2016-03-03 Stefano V. Albrecht , Jacob W. Crandall , Subramanian Ramamoorthy

There have been two major lines of research aimed at capturing resource-bounded players in game theory. The first, initiated by Rubinstein, charges an agent for doing costly computation; the second, initiated by Neyman, does not charge for…

Computer Science and Game Theory · Computer Science 2013-08-20 Joseph Y. Halpern , Rafael Pass , Lior Seeman

Dependence logic provides an elegant approach for introducing dependencies between variables into the object language of first-order logic. In [1] generalized quantifiers were introduced in this context. However, a satisfactory account was…

Logic · Mathematics 2024-04-29 Fredrik Engström

A person is given a numbered sequence of positions on a sheet of paper. The person is asked, "Which will be the next (or the next after that) position?" Everyone has an opinion as to how he or she would proceed. There are regular sequences…

Computer Vision and Pattern Recognition · Computer Science 2010-12-30 Manfred Harringer

A perfectly rational decision-maker chooses the best action with the highest utility gain from a set of possible actions. The optimality principles that describe such decision processes do not take into account the computational costs of…

Artificial Intelligence · Computer Science 2013-12-25 Jordi Grau-Moya , Daniel A. Braun

In this paper the theory of semi-bounded rationality is proposed as an extension of the theory of bounded rationality. In particular, it is proposed that a decision making process involves two components and these are the correlation…

Artificial Intelligence · Computer Science 2013-05-28 Tshilidzi Marwala

We introduce action-driven flows for causal variational principles, being a class of non-convex variational problems emanating from applications in fundamental physics. In the compact setting, H\"older continuous curves of measures are…

Mathematical Physics · Physics 2026-05-27 Felix Finster , Franz Gmeineder

A new approach to describing aerosol behavior is proposed. Boundary functionals of random process theory are applied to describe the behavior of aerosol concentrations during coagulation. It is shown that considering the first-passage time…

Statistical Mechanics · Physics 2025-11-10 V. V. Ryazanov

A bounded degree structure is either a relational structure all of whose relations are of bounded degree or a functional structure involving bijective functions only. In this paper, we revisit the complexity of the evaluation problem of not…

Logic in Computer Science · Computer Science 2007-05-23 Arnaud Durand , Etienne Grandjean

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

Logic in Computer Science · Computer Science 2007-12-11 Klaus Aehlig , Arnold Beckmann