Function-Free Horn Clauses Are Hard to Approximate - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Richard Nock, Pascal Jappy. Function-Free Horn Clauses Are Hard to Approximate. In David Page, editor, Inductive Logic Programming, 8th International Workshop, ILP-98, Madison, Wisconsin, USA, July 22-24, 1998, Proceedings. Volume 1446 of Lecture Notes in Computer Science, pages 195-204, Springer, 1998.

The following publications are possibly variants of this publication:

Complexity in the Case against Accuracy: When Building one Function-Free Horn Clause is as Hard as AnyRichard Nock. alt 1999: 182-193 [doi]

runs on WebDSL