|
|
![]() ![]() |
| Not Logged in. Login |
On Arbitrary Selection Strategies for Basic SuperpositionAleksic, Vladimir and Degtyarev, Anatoli (2006) On Arbitrary Selection Strategies for Basic Superposition. In: Logics in Artificial Intelligence, 10th European Conference, JELIA 2006.
AbstractFor 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.
Repository Staff Only: item control page |
| Accessibility | Terms and Conditions | Last Modified 01 November 2007 |
| © 2007 DCS, King's College London, Strand, London WC2R 2LS, England, United Kingdom. Tel +44 (0)20 7836 5454 |