Sciweavers

4126 search results - page 244 / 826
» Set based logic programming
Sort
View
ICDM
2005
IEEE
116views Data Mining» more  ICDM 2005»
16 years 15 hour ago
Learning Functional Dependency Networks Based on Genetic Programming
Bayesian Network (BN) is a powerful network model, which represents a set of variables in the domain and provides the probabilistic relationships among them. But BN can handle dis...
Wing-Ho Shum, Kwong-Sak Leung, Man Leung Wong
POPL
2010
ACM
16 years 3 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi
AUSAI
2007
Springer
16 years 18 days ago
Characterising Deadlines in Temporal Modal Defeasible Logic
Abstract. We provide a conceptual analysis of several kinds of deadlines, represented in Temporal Modal Defeasible Logic. The paper presents a typology of deadlines, based on the f...
Guido Governatori, Joris Hulstijn, Régis Ri...
ESOP
2006
Springer
15 years 10 months ago
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
Amal J. Ahmed
IISWC
2009
IEEE
16 years 1 months ago
Logicalization of communication traces from parallel execution
—Communication traces are integral to performance modeling and analysis of parallel programs. However, execution on a large number of nodes results in a large trace volume that i...
Qiang Xu, Jaspal Subhlok, Rong Zheng, Sara Voss