1094 search results - page 77 / 219 » On Computing Explanations in Argumentation |
ISIPTA
2005
IEEE
15 years 4 months ago
2005
IEEE
Logic and probability theory have both a long history in science. They are mainly rooted in philosophy and mathematics, but are nowadays important tools in many other fields such...
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m ´1 · 1 polylog nµn. This lower bound qualitatively ...
76
Voted
ADAEUROPE
2010
Springer
15 years 3 months ago
2010
Springer
The technology for building dependable computing systems has advanced dramatically. Nevertheless, there is still no complete solution to building software for critical systems in w...
DAC
1994
ACM
15 years 3 months ago
1994
ACM
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
CSR
2008
Springer
15 years 25 days ago
2008
Springer
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...