2099 search results - page 410 / 420 » Similarity for Conceptual Querying |
201
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
187
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
167
Voted
WADS
1989
Springer
15 years 10 months ago
1989
Springer
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
179
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
162
click to vote
FQAS
2006
Springer
15 years 10 months ago
2006
Springer
Action rules introduced in [12] and extended further to e-action rules [21] have been investigated in [22], [13], [20]. They assume that attributes in a database are divided into t...