77 search results - page 15 / 16 » Reasoning by Cases without Contraposition in Default Logic |
AIPS
2006
13 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...
CADE
2001
Springer
14 years 5 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
SIGSOFT
2002
ACM
14 years 6 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
SIGADA
2004
Springer
13 years 10 months ago
2004
Springer
Existing security models require that information of a given security level be prevented from “leaking” into lower-security information. High-security applications must be dem...
EMSOFT
2006
Springer
13 years 9 months ago
2006
Springer
We report on a case study in which the model checker Uppaal is used to formally model parts of Zeroconf, a protocol for dynamic configuration of IPv4 link-local addresses that has...