Sciweavers

1650 search results - page 20 / 330
» The HOM problem is decidable
Sort
View
DKE
2007
136views more  DKE 2007»
13 years 7 months ago
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
Pierre Genevès, Nabil Layaïda
JOLLI
2010
78views more  JOLLI 2010»
13 years 6 months ago
On the Membership Problem for Non-Linear Abstract Categorial Grammars
embership problem for non-linear Abstract Categorial Grammars Sylvain Salvati Abstract In this paper we show that the membership problem for second order nonbstract Categorial Gram...
Sylvain Salvati
DAC
2009
ACM
14 years 8 months ago
The day Sherlock Holmes decided to do EDA
Semiconductor design companies are in a continuous search for design tools that address the ever increasing chip design complexity coupled with strict time-to-market schedules and...
Andreas G. Veneris, Sean Safarpour
EEMMAS
2007
Springer
14 years 1 months ago
DECIDE: Applying Multi-agent Design and Decision Logic to a Baggage Handling System
Behind the curtains at check-in desks in airports hide some of the most complex material handling systems, which manage to get your bag transported to the correct departure gate of...
Kasper Hallenborg, Yves Demazeau
HYBRID
2000
Springer
13 years 11 months ago
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
Joseph S. Miller