210 search results - page 9 / 42 » Universal Booleanization of Constraint Models |
CIE
2008
Springer
14 years 11 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...
AAAI
1997
15 years 29 days ago
1997
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
118
Voted
AB
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. A well-known discrete approach to modeling biological regulatory networks is the logical framework developed by R. Thomas. The network structure is captured in an interac...
106
click to vote
TREC
2008
15 years 1 months ago
2008
In the TREC 2008, the team from the State University of New York at Buffalo participated in the Legal track and the Blog track. For the Legal track, we worked on the interactive s...
EMNLP
2010
14 years 9 months ago
2010
We present an approach to grammar induction that utilizes syntactic universals to improve dependency parsing across a range of languages. Our method uses a single set of manually-...