Sciweavers

1802 search results - page 218 / 361
» Model-based Theory Combination
Sort
View
FSS
2008
145views more  FSS 2008»
13 years 10 months ago
A logic programming framework for possibilistic argumentation: Formalization and logical properties
In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has s...
Teresa Alsinet, Carlos Iván Chesñeva...
FSS
2008
108views more  FSS 2008»
13 years 10 months ago
A collaborative recommender system based on probabilistic inference from fuzzy observations
The problem of building recommender systems has attracted considerable attention in recent years. The objective of this paper is to automatically suggest and rank a list of new it...
Luis M. de Campos, Juan M. Fernández-Luna, ...
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
13 years 10 months ago
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics
A "hybrid method", dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singulari...
Philippe Flajolet, Éric Fusy, Xavier Gourdo...
CORR
2007
Springer
114views Education» more  CORR 2007»
13 years 10 months ago
Design: One, but in different forms
This paper defends an augmented cognitively oriented "generic-design hypothesis": There are both significant similarities between the design activities implemented in sit...
Willemien Visser
IPL
2006
88views more  IPL 2006»
13 years 10 months ago
A note on the attractor-property of infinite-state Markov chains
In the past 5 years, a series of verification algorithms has been proposed for infinite Markov chains that have a finite attractor, i.e., a set that will be visited infinitely oft...
Christel Baier, Nathalie Bertrand, Ph. Schnoebelen