11345 search results - page 1697 / 2269 » Foundations of Computer Science |
180
Voted
LPAR
2005
Springer
15 years 12 months ago
2005
Springer
We propose to build an automated reasoning system for first-order logic (FOL) by translating reasoning problems to a fragment of FOL called coherent logic (CL) and then solving t...
167
click to vote
MFCS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
148
click to vote
MFCS
2005
Springer
15 years 12 months ago
2005
Springer
We show the following results regarding complete sets. • NP-complete sets and PSPACE-complete sets are many-one autoreducible. • Complete sets of any level of PH, MODPH, or th...
127
click to vote
MFCS
2005
Springer
15 years 12 months ago
2005
Springer
We prove that every disjoint NP-pair is polynomial-time, many-one equivalent to the canonical disjoint NP-pair of some propositional proof system. Therefore, the degree structure ...
122
Voted
MFCS
2005
Springer
15 years 12 months ago
2005
Springer
The online squarefree recognition problem is to detect the first occurrence of a square in a string whose characters are provided as input one at a time. We present an efficient a...