We present a query answering technique based on notions and results from modal Correspondence Theory. It allows us to answer a wide family of conjunctive queries by polynomial redu...
The Irish School of Constructive Mathematics (M♣ c ), which extends the VDM, exploits an algebraic notation based upon monoids and their morphisms for the purposes of abstract mo...
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
Abstract. Much research has focused on the problem of knowledge accessibility, sharing and reuse. Specific languages (e.g. KIF, CG, RDF) and ontologies have been proposed. Common c...
This paper describes an application for computing first-order semantic representations of English texts. It is based on a combination of hybrid shallow-deep components arranged wit...