Hex Semantics via Approximation Fixpoint Theory

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.

[1]  Victor W. Marek,et al.  Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning , 2000 .

[2]  Wolfgang Faber,et al.  Logic Programming and Nonmonotonic Reasoning , 2011, Lecture Notes in Computer Science.

[3]  Victor W. Marek,et al.  Logic Programs With Monotone Cardinality Atoms , 2003, LPNMR.

[4]  Wolfgang Faber,et al.  Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity , 2004, JELIA.

[5]  Victor W. Marek,et al.  Ultimate approximation and its application in nonmonotonic knowledge representation systems , 2004, Inf. Comput..

[6]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[7]  Victor W. Marek,et al.  Uniform semantic treatment of default and autoepistemic logics , 2000, Artif. Intell..

[8]  Hans Tompits,et al.  Well-Founded Semantics for Description Logic Programs in the Semantic Web , 2004, RuleML.

[9]  Teodor C. Przymusinski.  The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..

[10]  Yi-Dong Shen,et al.  Well-Supported Semantics for Description Logic Programs , 2011, IJCAI.

[11]  Jack Minker,et al.  Logic-Based Artificial Intelligence , 2000 .

[12]  Rina S. Cohen,et al.  omega-Computations on Turing Machines , 1978, Theor. Comput. Sci..

[13]  Frank Wolter,et al.  Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.

[14]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[15]  Jack Minker,et al.  Circumscription and Disjunctive Logic Programming , 1991, Artificial and Mathematical Theory of Computation.

[16]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

[17]  Hans Tompits,et al.  A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming , 2005, IJCAI.

[18]  Thomas Eiter,et al.  Combining Nonmonotonic Knowledge Bases with External Sources , 2009, FroCoS.

[19]  Miroslaw Truszczynski,et al.  Strong and uniform equivalence of nonmonotonic theories – an algebraic approach , 2006, Annals of Mathematics and Artificial Intelligence.

[20]  Maurice Bruynooghe,et al.  Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs , 2012, Correct Reasoning.

[21]  Maurice Bruynooghe,et al.  Well-founded and stable semantics of logic programs with aggregates , 2007, Theory Pract. Log. Program..

[22]  Thomas Lukasiewicz,et al.  Well-founded semantics for description logic programs in the semantic web , 2004, TOCL.

[23]  Piero A. Bonatti,et al.  On finitely recursive programs1 , 2009, Theory and Practice of Logic Programming.

[24]  Miroslaw Truszczynski,et al.  Semantics of disjunctive programs with monotone aggregates - an operator-based approach , 2004, NMR.