8413 search results - page 25 / 1683 » Ordering Problem Subgoals |
137
click to vote
CIE
2008
Springer
15 years 6 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
111
click to vote
EMNLP
2008
15 years 7 months ago
2008
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees t...
191
click to vote
LICS
2006
IEEE
15 years 12 months ago
2006
IEEE
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
151
click to vote
RTA
1998
Springer
15 years 10 months ago
1998
Springer
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-orde...