Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
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...
Abstract. This report presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme i...
Nicolas Beldiceanu, Thierry Petit, Guillaume Rocha...
Abstract. Logical architectures combine several logics into a more complex logical system. In this paper we study a logical architecture using input/output operations corresponding...
Soft constraints extend classical constraints to deal with non-functional requirements, overconstrained problems and preferences. Bistarelli, Montanari and Rossi have developed a ...
Martin Wirsing, Grit Denker, Carolyn L. Talcott, A...