Sciweavers

1941 search results - page 49 / 389
» On the Hardness of Approximate Reasoning
Sort
View
IJAR
2008
95views more  IJAR 2008»
14 years 12 months ago
Rule reduction for efficient inferencing in similarity based reasoning
The two most important models of inferencing in approximate reasoning with fuzzy sets are Zadeh's Compositional Rule of Inference (CRI) and Similarity Based Reasoning (SBR). ...
Balasubramaniam Jayaram
DALT
2010
Springer
14 years 6 months ago
Executing Specifications of Social Reasoning Agents
Social reasoning theories, whilst studied extensively in the area of multiagent systems, are hard to implement directly in agents. They often specify properties of beliefs or behav...
Iain Wallace, Michael Rovatsos
TALG
2010
101views more  TALG 2010»
14 years 10 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
FCT
2003
Springer
15 years 5 months ago
Complexity of Approximating Closest Substring Problems
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
Patricia A. Evans, Andrew D. Smith
FUIN
2007
123views more  FUIN 2007»
14 years 11 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