Sciweavers

1546 search results - page 206 / 310
» Context-Aware Computing with Sound
Sort
View
151
Voted
AAAI
1998
15 years 7 months ago
A Non-Deterministic Semantics for Tractable Inference
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
James M. Crawford, David W. Etherington
ACL
1998
15 years 7 months ago
Dialect MT: A Case Study between Cantonese and Mandarin
Machine Translation (MT) need not be confined to inter-language activities. In this paper, we discuss inter-dialect MT in general and Cantonese-Mandarin MT in particular. Mandarin...
Xiaoheng Zhang
IWFM
1998
15 years 7 months ago
Strictly Level-Decreasing Logic Programs
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
Anthony Karel Seda, Pascal Hitzler
CORR
2008
Springer
170views Education» more  CORR 2008»
15 years 5 months ago
Fast Wavelet-Based Visual Classification
We investigate a biologically motivated approach to fast visual classification, directly inspired by the recent work [13]. Specifically, trading-off biological accuracy for comput...
Guoshen Yu, Jean-Jacques E. Slotine
151
Voted
JAIR
2006
106views more  JAIR 2006»
15 years 5 months ago
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable for...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...