Abstract is missing.
- Consistent Query Answering: The First Ten YearsJan Chomicki. 1-3 [doi]
- Heavy Tails and Web ModelsPrabhakar Raghavan. 4 [doi]
- Managing Probabilistic Data with MystiQ: The Can-Do, the Could-Do, and the Can t-DoChristopher Ré, Dan Suciu. 5-18 [doi]
- Frequent Itemset Mining from Databases Including One Evidential AttributeMohamed Anis Bach Tobji, Boutheina Ben Yaghlane, Khaled Mellouli. 19-32 [doi]
- Evaluating Trustworthiness from Past Performances: Interval-Based ApproachesJonathan Ben-Naim, Henri Prade. 33-46 [doi]
- A Comparative Study of Six Formal Models of Causal AscriptionSalem Benferhat, Jean-François Bonnefon, Philippe Chassy, Rui Da Silva Neves, Didier Dubois, Florence Dupin de Saint-Cyr, Daniel Kayser, Farid Nouioua, Sara Nouioua-Boutouhami, Henri Prade, Salma Smaoui. 47-62 [doi]
- An Efficient Algorithm for Naive Possibilistic Classifiers with Uncertain InputsSalem Benferhat, Karim Tabia. 63-77 [doi]
- Transitive Observation-Based Causation, Saliency, and the Markov ConditionJean-François Bonnefon, Didier Dubois, Henri Prade. 78-91 [doi]
- A Family of Tolerant Antidivision Operators for Database Fuzzy QueryingPatrick Bosc, Olivier Pivert. 92-105 [doi]
- Uncertainty Management for the Retrieval of Economic Information from Distributed MarketsRené Brunner, Felix Freitag, Leandro Navarro. 106-119 [doi]
- Loopy Propagation in a Probabilistic Description LogicFabio Gagliardi Cozman, Rodrigo Bellizia Polastro. 120-133 [doi]
- On the Performance of Fuzzy Data QueryingMariela Curiel, Claudia González, Leonid Tineo, Angélica Urrutia. 134-145 [doi]
- Tractable Reasoning with Bayesian Description LogicsClaudia d Amato, Nicola Fanizzi, Thomas Lukasiewicz. 146-159 [doi]
- Approximate Reasoning for Efficient Anytime Induction from Relational Knowledge BasesNicola Di Mauro, Teresa Maria Altomare Basile, Stefano Ferilli, Floriana Esposito. 160-173 [doi]
- Fusing Uncertain Structured Spatial InformationFlorence Dupin de Saint-Cyr, Robert Jeansoulin, Henri Prade. 174-188 [doi]
- A Neuro Fuzzy Approach for Handling Structured DataAlessio Ferone, Alfredo Petrosino. 189-200 [doi]
- A Framework for the Partial Evaluation of SPARQL QueriesSergio Flesca, Filippo Furfaro, Andrea Pugliese. 201-214 [doi]
- An Evolutionary Perspective on Approximate RDF Query AnsweringChristophe Guéret, Eyal Oren, Stefan Schlobach, Martijn Schut. 215-228 [doi]
- Clustering Uncertain Data Via K-MedoidsFrancesco Gullo, Giovanni Ponti, Andrea Tagarelli. 229-242 [doi]
- Speeding Up the NRA AlgorithmPeter Gurský, Peter Vojtás. 243-255 [doi]
- Uncertain Context Modeling of Dimensional Ontology Using Fuzzy Subset TheoryYing Jiang, Hui Dong. 256-269 [doi]
- A Personalized Approach to Experience-Aware Service Ranking and SelectionFriederike Klan, Birgitta König-Ries. 270-283 [doi]
- Performance Evaluation of Algorithms for Soft Evidential Update in Bayesian Networks: First ResultsScott Langevin, Marco Valtorta. 284-297 [doi]
- Optimization of Queries over Interval Probabilistic DataMatteo Magnani, Danilo Montesi. 298-311 [doi]
- Polynomial Time Queries over Inconsistent DatabasesCristian Molinaro. 312-325 [doi]
- Using OBDDs for Efficient Query Evaluation on Probabilistic DatabasesDan Olteanu, Jiewen Huang. 326-340 [doi]
- A Logical Framework to Reinforcement Learning Using Hybrid Probabilistic Logic ProgramsEmad Saad. 341-355 [doi]
- On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic SatisfiabilityEmad Saad. 356-371 [doi]
- Scaling Most Probable World Computations in Probabilistic Logic ProgramsGerardo I. Simari, Maria Vanina Martinez, Amy Sliva, V. S. Subrahmanian. 372-385 [doi]
- Measuring the Ignorance and Degree of Satisfaction for Answering Queries in Imprecise Probabilistic Logic ProgramsAnbu Yue, Weiru Liu, Anthony Hunter. 386-400 [doi]