86 search results - page 13 / 18 » Question Answering Using Constraint Satisfaction: QA-By-Doss... |
AAAI
1996
13 years 8 months ago
1996
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...
CADE
2005
Springer
14 years 7 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
IJCAI
2007
13 years 9 months ago
2007
Automating the task of scoring handwritten student essays is a challenging problem of AI. The goal is to assign scores which are comparable to those of human scorers even though b...
SIAMCOMP
2000
13 years 7 months ago
2000
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
CSCWD
2001
Springer
13 years 12 months ago
2001
Springer
The authors have developed a new approach to database interoperability using the sketch data model. That technique has now been used in a number of applications, but an important ...