165 search results - page 1 / 33 » Exotic Quantifiers, Complexity Classes, and Complete Problem... |
ICALP
2007
Springer
13 years 8 months ago
2007
Springer
JSAT
2006
13 years 4 months ago
2006
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
CSL
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
LICS
2002
IEEE
13 years 9 months ago
2002
IEEE
We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC ¢ , the dynamic classes corresponding to relational calculus and (...
SIAMCOMP
2010
12 years 11 months ago
2010
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...