228 search results - page 44 / 46 » A Theory of Restrictions for Logics and Automata |
ALT
1995
Springer
14 years 4 days ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
WWW
2002
ACM
14 years 9 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...
CASC
2006
Springer
14 years 10 days ago
2006
Springer
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
POPL
2007
ACM
14 years 9 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
PLDI
2009
ACM
14 years 3 months ago
2009
ACM
Information flow controls can be used to protect both data confidentiality and data integrity. The certification of the security degree of a program that runs in untrusted envi...