On Deciding Subsumption Problems

  • Authors:

  • Uwe Egly;Reinhard Pichler;Stefan Woltran

  • Affiliations:

  • Abteilung für Wissensbasierte Systeme E184/3, TU Wien, Favoritenstr. 9-11, A-1040 Vienna, Austria;Siemens AG Österreich, Siemensstr. 92, 1210 Vienna, Austria;Abteilung für Wissensbasierte Systeme E184/3, TU Wien, Favoritenstr. 9-11, A-1040 Vienna, Austria

  • Venue:
  • Annals of Mathematics and Artificial Intelligence
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

Subsumption is an important redundancy elimination method in automated deduction. A clause D is subsumed by a set C of clauses if there is a clause C∈C and a substitution σ such that the literals of Cσ are included in D. In the field of automated model building, subsumption has been modified to an even stronger redundancy elimination method, namely the so-called clausal H-subsumption. Atomic H-subsumption emerges from clausal H-subsumption by restricting D to an atom and C to a set of atoms. Both clausal and atomic H-subsumption play an indispensable key role in automated model building. Moreover, problems equivalent to atomic H-subsumption have been studied with different terminologies in many areas of computer science. Both clausal and atomic H-subsumption are known to be intractable, i.e., Π2p-complete and NP-complete, respectively. In this paper, we present a new approach to deciding (clausal and atomic) H-subsumption that is based on a reduction to QSAT2 and SAT, respectively.