Sciweavers

3134 search results - page 15 / 627
» Computing full disjunctions
Sort
View
SAC
2002
ACM
15 years 2 months ago
Hyperrelations in version space
A version space is a set of all hypotheses consistent with a given set of training examples, delimited by the specific boundary and the general boundary. In existing studies [5, 6...
Hui Wang, Ivo Düntsch, Günther Gediga, A...
SUM
2007
Springer
15 years 8 months ago
The Consistency Extractor System: Querying Inconsistent Databases Using Answer Set Programs
Abstract. We present the Consistency Extractor System (ConsEx) that uses answer set programming to compute consistent answers to first-order queries posed to relational databases ...
Mónica Caniupán Marileo, Leopoldo E....
131
Voted
NMR
2004
Springer
15 years 7 months ago
On acyclic and head-cycle free nested logic programs
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
Thomas Linke, Hans Tompits, Stefan Woltran
74
Voted
ICNP
1996
IEEE
15 years 6 months ago
Full Utilization, Fairness and Bounded Access Delay on High Speed Bus Networks
Angela L. Chiu, Robert G. Gallager