We present a new algorithm for mining frequent itemsets. Past studies have proposed various algorithms and techniques for improving the efficiency of the mining task. We integrate a combination of these techniques into an algorithm which utilize those techniques dynamically according to the input dataset. The algorithm main features include depth first search with vertical compressed database, ...

1474-0346/$ see front matter 2009 Elsevier Ltd. A doi:10.1016/j.aei.2009.08.007 q This work is partially supported by Grants from t (2005-3642, 2005-4050), the Swedish Aeronautics S4203), the SSF Strategic Research Center MOVIII, th Linnaeus Center CADICS, and the Center for Indust CENIIT (06.09). * Corresponding author. Tel.: +46 7

Semantic attachment is provided by FOL as a means for associating model values (i.e. LISP code) to symbols of a first order language. This paper presents an algorithm that automatically generates semantic attachments in FOL and discusses the advantages deriving from its use.

Ordinary first-order logic has the property that two formulas φ and ψ have the same meaning in a structure if and only if the formula φ ↔ ψ is true in the structure. We prove that independence-friendly logic does not have this property. §

A method for encoding formulas in rst-order logic with equality into some equational logics and their associated propositional logics is presented. This yields some new strategies for theorem-proving in rst-order logic with equality. We outline the techniques and give a simple illustration of their use.

Solving equations is one of the main themes in mathematics. A large part of the combinatorial group theory revolves around the word and conjugacy problems particular types of equations in groups. Whether a given equation has a solution in a given group is, as a rule, a non-trivial problem. A more general and more difficult problem is to decide which formulas of the first-order logic hold in a g...

We consider the restriction of first–order logic to models, called pseudo– finite, with the property that every first–order sentence true in the model is true in a finite model. We argue that this is a good framework for studying first-order logic on finite structures. We prove a Lindström Theorem for extensions of first order logic on pseudo-finite structures.

This paper presents a theory that supports commonsense, qualitative reasoning about the flow of liquid around slowly moving solid objects; specifically, inferring that liquid can be poured from one container to another, given only qualitative information about the shapes and motions of the containers. It shows how the theory and the problem specification can be expressed in a first-order langua...

In this paper we take a general look at forward pruning in tree search. By identifying what we think are desirable characteristics of pruning heuristics, and what attributes are important for them to consider, we hope to understand better the shortcomings of existing techniques, and to provide some additional insight into how they can be improved. We view this work as a first step towards the g...

The purpose of this study was to examine coaches' preferences for continuing coaching education. The sample consisted of 122 male and 102 female coaches from the Gauteng Province of South Africa who were purposively recruited to participate in this study. The results of this study showed that the coaches wanted to learn more about motivational techniques, advanced instructional drills, advanced...