• Publications
  • Influence
Voting procedures with incomplete preferences
TLDR
We extend the application of a voting procedure (usually defined on complete preference relations over candidates) when the voters’ preferences consist of partial orders. Expand
  • 233
  • 34
  • PDF
Graphs and colorings for answer set programming
TLDR
We investigate the usage of rule dependency graphs and their colorings for characterizing and computing answer sets of logic programs. Expand
  • 18
  • 3
  • PDF
NoMoRe : A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics
TLDR
NoMoRe is an alternative implementation paradigm to compute answer sets by computing non-standard graph colorings of labeled directed graphs associated with logic programs. Expand
  • 22
  • 1
Graphs and colorings for answer set programming: Abridged Report
TLDR
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. Expand
  • 18
  • 1
  • PDF
NoMoRe : Non-monotonic Reasoning with Logic Programs
TLDR
The non-monotonic reasoning system noMoRe implements answer set semantics for normal logic programs by computing non-standard graph colorings of the block graph associated with a given logic program (see [8],[9],[6] for details). Expand
  • 18
  • 1
  • PDF
A Glimpse of Answer Set Programming
TLDR
Answer Set Programming (ASP) is a declarative paradigm for solving search problems in knowledge representation and reasoning. Expand
  • 23
  • 1
  • PDF
Voting Theory in Answer Set Programming
TLDR
In this paper, we combine answer set programming with voting theory for the first time. Expand
  • 13
  • 1
  • PDF
NoMoRe : A System for Non-Monotonic Reasoning under Answer Set Semantics
TLDR
NoMoRe implements answer set semantics for normal logic programs by computing a-colorings (non-standard graph colorings with two colors) of the block graph (a labeled digraph) associated with a given program P. Expand
  • 21
More on noMoRe
TLDR
This paper focuses on the efficient computation of answer sets for normal logic programs. Expand
  • 13
  • PDF
Strong Equivalence for Logic Programs with Preferences
TLDR
In this paper we define the novel notion of strong equivalence for logic programs with preferences, which differs considerably from their relationship with respect to answer sets. Expand
  • 7
  • PDF