Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appr...
R. R. Bakker, F. Dikker, F. Tempelman, P. M. Wognu...
This paper presents a major revision of the Either propositional theory re nement system. Two issues are discussed. First, we show howrun timee ciency can be greatlyimproved by ch...
We describe a new approach to default reasoning, based on a principle of indi erence among possible worlds. We interpret default rules as extreme statistical statements, thus obta...
Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, ...
Gelfond and Lifschitz introduce a declarative language A for describing effects of actions and define a translation of theories in this language into extended logic programs(ELP, ...
Many learning algorithms form concept descriptions composed of clauses, each of which covers some proportion of the positive training data and a small to zero proportion of the ne...