13603 search results - page 15 / 2721 » On the Computational Complexity of Cut-Reduction |
AI
2002
Springer
13 years 8 months ago
2002
Springer
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
ECCC
2011
13 years 3 months ago
2011
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
IEAAIE
1998
Springer
14 years 20 days ago
1998
Springer
Abstract. This paper has as main goal to develop a hybrid expert system to minimize some of the complexity problems related to arti cial intelligence eld. For instance, we can ment...
IJCAI
1997
13 years 9 months ago
1997
Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain l...
ECBS
1996
IEEE
14 years 18 days ago
1996
IEEE
It is widely recognized that real-time,fault-tolerant and distributed computing technologies play a key role in the deployment of many current andfuture (civilian or Defense) crit...