A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
Abstract-- In this seminal paper, we sketch a general conceptual framework for self-organising systems (SOSs) that encompasses both stigmergy and MAS coordination, and potentially ...
Andrea Omicini, Alessandro Ricci, Mirko Viroli, Cr...
There exist many different generalization error bounds for classification. Each of these bounds contains an improvement over the others for certain situations. Our goal is to com...
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
Abstract. Motivated by research on how topology may be a helpful foundation for building information modeling (BIM), a relational database version of the notions of chain complex a...