Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
a more abstract characterisation in the setting of semirings. Formally, a domain semiring is a semiring S extended by a domain operation d : S → S which, for all x, y ∈ S, sati...
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
We propose a novel mode of feedback for image search, where a user describes which properties of exemplar images should be adjusted in order to more closely match his/her mental m...
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...