Results 1  10
of
344,806
SLDResolution with Reflection
, 1995
"... The aim of this thesis is to define a procedural and declarative semantics of SLDresolution with reflection, in the general framework defined by Jaffar et al. This scheme is in fact general enough to constitute a ground work suitable for (i) the possible integration of metaprogramming and constrain ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The aim of this thesis is to define a procedural and declarative semantics of SLDresolution with reflection, in the general framework defined by Jaffar et al. This scheme is in fact general enough to constitute a ground work suitable for (i) the possible integration of metaprogramming
Sound and complete sldresolution for bilatticebased annotated logic programs
 In Proceedings of the International Conference INFORMATIONMFCSIT’06
"... We introduce the class of normal bilatticebased annotated firstorder logic programs (BAPs) and develop declarative and operational semantics for them. In particular, SLDresolution for these programs is defined and its soundness and completeness established. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We introduce the class of normal bilatticebased annotated firstorder logic programs (BAPs) and develop declarative and operational semantics for them. In particular, SLDresolution for these programs is defined and its soundness and completeness established.
Applying SLDResolution to a Class of NonHorn Logic Programs
 Bulletin of the IGPL
, 1994
"... Methods for dealing with a Horn logic program and one goal are wellknown and successful. Here we are concerned with treating logic programs enhanced by some negative literals using the same methods, in particular SLDresolution. We describe the approach and show its correctness. The result can be a ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Methods for dealing with a Horn logic program and one goal are wellknown and successful. Here we are concerned with treating logic programs enhanced by some negative literals using the same methods, in particular SLDresolution. We describe the approach and show its correctness. The result can
An SLDresolution calculus for basic serial multimodal logics
 Proceedings of ICTAC 2005, LNCS 3722
, 2005
"... Abstract. We develop semantics for modal logic programs in basic serial multimodal logics, which are parameterized by an arbitrary combination of generalized versions of axioms T, B, 4,5(intheform,e.g., 4:✷iϕ → ✷j✷kϕ) andI: ✷iϕ → ✷jϕ. We do not assume any special restriction for the form of programs ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
of programs and goals. Our fixpoint semantics and SLDresolution calculus are defined using the direct approach and closely reflect the axioms of the used modal logic. We prove that our SLDresolution calculus is sound and complete. 1
AgentSpeak(L): BDI Agents speak out in a logical computable language
, 1996
"... BeliefDesireIntention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theoremprov ..."
Abstract

Cited by 509 (2 self)
 Add to MetaCart
theoretic semantics of a language AgentSpeak(L). This language can be viewed as an abstraction of one of the implemented BDI systems (i.e., PRS) and allows agent programs to be written and interpreted in a manner similar to that of hornclause logic programs. We show how to perform derivations in this logic using a
FAST VOLUME RENDERING USING A SHEARWARP FACTORIZATION OF THE VIEWING TRANSFORMATION
, 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that req ..."
Abstract

Cited by 541 (2 self)
 Add to MetaCart
that require on the order of 100 seconds to render typical data sets on a workstation. Algorithms with optimizations that exploit coherence in the data have reduced rendering times to the range of ten seconds but are still not fast enough for interactive visualization applications. In this thesis we present a
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
 Advances in Neural Information Processing Systems 14
, 2001
"... Drawing on the correspondence between the graph Laplacian, the LaplaceBeltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motivated algorithm for constructing a representation for data sampled from a low dimensional manifold embedded in a higher ..."
Abstract

Cited by 664 (8 self)
 Add to MetaCart
higher dimensional space. The algorithm provides a computationally efficient approach to nonlinear dimensionality reduction that has locality preserving properties and a natural connection to clustering. Several applications are considered.
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
tree
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
A Syntactic Approach to Type Soundness
 INFORMATION AND COMPUTATION
, 1992
"... We present a new approach to proving type soundness for Hindley/Milnerstyle polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification of the la ..."
Abstract

Cited by 634 (25 self)
 Add to MetaCart
We present a new approach to proving type soundness for Hindley/Milnerstyle polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification
Results 1  10
of
344,806