1998 search results - page 147 / 400 » Basic Association Rules |
101
Voted
CPAIOR
2005
Springer
15 years 8 months ago
2005
Springer
Creating good integer programming formulations had, as a basic axiom, the rule “Find formulations with tighter linear relaxations”. This rule, while useful when using unsophist...
144
Voted
IJCNLP
2005
Springer
15 years 8 months ago
2005
Springer
Temporal information is useful in many NLP applications, such as information extraction, question answering and summarization. In this paper, we present a temporal parser for extra...
139
Voted
ASP
2003
Springer
15 years 7 months ago
2003
Springer
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...
146
Voted
ECAI
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Defeasible reasoning is a direction in nonmonotonic reasoning that is based on the use of rules that may be defeated by other rules. It is a simple, but often more effic...
137
click to vote
AISC
1992
Springer
15 years 6 months ago
1992
Springer
Abstract. An important feature of modern computer algebra systems is the support of a rich type system with the possibility of type inference. Basic features of such a type system ...