Sciweavers

30 search results - page 3 / 6
» Minimal Belief Change and Pareto-Optimality
Sort
View
AAAI
2008
14 years 12 months ago
Argument Theory Change Applied to Defeasible Logic Programming
In this article we work on certain aspects of the belief change theory in order to make them suitable for argumentation systems. This approach is based on Defeasible Logic Program...
Martín O. Moguillansky, Nicolás D. R...
CISS
2010
IEEE
14 years 1 months ago
Unconstrained minimization of quadratic functions via min-sum
—Gaussian belief propagation is an iterative algorithm for computing the mean of a multivariate Gaussian distribution. Equivalently, the min-sum algorithm can be used to compute ...
Nicholas Ruozzi, Sekhar Tatikonda
76
Voted
ECAI
2008
Springer
14 years 11 months ago
Belief Revision through Forgetting Conditionals in Conditional Probabilistic Logic Programs
Abstract. In this paper, we present a revision strategy of revising a conditional probabilistic logic program (PLP) when new information is received (which is in the form of probab...
Anbu Yue, Weiru Liu
ECAI
2008
Springer
14 years 11 months ago
A Formal Approach for RDF/S Ontology Evolution
Abstract. In this paper, we consider the problem of ontology evolution in the face of a change operation. We devise a general-purpose algorithm for determining the effects and side...
George Konstantinidis, Giorgos Flouris, Grigoris A...
75
Voted
AI
2011
Springer
14 years 4 months ago
Contracting preference relations for database applications
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding sele...
Denis Mindolin, Jan Chomicki