Sciweavers

7289 search results - page 112 / 1458
» A Dependent Set Theory
Sort
View
ASP
2001
Springer
13 years 11 months ago
Learning by Answer Sets
This paper presents a novel application of answer set programming to concept learning in nonmonotonic logic programs. Given an extended logic program as a background theory, we in...
Chiaki Sakama
ACST
2006
13 years 9 months ago
An efficient search algorithm for partially ordered sets
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
Yan Chen
APAL
1998
121views more  APAL 1998»
13 years 7 months ago
Computably Enumerable Sets and Quasi-Reducibility
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
Rodney G. Downey, Geoffrey LaForte, André N...
TCS
2002
13 years 7 months ago
Martin's game: a lower bound for the number of sets
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...
M. Ageev
GC
2010
Springer
13 years 6 months ago
Intriguing Sets of Vertices of Regular Graphs
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...
Bart De Bruyn, Hiroshi Suzuki