Tabling for non-monotonic programming

摘要: Nondmonotonic extensions add power to logic programs. However, the main programming language, Prolog, is widely recognized as inadequate implement these due its weak termination and complexity properties. By extending Prolog’s SLD resolution with tabling, Prolog can be improved in several ways. Tabling allow a system compute welldfounded semantics for programs bounded term depth, do so polynomial data complexity. exploiting properties, tabling allows variety of nondmonotonic efficiently implemented, used solve practical problems. In this paper we describe it implemented XSB show how construct metadinterpreters (or preprocessors) two sample formalisms: WelldFounded Semantics Explicit Negation, Generalized Annotated Logic Programs. We also are applications such psychiatric diagnosis, extraction information from poorly structured textual data, model checking.