3358 search results - page 158 / 672 » Dynamic Description Logics |
212
click to vote
ILP
2005
Springer
16 years 20 days ago
2005
Springer
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
209
click to vote
LICS
1990
IEEE
15 years 11 months ago
1990
IEEE
Reasoning about permissions and obligations sometimes requires to distinguish more than one level of permission: certain actions are preferable to others, or one has more confiden...
310
click to vote
ECCB
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract: Models of the dynamics of cellular interaction networks have become increasingly larger in recent years. Formal verification based on model checking provides a powerful t...
208
click to vote
ESOP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
224
click to vote
DEON
2010
Springer
15 years 12 months ago
2010
Springer
Abstract. Privacy policies are often defined in terms of permitted messages. Instead, in this paper we derive dynamically the permitted messages from static privacy policies defi...