Sciweavers

509 search results - page 49 / 102
» On the completeness of compositional reasoning methods
Sort
View
CAV
1998
Springer
103views Hardware» more  CAV 1998»
14 years 1 months ago
You Assume, We Guarantee: Methodology and Case Studies
Assume-guarantee reasoning has long been advertised as an important method for decomposing proof obligations in system veri cation. Re nement mappings (homomorphisms) have long bee...
Thomas A. Henzinger, Shaz Qadeer, Sriram K. Rajama...
SIGMOD
2006
ACM
153views Database» more  SIGMOD 2006»
14 years 9 months ago
Interactive query formulation over web service-accessed sources
Integration systems typically support only a restricted set of queries over the schema they export. The reason is that the participating information sources contribute limited con...
Michalis Petropoulos, Alin Deutsch, Yannis Papakon...
DLOG
2004
13 years 10 months ago
A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
BMCBI
2008
99views more  BMCBI 2008»
13 years 9 months ago
Binning sequences using very sparse labels within a metagenome
Background: In metagenomic studies, a process called binning is necessary to assign contigs that belong to multiple species to their respective phylogenetic groups. Most of the cu...
Chon-Kit Kenneth Chan, Arthur L. Hsu, Saman K. Hal...
COLING
2008
13 years 10 months ago
Exact Inference for Multi-label Classification using Sparse Graphical Models
This paper describes a parameter estimation method for multi-label classification that does not rely on approximate inference. It is known that multi-label classification involvin...
Yusuke Miyao, Jun-ichi Tsujii