The non-monotonic reasoning system noMoRe [2] implements answer set semantics for normal logic programs. It realizes a novel, rule-based paradigm to compute answer sets by computing non-standard graph colorings of the block graph associated with a given logic program (see [8],[9],[6] for details). These non-standard graph colorings are called a-colorings or application-colorings since they reflect the set of generating rules (applied rules) for an answer set. Hence noMoRe is rule-based and not atom-based like most of the other known systems. In the recent release of noMoRe we have added backward propagation of partial a-colorings and a technique called jumping in order to ensure full (backward) propagation [6]. Both techniques improve the search space pruning of noMoRe. Furthermore, we have extended the syntax by integrity, weight and cardinality constraints [11],[5]1.
[1]
Patrik Simons,et al.
Extending the Stable Model Semantics with More Expressive Rules
,
1999,
LPNMR.
[2]
Thomas Linke,et al.
NoMoRe : A System for Non-Monotonic Reasoning under Answer Set Semantics
,
2001,
LPNMR.
[3]
Ilkka Niemelä,et al.
Stable Model Semantics of Weight Constraint Rules
,
1999,
LPNMR.
[4]
Thomas Linke,et al.
Graph Theoretical Characterization and Computation of Answer Sets
,
2001,
IJCAI.
[5]
Thomas Linke,et al.
More on noMoRe
,
2002,
JELIA.
[6]
Victor W. Marek,et al.
Experimenting with Nonmonotonic Reasoning
,
1995,
ICLP.