Sciweavers

673 search results - page 30 / 135
» Approximate coherence-based reasoning
Sort
View
JELIA
1998
Springer
15 years 4 months ago
A Logic for Anytime Deduction and Anytime Compilation
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
Frédéric Koriche
FUIN
2006
160views more  FUIN 2006»
14 years 12 months ago
Behavioral Pattern Identification Through Rough Set Modeling
This paper introduces an approach to behavioral pattern identification as a part of a study of temporal patterns in complex dynamical systems. Rough set theory introduced by Zdzisl...
Jan G. Bazan
CADE
2009
Springer
16 years 15 days ago
Beyond Dependency Graphs
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
Martin Korp, Aart Middeldorp
83
Voted
DLOG
2009
15 years 1 months ago
Which Kind of Module Should I Extract?
Abstract There are various techniques for specifying a module of an ontology that covers all knowledge about a given set of terms. These differ with respect to the size of the modu...
Ulrike Sattler, Thomas Schneider 0002, Michael Zak...
CIKM
1997
Springer
15 years 4 months ago
Block Addressing Indices for Approximate Text Retrieval
Although the issue of approximate text retrieval is gaining importance in the last years, it is currently addressed by only a few indexing schemes. To reduce space requirements, t...
Ricardo A. Baeza-Yates, Gonzalo Navarro