Not enough data to create a plot.
Try a different view from the menu above.
Information Technology
Eliminating expensive chunks by restricting expressiveness
Proc. Eleventh Intl. Joint Conference on Artificial Intelligence (pp. 731-737). Detroit, MI: IJCAII.
On optimal game-tree search using rational meta-reasoning
In IJCAI-89, pp. 334–340.
Number of solutions to satisfiability instances—Applications to knowledge bases
"In propositional logic (zero order) a system of logical rules may be put under the form of a conjunction of disjunction, i.e. a “satisfiability” or SAT-problem. SAT is central to NP-complete problems. Any result obtained on SAT would have consequences for a lot of problems important in artificial intelligence. We deal with the question of the number N of solutions of SAT. Firstly, any system of SAT clauses may be transformed in a system of independent clauses by an exponential process; N may be computed exactly. Secondly, by a statistical approach, results are obtained showing that for a given SAT-instance, it should be possible to find an estimate of N with a margin of confidence in polynomial time. Thirdly, we demonstrate the usefulness of these ideas on large knowledge bases." Int. J. Patt. Recogn. Artif. Intell. 03, 53 (1989).
Abstraction in problem solving and learning,
Proc. Eleventh Intl. Joint Conference on Artificial Intelligence (pp. 681-687). Detroit, MI: IJCAII.
Weighting and integrating evidence for stochastic simulation in Bayesian networks
Request RejectedThe requested URL was rejected by Bot Defense. Please consult with your administrator.
Heuristic search as evidential reasoning
Request RejectedThe requested URL was rejected by Bot Defense. Please consult with your administrator.
PRODIGY: An integrated architecture for planning and learning
Carbonell, J. G. | Knoblock, C. A. | Minton, S.
Technical report CMU-CS-89-189, Computer Science Department, Carnegie-Mellon University