Traditional algorithms for prime implicate generation [Quine, 1952; McCluskey, 1956; Tison, 1967; Kean and Tsiknis, 1990; de Kleer, 1992] require the input formulas to be first tr...
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...
We consider the computational complexity of evaluating nested counterfactuals over a propositional knowledge base. Counterfactual implication models a statement "if p, then q...
A student model description language and its synthesis method are presented. The language called SMDL is based on a logic programming language taking 4 truth values such as true, ...
Human chess players exhibit a large variation in the amount of time they allocate for each move. Yet, the problem of devising resource allocation strategies for game playing did n...