leanCoP: lean connection-based theorem proving

  • Authors:

  • Jens Otten;Wolfgang Bibel

  • Affiliations:

  • Fachgebiet Intellektik, Fachbereich Informatik, Darmstadt University of Technology, Alexanderstr. 10, 64283 Darmstadt, Germany;Fachgebiet Intellektik, Fachbereich Informatik, Darmstadt University of Technology, Alexanderstr. 10, 64283 Darmstadt, Germany

  • Venue:
  • Journal of Symbolic Computation - Special issue: First order theorem proving
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Prolog program "prove (M,I) : - append (Q, [C|R], M), \+member (-_, C), append(Q,R,S), prove([!],[[-!|C] |S],[],I). prove ([],_,_,_). prove([L|C],M,P,I) :- (-N=L; -L=N) - (member(N,P); append(Q,[D|R],M), copy_term(D,E), append(A,[N|B],E), append(A,B,F), (D==E - append(R,Q,S); length(P,K), KI is iteratively given), and demonstrates a comparatively strong performance.