Sciweavers

20 search results - page 3 / 4
» Conjunctive Grammars with Restricted Disjunction
Sort
View
ICDT
2010
ACM
141views Database» more  ICDT 2010»
13 years 10 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
CLEF
2004
Springer
13 years 11 months ago
Question Answering Pilot Task at CLEF 2004
A Pilot Question Answering Task has been activated in the Cross-Language Evaluation Forum 2004 with a twofold objective. In the first place, the evaluation of Question Answering ...
Jesús Herrera, Anselmo Peñas, Felisa...
SLP
1989
87views more  SLP 1989»
13 years 7 months ago
Partial Evaluation in Prolog: Some Improvements about Cut
Two main aspects of Partial Evaluation for Prolog programs are considered: treatment of cuts and control of recursion. The analysis about cut is exhaustive: we consider occurrence...
Michele Bugliesi, F. Russo
AIML
2004
13 years 7 months ago
Complexity of Strict Implication
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
Félix Bou
DLOG
2007
13 years 8 months ago
Speeding up Approximation with Nicer Concepts
Abstract. Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] ...
Anni-Yasmin Turhan, Yusri Bong