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

Full description

Saved in:

Bibliographic Details
Published in:	Theory and practice of logic programming Vol. 13; no. 4-5; pp. 517 - 532
Main Authors:	AZIZ, REHAN ABDUL, CHU, GEOFFREY, STUCKEY, PETER J.
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.07.2013
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!