175 search results - page 34 / 35 » The Complexity of Model Checking Higher-Order Fixpoint Logic |
126
Voted
ICLP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
130
Voted
SIGSOFT
2000
ACM
15 years 8 months ago
2000
ACM
Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must ...
165
Voted
TDSC
2008
15 years 3 months ago
2008
Specifying and managing access control policies is a challenging problem. We propose to develop formal verification techniques for access control policies to improve the current s...
127
Voted
DLOG
2004
15 years 5 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
175
Voted
CI
2000
15 years 3 months ago
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...