Menu_Home Home   Menu_Latest Latest   Menu_Search Advanced Search   Menu_Browse_by_Year By Year   Menu_Browse_by_Division By Division
  
Screen decoration graphicsLogo

On Arbitrary Selection Strategies for Basic Superposition

Aleksic, Vladimir and Degtyarev, Anatoli (2006) On Arbitrary Selection Strategies for Basic Superposition. In: Logics in Artificial Intelligence, 10th European Conference, JELIA 2006.

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
331Kb

Abstract

For first-order Horn clauses without equality, resolution is complete with an arbitrary selection of a single literal in each clause [dN 96]. Here we extend this result to the case of clauses with equality for superposition-based inference systems. Our result is a generalization of the result given in [BG 01]. We answer their question about the completeness of a superposition-based system for general clauses with an arbitrary selection strategy, provided there exists a refutation without applications of the factoring inference rule.

Item Type:Conference or Workshop Item (Paper)
Subjects:UNSPECIFIED
ID Code:838
Deposited By:Dr Anatoli Degtyarev
Deposited On:04 Nov 2007 13:17
Last Modified:04 Nov 2007 13:17

Repository Staff Only: item control page