Paper Info
Title
Hex Semantics via Approximation Fixpoint Theory.
Abstract
Approximation Fixpoint Theory (AFT) is an algebraic framework for studying fixpoints of possibly nonmonotone lattice operators, and thus extends the fixpoint theory of Tarski and Knaster. In this paper, we uniformly define 2-, and 3-valued (ultimate) answer-set semantics, and well-founded semantics of disjunction-free HEX programs by applying AFT. In the case of disjunctive HEX programs, AFT is not directly applicable. However, we provide a definition of 2-valued (ultimate) answer-set semantics based on non-deterministic approximations and show that answer sets are minimal, supported, and derivable in terms of bottom-up computations. Finally, we extensively compare our semantics to closely related semantics, including constructive dl-program semantics. Since HEX programs are a generic formalism, our results are applicable to a wide range of formalisms.
Year
DOI
Venue
2013
10.1007/978-3-642-40564-8_11
Lecture Notes in Computer Science
Field
DocType
Volume
Operational semantics,Algebraic number,Constructive,Computer science,Algorithm,Operator (computer programming),Fixed point,Rotation formalisms in three dimensions,Semantics,Well-founded semantics
Conference
8148
ISSN
Citations 
PageRank 
0302-9743
12
0.54
References 
Authors
15
3
Name
Order
Citations
PageRank
Christian Antic1120.88
Thomas Eiter27238532.10
Michael Fink3114562.43