Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

KR
2010
Springer

favoriteEmaildiscussreport

226views Automated Reasoning» more KR 2010»

On the Progression Semantics and Boundedness of Answer Set Programs

13 years 2 months ago

On the Progression Semantics and Boundedness of Answer Set Programs

Download staff.scm.uws.edu.au

In this paper, we propose a progression semantics for firstorder answer set programs. Based on this new semantics, we are able to define the notion of boundedness for answer set programming. We prove that boundedness coincides with the notions of recursion-free and loop-free under program equivalence, and is also equivalent to first-order definability of answer set programs on arbitrary structures.

Yan Zhang, Yi Zhou

Real-time Traffic

Answer Set | Answer Set Programming | Answer Set Programs | Automated Reasoning | KR 2010 |

claim paper

Related Content

» Computing Fuzzy Answer Sets Using dlvhex

» On Reductive Semantics of Aggregates in Answer Set Programming

» Alternative Characterizations for Program Equivalence under AnswerSet Semantics Based on U...

» Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web

» Combining Answer Sets of Nonmonotonic Logic Programs

» Justifications for Logic Programs under Answer Set Semantics

» Finding Semantic Inconsistencies in UMLS using Answer Set Programming

» Towards a Fuzzy Answer Set Semantics for Residuated Logic Programs

» NoMoRe A System for Nonmonotonic Reasoning with Logic Programs under Answer Set Semantics

Post Info
More Details (n/a)

Added	14 Feb 2011
Updated	14 Feb 2011
Type	Journal
Year	2010
Where	KR
Authors	Yan Zhang, Yi Zhou

Comments (0)