Sciweavers

1836 search results - page 96 / 368
» Hierarchies for semantic classes
Sort
View
APPROX
2010
Springer
132views Algorithms» more  APPROX 2010»
14 years 11 months ago
Relativized Worlds without Worst-Case to Average-Case Reductions for NP
We prove that relative to an oracle, there is no worst-case to average-case reduction for NP. We also handle classes that are somewhat larger than NP, as well as worst-case to err...
Thomas Watson
AAAI
2000
14 years 11 months ago
A Demand-Driven Algorithm for Generating Minimal Models
The task of generating minimal models of a knowledge base is a significant computational problem in artificial intelligence. This task is at the computational heart of diagnosis s...
Rachel Ben-Eliyahu-Zohary
SIAMCOMP
2008
84views more  SIAMCOMP 2008»
14 years 9 months ago
Resolution Is Not Automatizable Unless W[P] Is Tractable
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
Michael Alekhnovich, Alexander A. Razborov
DLT
2009
14 years 7 months ago
Subshifts, Languages and Logic
We study the Monadic Second Order (MSO) Hierarchy over infinite pictures, that is tilings. We give a characterization of existential MSO in terms of tilings and projections of tili...
Emmanuel Jeandel, Guillaume Theyssier
CONCUR
2004
Springer
15 years 3 months ago
Message-Passing Automata Are Expressively Equivalent to EMSO Logic
Abstract. We study the expressiveness of finite message-passing automata with a priori unbounded FIFO channels and show them to capture exactly the class of MSC languages that are...
Benedikt Bollig, Martin Leucker