Sciweavers

426 search results - page 23 / 86
» Possibilistic Stable Model Computing
Sort
View
ECSQARU
2009
Springer
14 years 2 months ago
Merging Belief Bases Represented by Logic Programs
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
Julien Hué, Odile Papini, Eric Würbel
AUTOMATICA
2007
68views more  AUTOMATICA 2007»
13 years 7 months ago
Frequency domain maximum likelihood estimation of linear dynamic errors-in-variables models
- This paper studies the linear dynamic errors-in-variables problem in the frequency domain. First the identifiability is shown under relaxed conditions. Next a frequency domain Ga...
Rik Pintelon, Johan Schoukens
LPNMR
2007
Springer
14 years 1 months ago
Head-Elementary-Set-Free Logic Programs
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
Martin Gebser, Joohyung Lee, Yuliya Lierler
DAC
2002
ACM
14 years 8 months ago
Guaranteed passive balancing transformations for model order reduction
The major concerns in state-of-the-art model reduction algorithms are: achieving accurate models of sufficiently small size, numerically stable and efficient generation of the mod...
Joel R. Phillips, Luca Daniel, Luis Miguel Silveir...
DAGM
2006
Springer
13 years 11 months ago
Shape Matching by Variational Computation of Geodesics on a Manifold
Abstract. Klassen et al. [9] recently developed a theoretical formulation to model shape dissimilarities by means of geodesics on appropriate spaces. They used the local geometry o...
Frank R. Schmidt, Michael Clausen, Daniel Cremers