4066 search results - page 119 / 814 » Almost Complete Sets |
194
click to vote
ICFEM
2010
Springer
15 years 4 months ago
2010
Springer
Design patterns are rarely used on their own. They are almost always to be found composed with each other in real applications. So it is crucial that we can reason about their comp...
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logic...
140
click to vote
AML
2005
15 years 6 months ago
2005
A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numberin...
144
click to vote
AAAI
2006
15 years 7 months ago
2006
We offer a complete characterization of the set of distributions that could be induced by local interventions on variables governed by a causal Bayesian network of unknown structu...
203
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...