1664 search results - page 187 / 333 » Towards Partial Reasoning |
156
click to vote
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
The `Cooperation Logic of Propositional Control', cl-pc, of van der Hoek and Wooldridge is a logic for reasoning about the ability of agents and groups of agents to obtain a ...
138
click to vote
AIPS
2006
15 years 6 months ago
2006
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
141
click to vote
SLP
1994
15 years 6 months ago
1994
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
133
Voted
LISP
2008
15 years 4 months ago
2008
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
159
click to vote
CSFW
2011
IEEE
14 years 4 months ago
2011
IEEE
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...