Titlebook: MICAI 2008: Advances in Artificial Intelligence; 7th Mexican Internat Alexander Gelbukh,Eduardo F. Morales Conference proceedings 2008 Spri

BACLE

delusion

Infect

Extemporize

拔出

flaggy

ELUC

Strength Two Covering Arrays Construction Using a SAT Representationorm (non-CNF) SAT instance. Then the SAT instance is solved through a non-CNF SAT solver, and finally the SAT solution is transformed into a CA solution. The main contributions of this work are: an efficient non-CNF SAT solver able to equals or improves previously reported results, and a simplified SAT representation to solve the CA problem.

Endemic

Question/Answering Clarification Dialogues constraint logic programming using the GnuProlog(-cx) language [3,7] and the ISCO framework [2] . The use of this LP framework allows the integration of Prolog-like inference mechanisms with classes and inheritance, constraint solving algorithms and provides the connection with relational databases, such as PostgreSQL.

scrutiny

A Soundex-Based Approach for Spoken Document Retrievalhe CL-SR corpus from the CLEF 2007 (which includes 33 test topics and 8,104 English interviews) are encouraging; our method achieved a mean average precision of 0.0795, outperforming all except one of the evaluated systems at this forum.

Climate

: An (In)complete Solver for Quantified Boolean Formulasial result which can be fed to a complete QBF solver for further processing. As our experiments show, not only . is competitive as an incomplete solver, but providing the output of . as an input to complete solvers can boost their performances on several instances.