We describe automated methods for constructing nonisomorphism proofs for pairs of graphs. The proofs can be human-readable or machinereadable. We have developed an experimental imp...
Arjeh M. Cohen, Jan Willem Knopper, Scott H. Murra...
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
We propose a distance phrase reordering model (DPR) for statistical machine translation (SMT), where the aim is to learn the grammatical rules and context dependent changes using ...
In this work, we are interested in how rational decision makers reason with and about reasons in a domain, practical ethics, where they appear to reason asons symbolically in terms...
In this paper, an automated registration framework is proposed to identify the differences between corresponding mammographic images. The deformation between a pair of mammograms ...