The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
An approach to implementing deduction systems based on semantic tableaux is described; it works by compiling a graphical representation of a fully expanded tableaux into a program...
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
We report on the development of a relational genomic search engine that integrates search of structured biological data and biomedical literature. After identifying an optimal prep...
A new method for object search is proposed. The proposed scheme is based on matching gradient information around each pixel, computed in the form of orientation codes, rather than...