A New Clausal Class Decidable by Hyperresolution

L. Georgieva, Ullrich Hustadt, R.A. Schmidt

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In this paper we define a new clausal class, called BU, which can be decided by hyperresolution with splitting. We also consider the model generation problem for BU and show that hyperresolution plus splitting can also be used as a Herbrand model generation procedure for BU and, furthermore, that the addition of a local minimality test allows us to generate only minimal Herbrand models for clause sets in BU. In addition, we investigate the relationship of BU to other solvable classes.
Original languageEnglish
Title of host publicationAutomated Deduction - CADE-18
Subtitle of host publication18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002 Proceedings
EditorsAndrei Voronkov
Place of PublicationHeidelberg
PublisherSpringer Berlin
Pages260-274
Number of pages15
ISBN (Electronic)9783540456209
ISBN (Print)9783540439318
Publication statusPublished - 17 Jul 2002

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume2392

Keywords

  • Modal Logic
  • Description Logic
  • Predicate Symbol
  • Direct Successor
  • Unit Clause

Fingerprint

Dive into the research topics of 'A New Clausal Class Decidable by Hyperresolution'. Together they form a unique fingerprint.

Cite this