Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...