Skip to main content
SpringerLink
Log in

Extension and equivalence problems for clause minimal formulae

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

Inspired by the notion of minimal unsatisfiable formulae we first introduce and study the class of clause minimal formulae. A CNF formula F is said to be clause minimal if any proper subformula of F is not equivalent to F. We investigate the equivalence and extension problems for clause minimal formulae. The extension problem is the question whether for two formulae F and H there is some formula G such that F + G is equivalent to H. Generally, we show that these problems are intractable. Then we discuss the complexity of these problems restricted by various parameters and constraints. In the last section we ask several open questions in this area.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Aharoni and N. Linial, Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulae, Journal of Combinatorial Theory 43 (1986) 196–204.

    Article  MATH  MathSciNet  Google Scholar 

  2. G. Ausiello, A. D’Atri and D. Sacca, Minimal representation of directed hypergraphs, SIAM Journal on Computing 2 (1986) 418–431.

    Article  MathSciNet  Google Scholar 

  3. H. Fleischner, O. Kullmann and S. Szeider, Polynomial-time recognition of minimal unsatisfiable formulae with fixed clause-variable difference, Theoretical Computer Science 289 (2002) 503–516.

    Article  MATH  MathSciNet  Google Scholar 

  4. D.S. Johnson, A catalog of complexity classes, in: Handbook of Theoretical Computer Science, Vol.A (Elsevier, Amsterdam, 1990).

    Google Scholar 

  5. H. Kleine Büning and T. Lettmann, Propositional Logic: Deduction and Algorithm (Cambridge University Press, 1999).

  6. H. Kleine Büning and X.S. Zhao, The complexity of some subclasses of minimal unsatisfiable formulae (2000, submitted for publication).

  7. C.H. Papadimitriou and D. Wolfe, The complexity of facets resolved, Journal of Computer and System Science 37 (1988) 2–13.

    Article  MATH  MathSciNet  Google Scholar 

  8. K. Wadner, Bounded query classes, SIAM Journal on Computing 19 (1990) 833–846.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Universität Paderborn, D-33095, Paderborn, Germany

    Hans Kleine Büning

  2. Institute of Logic and Cognition, Sun Yat-Sen University, 510275, Guangzhou, People’s Republic of China

    Xishun Zhao

Authors
  1. Hans Kleine Büning
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xishun Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kleine Büning, H., Zhao, X. Extension and equivalence problems for clause minimal formulae. Ann Math Artif Intell 43, 295–306 (2005). https://doi.org/10.1007/s10472-005-0435-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-005-0435-3

Key words

Search

Navigation