3238 search results - page 231 / 648 » On the Computational Interpretation of Negation |
170
click to vote
DLOG
2003
15 years 8 months ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
178
click to vote
FLAIRS
2000
15 years 8 months ago
2000
Many knowledge acquisition approaches have been proposed to minimize the cognitive effort in knowledgebased system construction. The knowledge acquisition approach proposed here p...
167
click to vote
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Theories defined in a process model are formalized and studied. A theory in a process calculus is a set of perpetually available processes with finite interactability, ea...
147
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--Recent result shows how to compute distributively and efficiently the linear MMSE for the multiuser detection problem, using the Gaussian BP algorithm. In the current wor...
168
click to vote
WIOPT
2010
IEEE
15 years 5 months ago
2010
IEEE
—Detecting events such as major routing changes or congestions in the dynamics of the internet topology is an important but challenging task. We explore here a top-down approach ...