Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

The complexity of homomorphisms and renamings for minimal unsatisfiable formulas

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

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

We investigate the complexity of deciding whether for minimal unsatisfiable formulas F and H there exists a variable renaming, a literal renaming or a homomorphism ϕ such that ϕ(F) = H. A variable renaming is a permutation of variables. A literal renaming is a permutation of variables which additionally replaces some of the variables by its complements. A homomorphism can be considered as a literal renaming which can map different literals to one literal.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. R. Aharoni, Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas, Journal of Combinatorial Theory, Series A 43 (1996) 196–204.

    Article  MathSciNet  Google Scholar 

  2. G. Davydov, I. Davydova and H. Kleine Büning, An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF, Annals of Mathematics and Artificial Intelligence 23 (1998) 229–245.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. P. Hell and J. Nešetřil, On the complexity of H-coloring, Journal of Combinatorial Theory, Series B 48 (1990) 92–110.

    Article  MATH  MathSciNet  Google Scholar 

  5. H. Kleine Büning and X. Zhao, Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency, Information Processing Letters 84 (2002) 147–151.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. Köbler, U. Schöning and J. Toran, The Graph Isomorphism Problem: Its Structural Complexity (Birkhäuser, 1993).

  7. B. Krishnamurthy, Short proofs for tricky formulas, Acta Informatica 22 (1985) 253–275.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. S. Szeider, Homomorphisms of conjunctive normal forms, Discrete Applied Mathematics 130 (2003) 351–365.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. Urquhart, The symmetry rule in propositional logic, Discrete Applied Mathematics 96–97 (1999) 177–193.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Hans Kleine Büning

  2. Department of Computer Science, Guizhou University, 550025, Guiyang, People’s Republic of China

    Daoyun Xu

Authors
  1. Hans Kleine Büning
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daoyun Xu
    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

Büning, H.K., Xu, D. The complexity of homomorphisms and renamings for minimal unsatisfiable formulas. Ann Math Artif Intell 43, 113–127 (2005). https://doi.org/10.1007/s10472-005-0422-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-005-0422-8

Keywords

Search

Navigation