77 search results - page 14 / 16 » Reasoning by Cases without Contraposition in Default Logic |
SIAMCOMP
2012
11 years 8 months ago
2012
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
ENTCS
2002
13 years 5 months ago
2002
In the quest for an elegant formulation of the notion of "polycategory" we develop a more symmetric counterpart to Burroni's notion of "T-category", where ...
ATAL
2005
Springer
13 years 11 months ago
2005
Springer
In this paper we combine existing work in the area of social laws with a framework for reasoning about knowledge in multi-agent systems. The unifying framework in which this is do...
TIME
2009
IEEE
14 years 15 days ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
OOPSLA
2007
Springer
13 years 12 months ago
2007
Springer
Objects often define usage protocols that clients must follow in order for these objects to work properly. Aliasing makes it notoriously difficult to check whether clients and i...