### Abstract

In this paper, we develop techniques for automated hypothesis-space exploration over data sets that may contain contradictions. To do so, we make use of the equivalence between two formulations: those of first-order predicate logic with prefix modal quantifiers under the finite-model hypothesis and those of mixed-integer linear programming (MILP) problems. Unlike other approaches, we do not assume that all logical assertions are true without doubt. Instead, we look for alternative hypotheses about the validity of the claims by identifying alternative optimal solutions to a corresponding MILP. We use a collection of slack variables in the derived linear constraints to indicate the presence of contradictory data or assumptions. The objective is to minimize contradictions between data and assertions represented by the presence of nonzero slack in the set of linear constraints. In this paper, we present the following: 1) a correspondence between first-order predicate logic with modal quantifier prefixes under the finite-model hypothesis and MILP problems and 2) an implicit enumeration algorithm for exploring the contradiction hypothesis space.

Original language | English (US) |
---|---|

Article number | 5659971 |

Pages (from-to) | 772-782 |

Number of pages | 11 |

Journal | IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics |

Volume | 41 |

Issue number | 3 |

DOIs | |

State | Published - Jun 1 2011 |

### All Science Journal Classification (ASJC) codes

- Control and Systems Engineering
- Software
- Information Systems
- Human-Computer Interaction
- Computer Science Applications
- Electrical and Electronic Engineering

## Cite this

*IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics*,

*41*(3), 772-782. [5659971]. https://doi.org/10.1109/TSMCB.2010.2092762