We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
In constraint-based mining, the monotone and antimonotone properties are exploited to reduce the search space. Even if a constraint has not such suitable properties, existing algo...
In the development of algorithms for finding the minimal solutions of systems of linear Diophantine equations, little use has been made (to our knowledge) of the results by Stanle...
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
The existing search engines sometimes give unsatisfactory search result for lack of any categorization. If there is some means to know the preference of user about the search resul...