Sciweavers

128 search results - page 9 / 26
» Logical Data Independence Reconsidered (Extended Abstract)
Sort
View
LPAR
2000
Springer
15 years 3 months ago
Efficient Structural Information Analysis for Real CLP Languages
We present the rational construction of a generic domain for structural information analysis of real CLP languages called Pattern(D ), where the parameter D is an abstract domain s...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
120
Voted
ICONIP
2007
15 years 29 days ago
Discovery of Linear Non-Gaussian Acyclic Models in the Presence of Latent Classes
Abstract. An effective way to examine causality is to conduct an experiment with random assignment. However, in many cases it is impossible or too expensive to perform controlled ...
Shohei Shimizu, Aapo Hyvärinen
CORR
2006
Springer
119views Education» more  CORR 2006»
14 years 11 months ago
Calculating modules in contextual logic program refinement
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
Robert Colvin, Ian J. Hayes, Paul A. Strooper
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
14 years 9 months ago
Classification with Sums of Separable Functions
Abstract. We present a novel approach for classification using a discretised function representation which is independent of the data locations. We construct the classifier as a su...
Jochen Garcke
LPAR
1999
Springer
15 years 3 months ago
Practical Reasoning for Expressive Description Logics
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
Ian Horrocks, Ulrike Sattler, Stephan Tobies