3244 search results - page 585 / 649 » Extensions to Description Logics |
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
In many applications, tasks can be delegated to intelligent agents. In order to carry out a task, an agent should reason about what types of resources the task requires. However, ...
HASKELL
2008
ACM
14 years 11 months ago
2008
ACM
Eight years ago, functional dependencies, a concept from the theory of relational databases, were proposed as a mechanism for avoiding common problems with multiple parameter type...
LDTA
2010
14 years 10 months ago
2010
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
79
Voted
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
121
click to vote
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...