Sciweavers

286 search results - page 31 / 58
» Reasoning about multiple related abstractions with MultiStar
Sort
View
ADMA
2006
Springer
143views Data Mining» more  ADMA 2006»
15 years 1 months ago
Robust Collective Classification with Contextual Dependency Network Models
Abstract. In order to exploit the dependencies in relational data to improve predictions, relational classification models often need to make simultaneous statistical judgments abo...
YongHong Tian, Tiejun Huang, Wen Gao
PLDI
2012
ACM
13 years 3 days ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
POPL
2009
ACM
15 years 10 months ago
Lazy evaluation and delimited control
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
Ronald Garcia, Andrew Lumsdaine, Amr Sabry
CSL
2003
Springer
15 years 2 months ago
Generating All Abductive Explanations for Queries on Propositional Horn Theories
Abstract. Abduction is a fundamental mode of reasoning, which has taken on increasing importance in Artificial Intelligence (AI) and related disciplines. Computing abductive expla...
Thomas Eiter, Kazuhisa Makino
98
Voted
ISF
2007
105views more  ISF 2007»
14 years 9 months ago
COSMO: A conceptual framework for service modelling and refinement
This paper presents a conceptual framework for service modelling and refinement, called the COSMO (COnceptual Service MOdelling) framework. This framework provides concepts to mode...
Dick A. C. Quartel, Maarten W. A. Steen, Stanislav...