4737 search results - page 132 / 948 » The LOGIC negotiation model |
IFIP
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
ECCV
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We address the problem of visual event recognition in surveillance where noise and missing observations are serious problems. Common sense domain knowledge is exploited t...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Logics for security protocol analysis require the formalization of an adversary model that specifies the capabilities of adversaries. A common model is the Dolev-Yao model, which c...
MFCS
2005
Springer
14 years 2 months ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...