Learn More
In the current paper, we reexamine the connection between formal argu-mentation and logic programming from the perspective of semantics. We observe that one particular translation from logic programs to instantiated argumentation (the one described by Wu, Caminada and Gabbay) is able to serve as a basis for describing various equivalences between logic(More)
In this work, paraconsistent answer sets for extended disjunctive logic programs are presented as a fully declarative approach. In order to do so, we introduce a frame-based semantics. Frames are a powerful and elegant tool which have been used to characterise and study substructural logics. Unlike the original definition, no kind of syntactic(More)
In this paper, we introduce a paraconsistent extension of Rough Description Logics which allows the representation of incomplete and contradictory concepts, as well as the lower and upper approximations of these kinds of concepts. Furthermore, we use the notions of approximations, which can be applied successively, to make restrictions or relaxations in the(More)
In this paper we develop a new semantics for disjunctive logic programs, called Well-Founded Semantics with Disjunction (WFS d), by resorting to a fixed point-based operator. Coinciding with the Well-Founded Semantics (WFS) for normal logic programs, our semantics is uniquely defined for every disjunctive logic program. By exploring examples , we show WFS d(More)
In this paper, we propose a way to model preferences so agents base their decisions on beliefs and can reason about such preferences. This connection allows agents to build arguments about their preferences or to explain decisions, and update preferences as they review beliefs. We also discuss how agents can reach decisions and the role played by(More)