257 search results - page 46 / 52 » The Complexity of Model Checking for Propositional Default L... |
IS
2010
13 years 6 months ago
2010
Existing Digital Rights Management systems, initiatives like Creative Commons or research works as some digital rights ontologies provide limited support for content value chains m...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
We develop a model of normative systems in which agents are assumed to have multiple goals of increasing priority, and investigate the computational complexity and game theoretic ...
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
JSW
2007
13 years 7 months ago
2007
— BPEL (Business Process Execution Language) as a de-facto standard for web service orchestration has drawn particularly attention from researchers and industries. BPEL is a semi...
LICS
2000
IEEE
13 years 12 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...