346 search results - page 41 / 70 » Logical omniscience as a computational complexity problem |
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We describe our progress building the program ReductionFinder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reduction...
SIGCSE
2006
ACM
14 years 1 months ago
2006
ACM
We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are te...
JAIR
2008
13 years 7 months ago
2008
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
HYBRID
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Motivated by three applications which are under investigation at the Honeywell Research Laboratory in Minneapolis, we introduce a class of large scale control problems. I...
AI
2008
Springer
13 years 6 months ago
2008
Springer
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...