Sciweavers

500 search results - page 55 / 100
» Quantified Conditionals and Compositionality
Sort
View
UAI
1996
13 years 9 months ago
Learning Bayesian Networks with Local Structure
In this paper we examine a novel addition to the known methods for learning Bayesian networks from data that improves the quality of the learned networks. Our approach explicitly ...
Nir Friedman, Moisés Goldszmidt
JANCL
2008
170views more  JANCL 2008»
13 years 7 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
AINA
2010
IEEE
13 years 5 months ago
TCP Testing: How Well Does ns2 Match Reality?
New transport protocols continue to appear as alternatives to the Transmission Control Protocol (TCP). Many of these are are designed to address TCP's inefficiency in operatin...
Martin Bateman, Saleem N. Bhatti
ICST
2011
IEEE
12 years 11 months ago
Applying aggressive propagation-based strategies for testing changes
—Test-suite augmentation for evolving software— the process of augmenting a test suite to adequately test software changes—is necessary for any program that undergoes modifi...
Raúl A. Santelices, Mary Jean Harrold
JELIA
1990
Springer
13 years 12 months ago
Semantic Interpretation as Higher-Order Deduction
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
Fernando C. N. Pereira