An algorithm for constructing and searching spaces of alternative hypotheses

Christopher Griffin, Kelly Testa, Stephen Racunas

Research output: Contribution to journalArticle

4 Citations (Scopus)

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 languageEnglish (US)
Article number5659971
Pages (from-to)772-782
Number of pages11
JournalIEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Volume41
Issue number3
DOIs
StatePublished - Jun 1 2011

Fingerprint

Linear programming

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

@article{cc575f6ce02b47cd87d779b1e8ecd9e3,
title = "An algorithm for constructing and searching spaces of alternative hypotheses",
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.",
author = "Christopher Griffin and Kelly Testa and Stephen Racunas",
year = "2011",
month = "6",
day = "1",
doi = "10.1109/TSMCB.2010.2092762",
language = "English (US)",
volume = "41",
pages = "772--782",
journal = "IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics",
issn = "1083-4419",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

An algorithm for constructing and searching spaces of alternative hypotheses. / Griffin, Christopher; Testa, Kelly; Racunas, Stephen.

In: IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, Vol. 41, No. 3, 5659971, 01.06.2011, p. 772-782.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An algorithm for constructing and searching spaces of alternative hypotheses

AU - Griffin, Christopher

AU - Testa, Kelly

AU - Racunas, Stephen

PY - 2011/6/1

Y1 - 2011/6/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79957471822&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79957471822&partnerID=8YFLogxK

U2 - 10.1109/TSMCB.2010.2092762

DO - 10.1109/TSMCB.2010.2092762

M3 - Article

C2 - 21147596

AN - SCOPUS:79957471822

VL - 41

SP - 772

EP - 782

JO - IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

JF - IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

SN - 1083-4419

IS - 3

M1 - 5659971

ER -