Sciweavers

7868 search results - page 84 / 1574
» Learning by Answer Sets
Sort
View
TREC
2004
15 years 5 months ago
THUIR at TREC 2004: QA
In this paper, we describe ideas and related experiments of Tsinghua University IR group in TREC 2004 QA track. In this track, our system consists three components: Question analy...
Wei Tan 0002, Qunxiu Chen, Shaoping Ma
LOGCOM
2008
104views more  LOGCOM 2008»
15 years 4 months ago
Testing the Reasoning for Question Answering Validation
Question Answering (QA) is a task that deserves more collaboration between Natural Language Processing (NLP) and Knowledge Representation (KR) communities, not only to introduce r...
Anselmo Peñas, Álvaro Rodrigo, Valen...
JAPLL
2010
179views more  JAPLL 2010»
15 years 2 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
JMLR
2002
89views more  JMLR 2002»
15 years 3 months ago
The Set Covering Machine
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
Mario Marchand, John Shawe-Taylor
ICLP
2009
Springer
16 years 4 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...