LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must b...
We present novel kernels based on structured and unstructured features for reranking the N-best hypotheses of conditional random fields (CRFs) applied to entity extraction. The fo...
Truc-Vien T. Nguyen, Alessandro Moschitti, Giusepp...
Most current propositional SAT solvers apply resolution at various stages to derive new clauses or simplify existing ones. The former happens during conflict analysis, while the l...
Abstract. In this paper, we investigate the properties of commonly used prepruning heuristics for rule learning by visualizing them in PN-space. PN-space is a variant of ROC-space,...