3172 search results - page 103 / 635 » On the Random-Self-Reducibility of Complete Sets |
125
Voted
SOSYM
2010
14 years 11 months ago
2010
: The specification of a software system must include all relevant static and dynamic aspects of the domain. Dynamic aspects are usually specified by means of a behavioral schema c...
107
click to vote
CORR
2010
Springer
15 years 1 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...
86
Voted
AML
2005
15 years 1 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...
132
Voted
AAMAS
2012
Springer
13 years 8 months ago
2012
Springer
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
89
Voted
AAAI
2006
15 years 2 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...