3406 search results - page 494 / 682 » Modelling situations in intelligent agents |
174
click to vote
AAAI
2006
15 years 8 months ago
2006
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...
162
click to vote
AAAI
2004
15 years 8 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
181
click to vote
AAAI
2004
15 years 8 months ago
2004
A binary constraint network is tree convex if we can construct a tree for the domain of the variables so that for any constraint, no matter what value one variable takes, all the ...
152
click to vote
AAAI
2006
15 years 8 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
154
click to vote
AAAI
2006
15 years 8 months ago
2006
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...