Relativized hyperequivalence of logic programs for modular programming

A recent framework of relativized hyperequivalence of programs offers a unifying generalization of strong and uniform equivalence. It seems to be especially well suited for applications in program optimization and modular programming due to its flexibility that allows us to restrict, independently o...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theory and practice of logic programming Jg. 9; H. 6; S. 781 - 819
Hauptverfasser:	TRUSZCZYŃSKI, MIROSŁAW, WOLTRAN, STEFAN
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cambridge, UK Cambridge University Press 01.11.2009
Schlagworte:	Regular Papers complexity answer-set programming strong equivalence stable models relativized equivalence supported models minimal models uniform equivalence
ISSN:	1471-0684, 1475-3081
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!