Sciweavers

670 search results - page 15 / 134
» Inclusion-Based Approximate Reasoning
Sort
View
TALG
2010
101views more  TALG 2010»
13 years 6 months ago
Reasoning about online algorithms with weighted automata
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
Benjamin Aminof, Orna Kupferman, Robby Lampert
FUIN
2007
123views more  FUIN 2007»
13 years 7 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc
DAGSTUHL
1990
13 years 8 months ago
Integrating Rules and Connectionism for Robust Reasoning
A connectionist model for robust reasoning, CONSYDERR, is proposed to account for some common reasoning patterns found in commonsense reasoning and to remedy the brittleness probl...
Ron Sun
APPML
2007
47views more  APPML 2007»
13 years 7 months ago
Existence and bounds for the half-moment entropy approximation to radiative transfer
We establish existence, uniqueness and a priori bounds for the half moment entropy approximation to radiative heat transfer. The bounds are physically reasonable and underline the...
Martin Frank, René Pinnau
LPNMR
2005
Springer
14 years 1 months ago
An Algebraic Account of Modularity in ID-Logic
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this lo...
Joost Vennekens, Marc Denecker