Pseudo-Closed Family Verification is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem)

PublikationenPublications

• Nach AutorBy Author
  • Sebastian RudolphSebastian Rudolph
• Nach ForschungsgruppeBy Research Group
  • Computational LogicComputational Logic

Toggle side column

Pseudo-Closed Family Verification is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem)

Sebastian RudolphSebastian Rudolph

• Download

Sebastian Rudolph
Pseudo-Closed Family Verification is NP-Complete (Or: How Claude Helped Tackle Bernhard’s Problem)
In Madalina Croitoru, Domingo López-Rodríguez, Gerd Stumme, eds., The Third International Joint Conference on Conceptual Knowledge Structures (CONCEPTS 2026), LNCS, to appear. Springer

• Details
• Bibtex

• Projekt:Project: SECAI, ScaDS.AI
• Forschungsgruppe:Research Group: Computational LogicComputational Logic

The final publication is available at Springer.

@inproceedings{R2026,
  author    = {Sebastian Rudolph},
  title     = {Pseudo-Closed Family Verification is {NP-Complete} (Or: How
               Claude Helped Tackle Bernhard’s Problem)},
  editor    = {Madalina Croitoru and Domingo L{\'{o}}pez-Rodr{\'{\i}}guez and
               Gerd Stumme},
  booktitle = {The Third International Joint Conference on Conceptual Knowledge
               Structures (CONCEPTS 2026)},
  series    = {LNCS},
  publisher = {Springer},
  year      = {2026}
}