2214 search results - page 117 / 443 » Complexity of Reasoning |
122
click to vote
LPNMR
1997
Springer
15 years 7 months ago
1997
Springer
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
124
Voted
CONCUR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
113
Voted
TIME
2000
IEEE
15 years 7 months ago
2000
IEEE
Medical therapy planning shares a number of properties of project management. It is, however, different in a few very important aspects — most notably, the more complex notion o...
149
click to vote
CCL
1994
Springer
15 years 7 months ago
1994
Springer
Abstract: This paper describes the application of CLP (constraint logic programming) to several digital circuit design problems. It is shown that logic programming together with ef...
110
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intens...