135 search results - page 7 / 27 » Automated Question Answering: Review of the Main Approaches |
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
KR
2004
Springer
14 years 1 months ago
2004
Springer
The main contribution of this paper is the definition of the preference description language ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
KR
2010
Springer
13 years 11 months ago
2010
Springer
The DL-Lite family of Description Logics has been designed with the specific goal of allowing for answering complex queries (in particular, conjunctive queries) over ontologies w...
TABLEAUX
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The clause linking technique of Lee and Plaisted proves the unsatisfiability of a set of first-order clauses by generating a sufficiently large set of instances of thes...