Inconsistency-Tolerant Reasoning with Classical Logic and Large Databases

Real-world automated reasoning systems must contend with inconsistencies and the vast amount of information stored in relational databases.  In this paper, we introduce compilation techniques for inconsistency-tolerant reasoning over the combination of classical logic and a relational database.  Our resolution-based algorithms address a quantifier-free, function-free fragment of first-order logic while leveraging off-the-shelf database technology for all data-intensive computation.