2962 search results - page 381 / 593 » Reasoning on Association Rules |
176
click to vote
FOSSACS
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
157
click to vote
ICLP
2005
Springer
16 years 3 days ago
2005
Springer
We present a version of the CCP paradigm, which is both distributed and probabilistic. We consider networks with a fixed number of nodes, each of them possessing a local and indep...
162
click to vote
IFM
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for...
186
click to vote
PADL
2005
Springer
16 years 2 days ago
2005
Springer
We describe the design of the OLPS system, an implementation of the preferred answer set semantics for ordered logic programs. The basic algorithm we propose computes the extended ...
169
click to vote
RTA
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. For narrowing to be an efficient evaluation mechanism, several lazy narrowing strategies have been proposed, although typically for the restricted case of left-linear con...