In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-inter...
Every pregroup grammar is shown to be strongly equivalent to one which uses basic types and left and right adjoints of basic types only. Therefore a semantical interpretation is i...
The paper proposes a formal analysis of the ascriptive view of norms as resulting from pulling together Anderson's reductionist approach, the analysis of counts-as, and a nove...
In [1, 2] we studied various concepts of bipolar queries (cf. Dubois and Prade [3]). We advocated there the use of a fuzzified version of the original crisp definition introduced...
Abstract. An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms ...