Sciweavers

86 search results - page 10 / 18
» Automatic Generation of Propagation Rules for Finite Domains
Sort
View
ENTCS
2008
85views more  ENTCS 2008»
13 years 7 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset
VL
1992
IEEE
163views Visual Languages» more  VL 1992»
13 years 11 months ago
The Conversion of Diagrams to Knowledge Bases
If future electronic documents are to be truly useful, we must devise ways to automatically turn them into knowledgebases. In particular, we must be able to do this for diagrams. ...
Robert P. Futrelle
ICMCS
2005
IEEE
145views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Error Resilient Multiple Description Coding Based on Wavelet Tree Coding and EREC for Wireless Networks
In this paper, we propose an integrated error resilient MDC scheme for wireless networks with both packet loss and random bit errors. Two descriptions are first generated independ...
Daewon Song, Lei Cao, Chang Wen Chen
KBSE
1999
IEEE
13 years 11 months ago
Controlled Natural Language Can Replace First-Order Logic
Many domain specialists are not familiar or comfortable with formal notations and formal tools like theorem provers or model generators. To address this problem we developed Attem...
Norbert E. Fuchs, Uta Schwertel, Sunna Torge
ISMB
1993
13 years 8 months ago
Knowledge-Based Generation of Machine-Learning Experiments: Learning with DNA Crystallography Data
Thoughit has been possible in the past to learn to predict DNAhydration patterns from crystallographic data, there is ambiguity in the choice of training data (both in terms of th...
Dawn M. Cohen, Casimir A. Kulikowski, Helen Berman