15777 search results - page 3045 / 3156 » The Reformulation-Optimization Software Engine |
141
Voted
FSTTCS
2010
Springer
15 years 18 days ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
138
click to vote
FSTTCS
2010
Springer
15 years 18 days ago
2010
Springer
Uniqueness of normal forms (UN= ) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently ...
127
Voted
FSTTCS
2010
Springer
15 years 18 days ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
106
Voted
FSTTCS
2010
Springer
15 years 18 days ago
2010
Springer
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...
119
Voted
FSTTCS
2010
Springer
15 years 18 days ago
2010
Springer
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...