Sciweavers

2584 search results - page 294 / 517
» On the Forward Checking Algorithm
Sort
View
ENTCS
2008
92views more  ENTCS 2008»
15 years 3 months ago
Redundancy Elimination for LF
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms w...
Jason Reed
ARTMED
2006
70views more  ARTMED 2006»
15 years 3 months ago
Towards a comprehensive treatment of repetitions, periodicity and temporal constraints in clinical guidelines
Temporal constraints play a fundamental role in clinical guidelines. For example, temporal indeterminacy, constraints about duration, delays between actions, and periodic repetiti...
Luca Anselma, Paolo Terenziani, Stefania Montani, ...
JAIR
2008
123views more  JAIR 2008»
15 years 3 months ago
CTL Model Update for System Modifications
Model checking is a promising technology, which has been applied for verification of many hardware and software systems. In this paper, we introduce the concept of model update to...
Yan Zhang, Yulin Ding
CL
2002
Springer
15 years 3 months ago
Behavioural typing for safe ambients
We introduce a typed variant of Safe Ambients, named Secure Safe Ambients (SSA), whose type system allows behavioral invariants of ambients to be expressed and verified. The most ...
Michele Bugliesi, Giuseppe Castagna
FUIN
2000
115views more  FUIN 2000»
15 years 3 months ago
Constructing the Least Models for Positive Modal Logic Programs
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
Linh Anh Nguyen