English
Related papers

Related papers: A Model for Probabilistic Reasoning on Assume/Guar…

200 papers

In many legal processes being able to action on the concrete implication of a legal question can be valuable to automating human review or signalling certain conditions (e.g., alerts around automatic renewal). To support such tasks, we…

Computer Vision and Pattern Recognition · Computer Science 2023-10-17 Adam Roegiest , Radha Chitta , Jonathan Donnelly , Maya Lash , Alexandra Vtyurina , François Longtin

We use the law of total variance to generate multiple expansions for the posterior predictive variance. These expansions are sums of terms involving conditional expectations and conditional variances and provide a quantification of the…

Statistics Theory · Mathematics 2026-03-23 Sanjay Chaudhuri , Dean Dustin , Bertrand Clarke

In a series of recent work, we have introduced a general framework for quantitative reasoning in specification theories. The contribution of this paper is to show how this framework can be applied to yield a robust specification theory for…

Logic in Computer Science · Computer Science 2012-07-19 Uli Fahrenberg , Axel Legay

In cooperative human decision-making, agreements are often not total; a partial degree of agreement is sufficient to commit to a decision and move on, as long as one is somewhat confident that the involved parties are likely to stand by…

Artificial Intelligence · Computer Science 2025-01-07 Timotheus Kampik , Juan Carlos Nieves

Rely-guarantee (RG) is a highly influential compositional proof technique for concurrent programs, which was originally developed assuming a sequentially consistent shared memory. In this paper, we first generalize RG to make it parametric…

Programming Languages · Computer Science 2026-05-08 Ori Lahav , Brijesh Dongol , Heike Wehrheim

We revisit the problem of constructing predictive confidence sets for which we wish to obtain some type of conditional validity. We provide new arguments showing how ``split conformal'' methods achieve near desired coverage levels with high…

Statistics Theory · Mathematics 2025-03-04 John C. Duchi

We investigate the connections between compression learning and scenario based optimization. We first show how to strengthen, or relax the consistency assumption at the basis of compression learning and study the learning and generalization…

Systems and Control · Computer Science 2014-03-07 Kostas Margellos , Maria Prandini , John Lygeros

The Acceptance Probability Estimation Problem (APEP) is to additively approximate the acceptance probability of a Boolean circuit. This problem admits a probabilistic approximation scheme. A central question is whether we can design a…

Computational Complexity · Computer Science 2021-03-16 Peter Dixon , A. Pavan , N. V. Vinodchandran

In many areas of engineering and sciences, decision rules and control strategies are usually designed based on nominal values of relevant system parameters. To ensure that a control strategy or decision rule will work properly when the…

Probability · Mathematics 2020-06-16 Xinjia Chen

I revisit the standard moral-hazard model, in which an agent's preference over contracts is rooted in costly effort choice. I characterise the behavioural content of the model in terms of empirically testable axioms, and show that the…

Theoretical Economics · Economics 2025-11-26 Ludvig Sinander

We present a domain-theoretic framework for probabilistic programming that provides a constructive definition of conditional probability and addresses computability challenges previously identified in the literature. We introduce a novel…

Logic in Computer Science · Computer Science 2025-02-04 Pietro Di Gianantonio , Abbas Edalat

Algorithms often have tunable parameters that impact performance metrics such as runtime and solution quality. For many algorithms used in practice, no parameter settings admit meaningful worst-case bounds, so the parameters are made…

Machine Learning · Computer Science 2021-04-27 Maria-Florina Balcan , Dan DeBlasio , Travis Dick , Carl Kingsford , Tuomas Sandholm , Ellen Vitercik

We provide a logical framework in which a resource-bounded agent can be seen to perform approximations of probabilistic reasoning. Our main results read as follows. First we identify the conditions under which propositional probability…

Logic in Computer Science · Computer Science 2022-05-09 Paolo Baldi , Hykel Hosni

Reachability analysis evaluates system safety, by identifying the set of states a system may evolve within over a finite time horizon. In contrast to model-based reachability analysis, data-driven reachability analysis estimates reachable…

Systems and Control · Electrical Eng. & Systems 2026-04-06 Elizabeth Dietrich , Hanna Krasowski , Murat Arcak

A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for reasoning about the random results of projective…

Logic · Mathematics 2018-03-20 A. Sernadas , J. Rasga , C. Sernadas , L. Alcácer , A. B. Henriques

Conditional acceptability refers to how plausible a conditional statement is perceived to be. It plays an important role in communication and reasoning, as it influences how individuals interpret implications, assess arguments, and make…

Computation and Language · Computer Science 2026-03-20 Jasmin Orth , Philipp Mondorf , Barbara Plank

This paper proposes risk-averse and risk-agnostic formulations to robust design in which solutions that satisfy the system requirements for a set of scenarios are pursued. These scenarios, which correspond to realizations of uncertain…

Optimization and Control · Mathematics 2025-11-07 Luis G. Crespo , Bret Stanford , Natalia Alexandrov

Machines that can replicate human intelligence with type 2 reasoning capabilities should be able to reason at multiple levels of spatio-temporal abstractions and scales using internal world models. Devising formalisms to develop such…

Artificial Intelligence · Computer Science 2025-07-01 Vaisakh Shaj

Contract-based design is a promising methodology for taming the complexity of developing sophisticated systems. A formal contract distinguishes between assumptions, which are constraints that the designer of a component puts on the…

Formal Languages and Automata Theory · Computer Science 2020-05-11 Ezio Bartocci , Thomas Ferrère , Thomas A. Henzinger , Dejan Nickovic , Ana Oliveira da Costa

Robots assisting humans in complex domains have to represent knowledge and reason at both the sensorimotor level and the social level. The architecture described in this paper couples the non-monotonic logical reasoning capabilities of a…

Robotics · Computer Science 2015-08-04 Zenon Colaco , Mohan Sridharan
‹ Prev 1 8 9 10 Next ›