3440 search results - page 531 / 688 » Logics For Context-Free Languages |
211
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
323
Voted
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
Intuitively, data management and data integration tools should be well-suited for exchanging information in a semantically meaningful way. Unfortunately, they suffer from two sign...
227
Voted
WWW
2002
ACM
16 years 7 months ago
2002
ACM
Web services -- Web-accessible programs and devices ? are a key application area for the Semantic Web. With the proliferation of Web services and the evolution towards the Semanti...
186
Voted
WWW
2002
ACM
16 years 7 months ago
2002
ACM
HTML documents composed of frames can be difficult to write correctly. We demonstrate a technique that can be used by authors manually creating HTML documents (or by document edit...
321
Voted
POPL
2009
ACM
16 years 7 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...