2962 search results - page 226 / 593 » Reasoning on Association Rules |
159
click to vote
TPHOL
2005
IEEE
16 years 6 days ago
2005
IEEE
We discuss methods for dealing effectively with let-bindings in proofs. Our contribution is a small set of unconditional rewrite rules, found by the bracket abstraction translatio...
133
click to vote
ICAIL
2007
ACM
15 years 10 months ago
2007
ACM
This paper proposes some variants of Temporal Defeasible Logic (TDL) to reason about normative modifications. These variants make it possible to differentiate cases in which, for ...
134
click to vote
BIRTHDAY
2000
Springer
15 years 10 months ago
2000
Springer
Various forms of assumption/commitment specifications have been used to specify and reason about the interference that comes from concurrent execution; in particular, consistent a...
184
click to vote
LREC
2008
15 years 8 months ago
2008
This presentation focuses on the semi-automatic extension of Arabic WordNet (AWN) using lexical and morphological rules and applying Bayesian inference. We briefly report on the c...
172
click to vote
RR
2007
Springer
16 years 22 days ago
2007
Springer
The well-founded semantics (WFS) for logic programs is one of the few major paradigms for closed-world reasoning. With the advent of the Semantic Web, it is being used as part of r...