1998 search results - page 209 / 400 » Basic Association Rules |
121
click to vote
ECML
2007
Springer
15 years 10 months ago
2007
Springer
A general game player is an agent capable of taking as input a description of a game’s rules in a formal language and proceeding to play without any subsequent human input. To do...
136
click to vote
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...
134
click to vote
RR
2007
Springer
15 years 10 months 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...
135
click to vote
LAWEB
2006
IEEE
15 years 10 months ago
2006
IEEE
This work describes an approach for the semi-automatic learning object metadata markup of course’s web pages and their posterior extraction into Scorm Packages. This is identifi...
141
click to vote
FOSSACS
2005
Springer
15 years 9 months 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...