86 search results - page 4 / 18 » Question Answering Using Constraint Satisfaction: QA-By-Doss... |
WILF
2009
Springer
14 years 2 months ago
2009
Springer
A number of generalizations of answer set programming have been proposed in the literature to deal with vagueness, uncertainty, and partial rule satisfaction. We introduce a unifyi...
AIPS
2000
13 years 8 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
FLAIRS
2004
13 years 8 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
TREC
2001
13 years 8 months ago
2001
CL Research's question-answering system (DIMAP-QA) for TREC-10 only slightly extends its semantic relation triple (logical form) technology in which documents are fully parse...
MM
2003
ACM
14 years 21 days ago
2003
ACM
When querying a news video archive, the users are interested in retrieving precise answers in the form of a summary that best answers the query. However, current video retrieval s...