Sciweavers

4218 search results - page 161 / 844
» Complete sets of cooperations
Sort
View
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 10 months ago
Loop Formulas for Description Logic Programs
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...
Yisong Wang, Jia-Huai You, Li-Yan Yuan, Yi-Dong Sh...
AML
2005
73views more  AML 2005»
13 years 10 months ago
Strong reducibility of partial numberings
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...
Dieter Spreen
AAAI
2006
13 years 11 months ago
A Characterization of Interventional Distributions in Semi-Markovian Causal Models
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...
Jin Tian, Changsung Kang, Judea Pearl
CORR
2004
Springer
110views Education» more  CORR 2004»
13 years 10 months ago
On Modal Logics of Partial Recursive Functions
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...
Pavel Naumov
EJC
2007
13 years 10 months ago
On separating systems
We sharpen a result of Hansel on separating set systems. We also extend a theorem of Spencer on completely separating systems by proving an analogue of Hansel’s result.
Béla Bollobás, Alex D. Scott