Combinatory Categorial Grammar (CCG) is generally construed as a fully lexicalized formalism, where all grammars use one and the same universal set of rules, and crosslinguistic v...
Abstract—The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already avai...
l Abstraction via the Frege Quantifier G. Aldo Antonelli Abstract This paper presents a formalization of first-order aritharacterizing the natural numbers as abstracta of the equin...
The Rule Responder project (responder.ruleml.org) extends the Semantic Web towards a Pragmatic Web infrastructure for collaborative human-computer networks. These allow semi-autom...
Adrian Paschke, Harold Boley, Alexander Kozlenkov,...
Many belief change formalisms employ plausibility orderings over the set of possible worlds to determine how the beliefs of an agent ought to be modified after the receipt of a ne...
Richard Booth, Samir Chopra, Thomas Meyer, Aditya ...