Sciweavers

17366 search results - page 138 / 3474
» New Revision Algorithms
Sort
View
141
Voted
FLAIRS
2007
15 years 6 months ago
Compositional Belief Update
In this paper we explore a class of belief update operators, in which the definition of the operator is compositional with respect to the sentence to be added. The goal is to pro...
James P. Delgrande, Francis Jeffry Pelletier, Matt...
99
Voted
STOC
2006
ACM
78views Algorithms» more  STOC 2006»
16 years 4 months ago
A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs
Andris Ambainis, Robert Spalek, Ronald de Wolf
ECSQARU
2005
Springer
15 years 9 months ago
Multiple Semi-revision in Possibilistic Logic
Semi-revision is a model of belief change that differs from revision in that a new formula is not always accepted. Later, Fuhrmann defined multiple semi-revision by replacing a n...
Guilin Qi, Weiru Liu, David A. Bell
SEMWEB
2010
Springer
15 years 1 months ago
Evolution of DL - Lite Knowledge Bases
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Dm...
134
Voted
TSMC
2002
102views more  TSMC 2002»
15 years 3 months ago
Generalized pursuit learning schemes: new families of continuous and discretized learning automata
The fastest learning automata (LA) algorithms currently available fall in the family of estimator algorithms introduced by Thathachar and Sastry [24]. The pioneering work of these ...
M. Agache, B. John Oommen