4117 search results - page 288 / 824 » On the Satisfiability of Complex Constraints |
187
click to vote
ICRA
2007
IEEE
16 years 1 months ago
2007
IEEE
— Given a robot model and a class of admissible environments, this paper provides a framework for automatically and verifiably composing controllers that satisfy high level task...
186
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
201
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
147
click to vote
FUIN
2000
15 years 6 months ago
2000
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
164
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...