activity
20002017
most citedAlternating register automata on finite words and trees

39 citations · 127 across the 31 of their papers we have counts for

collaborators
Showing cs.AIShow all

10 papers · 1 filter

cs.AI2014

A Logic for Reasoning about Upper Probabilities

Joseph Y. Halpern, Riccardo Pucella

We present a propositional logic to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability t…

cs.AI2014

Evidence with Uncertain Likelihoods

Joseph Y. Halpern, Riccardo Pucella

An agent often has a number of hypotheses, and must choose among them based on observations, or outcomes of experiments. Each of these observations can be viewed as providing evide…

cs.AI2014

A Logic for Reasoning about Evidence

Joseph Y. Halpern, Riccardo Pucella

We introduce a logic for reasoning about evidence, that essentially views evidence as a function from prior beliefs (before making an observation) to posterior beliefs (after makin…

cs.AI2014★ 12 cited

Reasoning about Expectation

Joseph Y. Halpern, Riccardo Pucella

Expectation is a central notion in probability theory. The notion of expectation also makes sense for other notions of uncertainty. We introduce a propositional logic for reasoning…

cs.AI2005★ 1 cited

Evidence with Uncertain Likelihoods

Joseph Y. Halpern, Riccardo Pucella

An agent often has a number of hypotheses, and must choose among them based on observations, or outcomes of experiments. Each of these observations can be viewed as providing evide…

cs.AI2005★ 2 cited

Probabilistic Algorithmic Knowledge

Joseph Y. Halpern, Riccardo Pucella

The framework of algorithmic knowledge assumes that agents use deterministic knowledge algorithms to compute the facts they explicitly know. We extend the framework to allow for ra…