2962 search results - page 311 / 593 » Reasoning on Association Rules |
166
click to vote
LPNMR
1999
Springer
15 years 11 months ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
153
click to vote
ICLP
1998
Springer
15 years 11 months ago
1998
Springer
The eld of theory update has seen some improvement, in what regards updating, by allowing desired updates to be speci ed by update programs. The updating of models is governed by ...
220
click to vote
ICLP
1994
Springer
15 years 10 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
194
click to vote
CSL
1992
Springer
15 years 10 months ago
1992
Springer
We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...
205
click to vote
DSOM
2006
Springer
15 years 10 months ago
2006
Springer
Firewalls are important perimeter security mechanisms that imple-ment an organisation's network security requirements and can be notoriously difficult to configure correctly. ...