Sciweavers

AI
2000
Springer
13 years 11 months ago
A computational model of belief
Aaron N. Kaplan, Lenhart K. Schubert
AI
2000
Springer
13 years 11 months ago
On agent-based software engineering
Agent-based computing represents an exciting new synthesis both for Artificial Intelligence (AI) and, more generally, Computer Science. It has the potential to significantly impro...
Nicholas R. Jennings
AI
2000
Springer
13 years 11 months ago
EXPTIME tableaux for ALC
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r....
Francesco M. Donini, Fabio Massacci
AI
2000
Springer
13 years 11 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...
AI
2000
Springer
13 years 11 months ago
Learning to construct knowledge bases from the World Wide Web
The World Wide Web is a vast source of information accessible to computers, but understandable only to humans. The goal of the research described here is to automatically create a...
Mark Craven, Dan DiPasquo, Dayne Freitag, Andrew M...
AI
2000
Springer
13 years 11 months ago
Credal networks
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Evidence suggests that credal ...
Fabio Gagliardi Cozman
AI
2000
Springer
13 years 11 months ago
Understanding dynamic scenes
We propose a framework for the representation of visual knowledge in a robotic agent, with special attention to the understanding of dynamic scenes. According to our approach, und...
Antonio Chella, Marcello Frixione, Salvatore Gagli...
AI
2000
Springer
13 years 11 months ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...
AI
2000
Springer
13 years 11 months ago
Belief functions and default reasoning
We present a new approach to dealing with default information based on the theory of belief functions. Our semantic structures, inspired by Adams' -semantics, are epsilon-beli...
Salem Benferhat, Alessandro Saffiotti, Philippe Sm...