Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for first-order probabilistic languages. Howev...
Categorisation of objects into classes is currently supported by (at least) two ‘orthogonal’ methods. In logic-based approaches, classifications are defined through ontologi...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
The state-of-the-art object detection algorithm learns a binary classifier to differentiate the foreground object from the background. Since the detection algorithm exhaustively s...
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...