272 search results - page 31 / 55 » Programming languages capturing complexity classes |
125
Voted
ENTCS
2006
15 years 21 days ago
2006
Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical for...
107
click to vote
CSL
2008
Springer
15 years 2 months ago
2008
Springer
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of in...
70
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
122
Voted
FUIN
2010
14 years 10 months ago
2010
This paper explores the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning problems in the presence of multiple interacting agents. The paper ...
106
Voted
OOPSLA
2005
Springer
15 years 6 months ago
2005
Springer
Micro patterns are similar to design patterns, except that micro patterns stand at a lower, closer to the implementation, level of abstraction. Micro patterns are also unique in t...