2022 search results - page 243 / 405 » Complexity of Non-Monotonic Logics |
206
click to vote
KR
2010
Springer
15 years 10 months ago
2010
Springer
The DL-Lite family of Description Logics has been designed with the specific goal of allowing for answering complex queries (in particular, conjunctive queries) over ontologies w...
154
click to vote
APCSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
In the context of general-purpose processing, an increasing number of diverse functional units are added to cover a wide spectrum of applications. However, it is still possible to ...
215
click to vote
UAI
1997
15 years 7 months ago
1997
Bayesian networks provide a modeling language and associated inference algorithm for stochastic domains. They have been successfully applied in a variety of medium-scale applicati...
174
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The paper develops a novel approach to stream cipher design: Both the state update function and the output function of the corresponding pseudorandom generators are compositions of...
176
click to vote
IANDC
2006
15 years 6 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...