86 search results - page 10 / 18 » Satisfiability Algorithms and Finite Quantification |
76
Voted
ALT
2003
Springer
15 years 1 months ago
2003
Springer
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...
100
Voted
CSCLP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
MFPS
1989
15 years 1 months ago
1989
We define a simple collection of operations for creating and manipulating record structures, where records are intended as finite associations of values to labels. A second-order ...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
We present some theoretical results related to the problem
of actively searching for a target in a 3D environment,
under the constraint of a maximum search time. We define
the o...
LPAR
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Disunification is an extension of unification to first-order formulae over syntactic equality atoms. Instead of considering only syntactic equality, I extend a disunifica...