University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constra...
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems...
Haiming Chen, Mihai Ionescu, Tseren-Onolt Ishdorj,...
Abstract. People with special needs may find difficulties using electronic consumer devices, user interfaces limit their chances of having full control on them. The Universal Remot...
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice conseq...