Stable model semantics for founded bounds

Answer Set Programming (ASP) is a powerful form of declarative programming used in areas such as planning or reasoning. ASP solvers enforce stable model semantics, which rule out solutions representing certain kinds of circular reasoning. Unfortunately, current ASP solvers are incapable of solving p...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theory and practice of logic programming Jg. 13; H. 4-5; S. 517 - 532
Hauptverfasser:	AZIZ, REHAN ABDUL, CHU, GEOFFREY, STUCKEY, PETER J.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cambridge, UK Cambridge University Press 01.07.2013
Schlagworte:	Algorithms Declarative programming Domains Integer programming International conferences Logic programming Mathematical programming Reasoning Regular Papers Semantics Solvers Variables Australia stable model semantics finite domain solving answer set programming
ISSN:	1471-0684, 1475-3081
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!