8413 search results - page 25 / 1683 » Ordering Problem Subgoals |
CIE
2008
Springer
13 years 8 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...
CADE
2004
Springer
14 years 8 months ago
2004
Springer
EMNLP
2008
13 years 9 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...
LICS
2006
IEEE
14 years 1 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...
RTA
1998
Springer
14 years 3 days 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...