• Cite Icon6
  • https://doi.org/10.1007/10703163_24Copy DOI Icon

On the Complexity of H-Subsumption

  • Jan 1, 1999
  • Reinhard Pichler
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The importance of subsumption as a redundancy elimination method in automated theorem proving is generally acknowledged. For a given Herbrand universe H, it can be further strengthened to the so-called H-subsumption, i.e.: A clause D is H-subsumed by a clause set \({\cal C}\), iff for every H-ground instance Dθ of D there is a clause \(C \in {\cal C}\), s.t. C subsumes Dθ. In recent time, H-subsumption has gained increasing importance especially in the field of automated model building (cf. e.g. [5], [4], [6]). Furthermore, it can be easily shown that H-subsumption may be incorporated as a redundancy deletion rule into many familiar (resolution- and paramodulation-based) inference systems without destroying the refutational completeness.However, no satisfactory algorithm for checking H-subsumption has been presented so far. We therefore have to investigate the inherent complexity of H-subsumption in order to explain this lack of efficient algorithms: The main result of this work is a Π\(_{\rm 2}^{p}\)-completeness proof for H-subsumption even if it is subjected to some strong restrictions. Hence, unless the polynomial hierarchy collapses to the first level, H-subsumption is non-polynomially more complex than ordinary subsumption.Finally we present a new algorithm for H-subsumption whose complexity is compared with previously known algorithms (i.e.: from [5] and [4] on the one hand and from [6] on the other hand). The main advantage of our approach is that the total size of an H-subsumption problem (i.e.: in particular, the term depth of the expressions involved) only has polynomial influence on the overall (time and space) complexity. This is in great contrast to the other two approaches.

Similar Papers
  • Research Article
  • Citations69

Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation

  • Jul 01, 2000
  • Journal of Automated Reasoning
  • François Bry +1
  • Research Article
  • Citations4

Evaluation of Queries under Closed-World Assumption

  • Jun 01, 1997
  • Journal of Automated Reasoning
  • Marek A Suchenek
  • Research Article
  • Citations10

Revising the logical foundations of inductive logic programming systems with ground reduced programs

  • Mar 01, 1999
  • New Generation Computing
  • Akihiro Yamamoto
  • Conference Article
  • Citations6

Analysis of Time and Space Complexity of Array, Linked List and Linked Array(hybrid) in Linear Search Operation

  • Dec 08, 2022
  • B Lokeshwar +4
  • Research Article
  • Citations1

Sparse Circulant Binary Embedding: An Asymptotic Analysis

  • Mar 01, 2018
  • IEEE Signal Processing Letters
  • Saehoon Kim +1
  • Addendum

WITHDRAWN: Spearman rank correlation based bagging ensemble bayes optimal classification for genomic predictive pattern analytics

  • Nov 01, 2020
  • Materials Today: Proceedings
  • Marrynal S Eastaff +1
  • Book Chapter

Resolution and Unification

  • Jan 01, 1997
  • Rolf Socher-Ambrosius +1
  • Conference Article
  • Citations32

Energy-Efficient Algorithms

  • Jan 14, 2016
  • Erik D Demaine +3
  • Research Article
  • Citations75

A fast algorithm for optimal buffer insertion

  • Jun 01, 2005
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • Weiping Shi +1
  • Research Article
  • Citations7

A Comparative Study of Three Heuristic Functions Used to Solve the 8-Puzzle

  • Jan 10, 2016
  • British Journal of Mathematics & Computer Science
  • Anca-Elena Iordan
  • Research Article
  • Citations10

A faster FPTAS for knapsack problem with cardinality constraint

  • Apr 04, 2022
  • Discrete Applied Mathematics
  • Wenxin Li +2
  • Research Article
  • Citations1

An Improvement of Herbrand's Theorem and Its Application to Model Generation Theorem Proving

  • Jul 01, 2007
  • Journal of Computer Science and Technology
  • Yu-Yan Chao +5
  • Conference Article
  • Citations3

Saving Space in a Time Efficient Simulation Algorithm

  • Jul 01, 2009
  • Silvia Crafa +2
  • Research Article
  • Citations160

Nonstationary Motor Fault Detection Using Recent Quadratic Time–Frequency Representations

  • Jan 01, 2008
  • IEEE Transactions on Industry Applications
  • Satish Rajagopalan +4
  • Book Chapter
  • Citations5

SVM Based MLP Neural Network Algorithm and Application in Intrusion Detection

  • Jan 01, 2011
  • Yong Hou +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.