Sciweavers

2981 search results - page 134 / 597
» Answer Set Planning
Sort
View
105
Voted
IJCAI
2007
15 years 4 months ago
On Mining Closed Sets in Multi-Relational Data
We investigate the problem of mining closed sets in multi-relational databases. Previous work introduced different semantics and associated algorithms for mining closed sets in mu...
Gemma C. Garriga, Roni Khardon, Luc De Raedt
109
Voted
PODS
2006
ACM
177views Database» more  PODS 2006»
16 years 3 months ago
Equivalence of queries combining set and bag-set semantics
The query equivalence problem has been studied extensively for set-semantics and, more recently, for bag-set semantics. However, SQL queries often combine set and bag-set semantic...
Sara Cohen
135
Voted
ICTAI
2006
IEEE
15 years 9 months ago
Computing Horn Strong Backdoor Sets Thanks to Local Search
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
Lionel Paris, Richard Ostrowski, Pierre Siegel, La...
140
Voted
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
15 years 7 months ago
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
Leonardo Ribeiro, Theo Härder
144
Voted
ICTAI
2002
IEEE
15 years 8 months ago
On Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
Amol Dattatraya Mali