15033 search results - page 126 / 3007 » Complexity Theory and Algorithms |
124
click to vote
AAAI
2006
15 years 5 months ago
2006
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
149
click to vote
CI
2006
15 years 3 months ago
2006
This paper investigates decision-theoretic planning in sophisticated autonomous agents operating in environments of real-world complexity. An example might be a planetary rover ex...
154
click to vote
SAGT
2010
Springer
15 years 2 months ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
126
click to vote
FOCM
2011
14 years 7 months ago
2011
The theory of intersection homology was developed to study the singularities of a topologically stratified space. This paper incorporates this theory into the already developed f...
117
click to vote
SEMWEB
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Automated ontology population using information extraction algorithms can produce inconsistent knowledge bases. Confidence values assigned by the extraction algorithms m...