2233 search results - page 172 / 447 » On the Complexity of Theory Curbing |
155
click to vote
ICTAI
1994
IEEE
15 years 10 months ago
1994
IEEE
Combining various knowledge types - and reasoning methods - in knowledge-based systems is a challenge to the knowledge representation task. The paper describes an object-oriented,...
156
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...
174
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
184
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
174
click to vote
ECAI
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We call verification the process of finding the actual explanation of a given set of manifestations. We consider an abductive setting, in which explanations are sets of a...