In this paper we present a polynomial time parsing algorithm for Combinatory Categorial Grammar. The recognition phase extends the CKY algorithm for CFG. The process of generating...
: Search technology can be applied to many applications and is in the heart of always growing information society. A promising new development is the use of ontologies to enable se...
Felix Burkhardt, Jon Atle Gulla, Jin Liu, Christia...
: General purpose workflow management systems are often unable to match user requirements of a particular application. In many points of the workflow the user has to take decisions...
Abstract. Scene interpretation systems are often conceived as extensions of low-level image analysis with bottom-up processing for high-level interpretations. In this contribution ...
We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove tha...