Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On deciding subsumption problems

On deciding subsumption problems Subsumption is an important redundancy elimination method in automated deduction. A clause D is subsumed by a set $$\mathcal{C}$$ of clauses if there is a clause C ∈ $$\mathcal{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 $$\mathcal{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., Π p 2 -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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

Loading next page...
 
/lp/springer-journals/on-deciding-subsumption-problems-6E2zJ7Am50

References (44)

Publisher
Springer Journals
Copyright
Copyright © 2004 by Springer
Subject
Computer Science; Artificial Intelligence (incl. Robotics); Mathematics, general; Computer Science, general; Statistical Physics, Dynamical Systems and Complexity
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1007/s10472-005-0434-4
Publisher site
See Article on Publisher Site

Abstract

Subsumption is an important redundancy elimination method in automated deduction. A clause D is subsumed by a set $$\mathcal{C}$$ of clauses if there is a clause C ∈ $$\mathcal{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 $$\mathcal{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., Π p 2 -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.

Journal

Annals of Mathematics and Artificial IntelligenceSpringer Journals

Published: Dec 31, 2004

There are no references for this article.