3946 search results - page 75 / 790 » The computational complexity of choice sets |
120
click to vote
JELIA
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
SIGKDD
2000
14 years 11 months ago
2000
Advances in data collection and storage have allowed organizations to create massive, complex and heterogeneous databases, which have stymied traditional methods of data analysis....
135
click to vote
AI
2011
Springer
14 years 6 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
LPNMR
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link with the Answer Set Programming paradigm...
116
click to vote
PDCAT
2007
Springer
15 years 6 months ago
2007
Springer
When datasets are distributed on different sources, finding out their intersection while preserving the privacy of the datasets is a widely required task. In this paper, we addre...