Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have onl...
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional G...
Aoife Cahill, Michael Burke, Ruth O'Donovan, Josef...
Graphs provide good representations for many domains. Interactive graph-based interfaces are desireable to browse and edit data for these domains. However, as graphs increase in s...
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...
Robert Meolic, Alessandro Fantechi, Stefania Gnesi
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...