67 search results - page 3 / 14 » The Expressiveness of a Family of Finite Set Languages |
IJCAI
2003
13 years 9 months ago
2003
paper, we present an abstract framework for learning a finite domain constraint solver modeled by a set of operators enforcing a consistency. The behavior of the consistency to be...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
CADE
2002
Springer
14 years 7 months ago
2002
Springer
Abstract. Description Logics are a family of class based knowledge representation formalisms characterised by the use of various constructors to build complex classes from simpler ...
HICSS
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— Framework design is a multifaceted endeavor undertaken to promote reuse of software within a family of related applications. Traditional approaches involve either the e...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...