2137 search results - page 70 / 428 » Proving Abstract Non-interference |
DLOG
2007
15 years 12 days ago
2007
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
ACL
2008
14 years 11 months ago
2008
We define a new formalism, based on Sikkel's parsing schemata for constituency parsers, that can be used to describe, analyze and compare dependency parsing algorithms. This ...
DLT
2010
14 years 11 months ago
2010
Abstract. We prove that uniform and semi-uniform families of P systems with active membranes using only communication and nonelementary division rules are not computationally unive...
CSL
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. This paper shows undecidability of type-checking and typeinference problems in domain-free typed lambda-calculi with existential types: a negation and conjunction fragmen...
APAL
2008
14 years 10 months ago
2008
Abstract. We prove a version of the associated sheaf functor theorem in Algebraic Set Theory. The proof is established working within a Heyting pretopos equipped with a system of s...