1220 search results - page 27 / 244 » Restricting grammatical complexity |
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
Real-world behavior-based robot control problems require the coordination of a large number of competing behaviors. However, coordination becomes increasingly difficult as the num...
ENTCS
2011
13 years 2 months ago
2011
SUBSEXPL is a system originally developed to visualise reductions, simplifications and normalisations in three important calculi of explicit substitutions and has been applied to...
SAT
2009
Springer
14 years 2 months ago
2009
Springer
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
DEBS
2008
ACM
13 years 9 months ago
2008
ACM
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...