732 search results - page 119 / 147 » Axiomatising timed automata |
IDEAS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
CAI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
CEEMAS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We are interested in understanding and simulating how humans elaborate plans in situations where knowledge is incomplete and how they interact to obtain missing informati...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...