2214 search results - page 56 / 443 » Complexity of Reasoning |
131
click to vote
LICS
1997
IEEE
15 years 4 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
116
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
The capacity to robustly detect humans in video is a critical component of automated visual surveillance systems. This paper describes a bilattice based logical reasoning approach...
116
click to vote
LPAR
2007
Springer
15 years 6 months ago
2007
Springer
We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability...
CORR
2002
Springer
14 years 11 months ago
2002
Springer
This paper studies the problem of modeling complex domains of actions and change within highlevel action description languages. We investigate two main issues of concern: (a) can ...