Discovering frequent item sets is a key problem in data mining association rules. In this paper, there is a celerity association rules method based on data sort search. Using the plenitude and call terms of frequent i...
详细信息
ISBN:
(纸本)3540283129
Discovering frequent item sets is a key problem in data mining association rules. In this paper, there is a celerity association rules method based on data sort search. Using the plenitude and call terms of frequent item sets, the method efficiency can be improved greatly for the searching time won't increase as the number of item set of the data does, moreover the data can be found by searching the database within 3 times. Using the change between the frequent item sets and standby item sets, the data celerity renew and the min-sup renew can be true.
The study of fixpoints has long been at the heart of logic programming. However, whereas least fixpoint semantics works well for SLD-refutations (i.e. is sound and complete), there is no satisfactory (i.e. complete) f...
详细信息
The study of fixpoints has long been at the heart of logic programming. However, whereas least fixpoint semantics works well for SLD-refutations (i.e. is sound and complete), there is no satisfactory (i.e. complete) fixpoint semantics for infinite derivations. In this paper, we focus on this problem. Standard approaches in this area consist in concentrating on infinite derivations that can be seen as computing, in the limit, some infinite object. This is usually done by extending the domain of computation with infinite elements and then defining the meaning of programs in terms of greatest fixpoints. The main drawback of these approaches is that the semantics defined is not complete. Hence, since defining a greatest fixpoint semantics for logic programs amounts to consider a program as a set of co-inductive definitions, we focus on this identification at a deeper level by considering infinite derivations as proof-terms in a co-inductive set. This reading leads into considering derivations as proofs rather than computations and allows one to show that for the subclass of infinite derivations over the domain of finite terms, a complete greatest fixpoint semantics can be obtained. Our main result is that the greatest fixpoint of the one-step-inference operator for the C-semantics corresponds to atoms that have a non-failing fair derivation with the additional property that complete information over a variable is obtained after finitely many steps.
We design and implement a library for adding backtracking computations to any Haskell monad. Inspired by logic programming, our library provides, in addition to the operations required by the MonadPlus interface, cons...
详细信息
Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbing heuristics in learning first-order concepts,...
详细信息
The FO(ID) logic is an extension of classical first-order logic with a uniform representation of various forms of inductive definitions. The definitions are represented as sets of rules and they are interpreted by two...
详细信息
Among the existing extensions to the basic tuple space coordination model, the tuple centre approach has been introduced to allow for the flexible programming of a tuple space behaviour, so as to encapsulate coordinat...
详细信息
ISBN:
(纸本)9781581139648
Among the existing extensions to the basic tuple space coordination model, the tuple centre approach has been introduced to allow for the flexible programming of a tuple space behaviour, so as to encapsulate coordination laws directly as behaviour of the coordination medium. In particular, the logic-based language ReSpecT has been used for programming tuple centres in the TuCSoN coordination infrastructure [11, 9]. However, among the application contexts that can be suitably engineered with agents and coordination infrastructures, some involve coordination processes where the notion of time and duration play a relevant role. Examples include distributed control systems, protocol-based interactions as in auctions, and in general all the coordination contexts where high dynamism and openness are concerned, which call for time-aware coordination artifacts supporting timed system engineering. Accordingly, in this work we discuss how the basic ReSpecT tuple centre model has been extended to support the definition and enaction of time-aware coordination policies. Several examples are provided to show the expressiveness of the language to model temporal coordination primitives and laws. Copyright 2005 ACM.
Interaction in multiagent systems is generally tackled by means of interaction protocols that define the messaging patterns between the system's communicating entities. It is thus of an utmost importance to follow...
详细信息
On one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis seems to remain a much less attractive...
详细信息
On one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis seems to remain a much less attractive subject. If we divide this line of research into two kinds of approaches: dynamic versus static analysis, this paper belongs to the latter. It proposes a criterion for detecting non-terminating atomic queries with respect to binary CLP clauses, which strictly generalizes our previous works on this subject. We give a generic operational definition and a logical form of this criterion. Then we show that the logical form is correct and complete with respect to the operational definition.
We work through a sequence of evolution scenarios for language-based functionality implemented as rule-based programs. We identify and illustrate different dimensions along which such functionality can evolve, includi...
详细信息
Critiquing is a well-known form of user feedback in case-based recommender systems. A critique encodes the users preference in relation to a particular feature. For example, in a digital camera recommender a user may ...
详细信息
暂无评论