201 search results - page 20 / 41 » An Authorization Logic With Explicit Time |
APN
2004
Springer
14 years 4 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
BIBM
2009
IEEE
14 years 3 months ago
2009
IEEE
—In this paper we propose the use of answer set programming (ASP) to model protein interaction networks. We argue that this declarative formalism rivals the popular boolean netwo...
HICSS
2002
IEEE
14 years 3 months ago
2002
IEEE
: In this contribution we present a Learner Model (LM) of Historical Text Comprehension (HTC), which infers the cognitive profile of learner’s global comprehension concerning the...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
XPU
2007
Springer
14 years 4 months ago
2007
Springer
Bringing software process change to an organisation is a real challenge. The authors have shown a sample attempt to carry out a process change and then reflected on its results and...