Sciweavers

4401 search results - page 291 / 881
» Computing with Default Logic
Sort
View
CADE
2002
Springer
16 years 7 months ago
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
Eugene Goldberg
FSKD
2007
Springer
354views Fuzzy Logic» more  FSKD 2007»
16 years 23 days ago
Using Fuzzy-Word Correlation Factors to Compute Document Similarity Based on Phrase Matching
One of the Web information Retrieval (IR) problems these days is to identify redundant information that exist in (replicated) Web documents. These documents can easily be found in...
Jun won Lee, Yiu-Kai Ng
HICSS
2003
IEEE
142views Biometrics» more  HICSS 2003»
15 years 12 months ago
Evolution of a Knowledge Focused Computer Supported Learning System by Ensuring Extensibility through Generalization and Replica
If sufficient attention is not paid to the information models on which Learning Platforms are based the ability to deliver rich functionality is hindered. This paper describes the...
David White, Lesley A. Gardner, Don Sheridan
IADIS
2004
15 years 8 months ago
A Framework for Symbolic Distributed Computer-Aided Design over the Internet
Economical globalization and outsourcing have inspired the surge of research in distributed computer-aided design. This paper presents a framework for Internet-based symbolic dist...
Yingcai Xiao, Shivakumar Kubendrachari
JIIS
2008
89views more  JIIS 2008»
15 years 6 months ago
A note on phase transitions and computational pitfalls of learning from sequences
An ever greater range of applications call for learning from sequences. Grammar induction is one prominent tool for sequence learning, it is therefore important to know its proper...
Antoine Cornuéjols, Michèle Sebag