159 search results - page 17 / 32 » Soft lambda-Calculus: A Language for Polynomial Time Computa... |
160
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
143
click to vote
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
184
click to vote
ICCS
1998
Springer
15 years 10 months ago
1998
Springer
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of concept description languages (description logics),...
155
click to vote
DLOG
2010
15 years 3 months ago
2010
Abstract. We study the problem of updates for TBoxes represented in Description Logics of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of...
167
click to vote
ECOOP
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. We have designed and implemented a type inference algorithm for the Self language. The algorithm can guarantee the safety and disambiguity of message sends, and provide u...