Journal of Artificial Intelligence Resarch

acquired added ADtree algorithm applications approach Artificial Intelligence assignment assumables atoms attributes basic blocks bound called clause clique complexity component computing condition consequence consider consistent contains corresponding cost covered dataset defined Definition dependent described diagnoses discuss domain efficient equivalent examples experiments Figure formalisms formula function given GOAL heuristic Horn increase INIT instantiations iterations KIDS knowledge learning learning algorithms literal logic Machine macros Mean method MICRO-HILLARY minimal models monotonicity node Note observation operators parameter patching performance persistent planners planning positive possible predicate preferential problem Proceedings Proof propositional puzzle random reasoning records refinement representation represents respect revision rules satisfies selection seq(integer sequence shown solution solving specification structure subset Suppose synthesized Theorem theory tile tree true update variable windowing