Results 1  10
of
3,109
Logical foundations of objectoriented and framebased languages
 JOURNAL OF THE ACM
, 1995
"... We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
Abstract

Cited by 880 (64 self)
 Add to MetaCart
We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, encapsulation, and others. In a sense, Flogic stands in the same relationship to the objectoriented paradigm as classical predicate calculus stands to relational programming. Flogic has a modeltheoretic semantics and a sound and complete resolutionbased proof theory. A small number of fundamental concepts that come from objectoriented programming have direct representation in Flogic; other, secondary aspects of this paradigm are easily modeled as well. The paper also discusses semantic issues pertaining to programming with a deductive objectoriented language based on a subset of Flogic.
Mining Frequent Patterns without Candidate Generation: A FrequentPattern Tree Approach
 DATA MINING AND KNOWLEDGE DISCOVERY
, 2004
"... Mining frequent patterns in transaction databases, timeseries databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriorilike candidate set generationandtest approach. However, candidate set generation is still co ..."
Abstract

Cited by 1700 (64 self)
 Add to MetaCart
Mining frequent patterns in transaction databases, timeseries databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriorilike candidate set generationandtest approach. However, candidate set generation is still costly, especially when there exist a large number of patterns and/or long patterns. In this study, we propose a novel
frequentpattern tree
(FPtree) structure, which is an extended prefixtree
structure for storing compressed, crucial information about frequent patterns, and develop an efficient FPtree
based mining method, FPgrowth, for mining the complete set of frequent patterns by pattern fragment growth.
Efficiency of mining is achieved with three techniques: (1) a large database is compressed into a condensed,
smaller data structure, FPtree which avoids costly, repeated database scans, (2) our FPtreebased mining adopts
a patternfragment growth method to avoid the costly generation of a large number of candidate sets, and (3) a
partitioningbased, divideandconquer method is used to decompose the mining task into a set of smaller tasks for
mining confined patterns in conditional databases, which dramatically reduces the search space. Our performance
study shows that the FPgrowth method is efficient and scalable for mining both long and short frequent patterns,
and is about an order of magnitude faster than the Apriori algorithm and also faster than some recently reported
new frequentpattern mining methods
Representing Action and Change by Logic Programs
 Journal of Logic Programming
, 1993
"... We represent properties of actions in a logic programming language that uses both classical negation and negation as failure. The method is applicable to temporal projection problems with incomplete information, as well as to reasoning about the past. It is proved to be sound relative to a semantics ..."
Abstract

Cited by 425 (26 self)
 Add to MetaCart
We represent properties of actions in a logic programming language that uses both classical negation and negation as failure. The method is applicable to temporal projection problems with incomplete information, as well as to reasoning about the past. It is proved to be sound relative to a
Exact Sampling From AntiMonotone Systems
 Statistica Neerlandica
, 1998
"... A new approach to Markov chain Monte Carlo simulation was recently proposed by Propp and Wilson. This approach, unlike traditional ones, yields samples which have exactly the desired distribution. The ProppWilson algorithm requires this distribution to have a certain structure called monotonicity. ..."
Abstract

Cited by 45 (1 self)
 Add to MetaCart
. In this paper an idea of Kendall is applied to show how the algorithm can be extended to the case where monotonicity is replaced by antimonotonicity. As illustrating examples, simulations of the hardcore model and the randomcluster model are presented.
Decomposition of Intervals in the Space of AntiMonotonic Functions
"... Abstract. With the term ’antimonotonic function’, we designate specific boolean functions on subsets of a finite set of positive integers which we call the universe. Through the wellknown bijective relationship between the set of monotonic functions and the set of antimonotonic functions, the stu ..."
Abstract
 Add to MetaCart
studies enumeration in the resulting lattice of antimonotonic functions. We define intervals of antimonotonic functions according to this order and present four properties of such intervals, Finally we give a formula for the size of a general interval and a recursion formula for the nth number
Antimonotonic Overlapgraph Support Measures
 In Proceedings of the Eighth IEEE International Conference on Data Mining
, 2008
"... In graph mining, a frequency measure is antimonotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pattern miners relies critically on this property. We study the case where the dataset is a single graph. Vanetik, Gudes and ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
In graph mining, a frequency measure is antimonotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pattern miners relies critically on this property. We study the case where the dataset is a single graph. Vanetik, Gudes
Completely inapproximable monotone and antimonotone parameterized problems
"... We prove that weighted monotone/antimonotone circuit satisfiability has no fixedparameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT 6 = W [1]. In particular, not having such an fptapproximation algorithm implies that these problems have no polynomialti ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We prove that weighted monotone/antimonotone circuit satisfiability has no fixedparameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT 6 = W [1]. In particular, not having such an fptapproximation algorithm implies that these problems have no polynomial
PERSISTENT ANTIMONOTONIC BIFURCATIONS AND STRANGE ATTRACTORS FOR CUBIC HOMOCLINIC
, 803
"... Abstract. In this paper, we study a twoparameter family {ϕµ,ν} of twodimensional diffeomorphisms such that ϕ0,0 = ϕ has a cubic homoclinic tangency unfolding generically which is associated with a dissipative saddle point. Our first theorem presents an open set O in the µνplane with Cl(O) ∋ (0, 0 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. In this paper, we study a twoparameter family {ϕµ,ν} of twodimensional diffeomorphisms such that ϕ0,0 = ϕ has a cubic homoclinic tangency unfolding generically which is associated with a dissipative saddle point. Our first theorem presents an open set O in the µνplane with Cl(O) ∋ (0, 0) such that, for any (µ0, ν0) ∈ O, there exists a oneparameter subfamily of {ϕµ,ν} passing through ϕµ0,ν0 and exhibiting cubically related persistent contactmaking and contactbreaking quadratic tangencies. Moreover, the second theorem shows that any such twoparameter family satisfies WangYoung’s conditions which guarantee that some ϕµ,ν arbitrarily near ϕ exhibits a cubic polynomiallike strange attractor with an SRB measure. One of main motivations behind studies in monotonic or nonmonotonic bifurcation phenomena is attributed to results given in MilnorThurston [23] for the logistic family, where there are only orbit creation parameters but no orbit annihilation parameters. In contrast with the logistic family, some family of onedimensional cubic
Results 1  10
of
3,109