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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theory and practice of logic programming Ročník 13; číslo 4-5; s. 517 - 532
Hlavní autori:	AZIZ, REHAN ABDUL, CHU, GEOFFREY, STUCKEY, PETER J.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cambridge, UK Cambridge University Press 01.07.2013
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!