A proof procedure for extended logic programs

Abstract: "In [GL90], M. Gelfond and V. Lifschitz proposed to extend general logic programs to so-called extended logic programs, by adding strong negation. They proposed answer sets as a semantics for these programs. However, this semantics uses the notion of global consistency. The necessity...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Teusink, Frank (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Amsterdam 1993
Schriftenreihe:	Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,59
Schlagworte:	Automatic theorem proving Logic programming
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!