561 search results - page 1 / 113 » A Strategy for the Computation of Conditional Answers |
ECAI
1992
Springer
13 years 9 months ago
1992
Springer
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
EPIA
1993
Springer
13 years 9 months ago
1993
Springer
A uniform framework is presented to describe the most typical strategies that are used to compute answers to Deductive Databases. The framework is based on the definition of a ge...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
ENTCS
2008
13 years 5 months ago
2008
Defence trees are used to represent attack and defence strategies in security scenarios; the aim in such scenarios is to select the best set of countermeasures that are able to st...
ACL
2009
13 years 2 months ago
2009
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...