NoMoRe

NoMoRe: A system for non-monotonic reasoning under answer set semantics NoMoRe implements answer set semantics for normal logic programs. It realizes a novel paradigm to compute answer sets by computing a-colorings (non-standard graph colorings with two colors) of the block graph (a labeled digraph) associated with a given program $P$. Intuitively, an a-coloring reflects the set of generating rules for an answer set, which means that noMoRe is rule-based and not atom-based like most of the other known systems. Since the core system was designed for propositional programs only, we have integrated lparse as a grounder in order to deal with variables. Furthermore, we have included an interface to the graph drawing tool DaVinci for visualization of block graphs. This allows for a structural analysis of programs.


References in zbMATH (referenced in 22 articles , 1 standard article )

Showing results 1 to 20 of 22.
Sorted by year (citations)

1 2 next

  1. Faber, Wolfgang; Leone, Nicola; Perri, Simona: The intelligent grounder of DLV (2012)
  2. Faber, Wolfgang; Pfeifer, Gerald; Leone, Nicola: Semantics and complexity of recursive aggregates in answer set programming (2011)
  3. Hue, Julien; Papini, Odile; Würbel, Eric: Implementing prioritized merging with ASP (2010)
  4. Hué, Julien; Papini, Odile; Würbel, Eric: Merging belief bases represented by logic programs (2009)
  5. Calimeri, F.; Perri, S.; Ricca, F.: Experimenting with parallelism for the instantiation of ASP programs (2008)
  6. Lefèvre, Claire; Nicolas, Pascal: Integrating grounding in the search process for answer set computing (2008)
  7. Perri, Simona; Ricca, Francesco; Vescio, Saverio: Efficient parallel ASP instantiation via dynamic rewriting (2008)
  8. Perri, Simona; Scarcello, Francesco; Catalano, Gelsomina; Leone, Nicola: Enhancing DLV instantiator by backjumping techniques (2007)
  9. Tu, Phan Huy; Son, Tran Cao; Baral, Chitta: Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming (2007)
  10. Calimeri, Francesco; Faber, Wolfgang; Pfeifer, Gerald; Leone, Nicola: Pruning operators for disjunctive logic programming systems (2006)
  11. Calimeri, Francesco; Ianni, Giovambattista: Template programs for disjunctive logic programming: an operational semantics (2006)
  12. Konczak, Kathrin; Linke, Thomas; Schaub, Torsten: Graphs and colorings for answer set programming (2006)
  13. Anger, Christian; Gebser, Martin; Linke, Thomas; Neumann, André; Schaub, Torsten: The nomore++ approach to answer set solving (2005)
  14. Linke, Thomas; Sarsakov, Vladimir: Suitable graphs for answer set programming (2005)
  15. Konczak, Kathrin; Linke, Thomas; Schaub, Torsten: Graphs and colorings for answer set programming: Abridged report (2004)
  16. Koch, Christoph; Leone, Nicola; Pfeifer, Gerald: Enhancing disjunctive logic programming systems by SAT checkers (2003)
  17. Konczak, Kathrin; Schaub, Torsten; Linke, Thomas: Graphs and colorings for answer set programming with preferences (2003)
  18. Anger, Christian; Konczak, Kathrin; Linke, Thomas: NoMoRe: Non-monotonic reasoning with logic programs (2002)
  19. Linke, Thomas; Anger, Christian; Konczak, Kathrin: More on noMoRe (2002)
  20. Anger, Christian; Konczak, Kathrin; Linke, Thomas: NoMoRe: A system for non-monotonic reasoning under answer set semantics (2001)

1 2 next