10568 search results - page 464 / 2114 » Computer Intelligence and Formalization |
123
click to vote
ECAI
1992
Springer
15 years 9 months ago
1992
Springer
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
150
click to vote
CP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
138
click to vote
AISC
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. The same methodology is used to develop 3 different applications. We begin by using a very expressive, appropriate Domain Specific Language, to write down precise problem...
178
click to vote
AAAI
2010
15 years 6 months ago
2010
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
136
Voted
AAAI
2010
15 years 6 months ago
2010
The precise specification of reward functions for Markov decision processes (MDPs) is often extremely difficult, motivating research into both reward elicitation and the robust so...