A principled framework for modular web rule bases and its semantics

We present a principled framework for modular web rule bases, called MWeb. According to this framework, each predicate defined in a rule base is characterized by its defining reasoning mode, scope, and exporting rule base list. Each predicate used in a rule base is characterized by its requesting reasoning mode and importing rule base list. For valid MWeb modular rule bases S, theMWebAS andMWebWFS semantics of each rule base s ∈ S w.r.t. S are defined, model-theoretically. These semantics extend the answer set semantics (AS) and the well-founded semantics with explicit negation (WFSX) on ELPs, respectively, keeping all of their semantical and computational characteristics. Our framework supports: (i) local semantics and different points of view, (ii) local closed-world and open-world assumptions, (iii) scoped negation-as-failure, and (iv) restricted propagation of local inconsistencies. Additionally, it guarantees monotonicity of reasoning, in the case that new rule bases are added to the modular rule base, while the importing rule base list of the predicates of the old rule bases remains the same

Reducing fuzzy answer set programming to model finding in fuzzy logics

In recent years, answer set programming (ASP) has been extended to deal with multivalued predicates. The resulting formalisms allow for the modeling of continuous problems as elegantly as ASP allows for the modeling of discrete problems, by combining the stable model semantics underlying ASP with fuzzy logics. However, contrary to the case of classical ASP where many efficient solvers have been constructed, to date there is no efficient fuzzy ASP solver. A well-known technique for classical ASP consists of translating an ASP program P to a propositional theory whose models exactly correspond to the answer sets of P. In this paper, we show how this idea can be extended to fuzzy ASP, paving the way to implement efficient fuzzy ASP solvers that can take advantage of existing fuzzy logic reasoners

Query Answering in Normal Logic Programs under Uncertainty

We present a simple, yet general top-down query answering procedure for normal logic programs over lattices and bilattices, where functions may appear in the rule bodies. Its interest relies on the fact that many approaches to paraconsistency and uncertainty in logic programs with or without non-monotonic negation are based on bilattices or lattices, respectively

Patterns of European youngsters’ daily use of media

The mediatisation of young people daily lives constitutes a significant subject due to the expressive use of media in their daily routines. In this article, we resort to a representative sample of 3609 online respondents aged between 14 and 30 years old from nine European countries (Belgium, Croatia, Denmark, Germany, Hungary, Israel, Italy, Poland and Portugal), in order to perceive the impact new (and “old”) media have in these youngsters daily media consumption activities. The results of this online survey show complementary uses between networked and traditional media, but also highlight a gradual substitution of “old” by “new” networked individualized media when leisure and news-related activities are at stake.info:eu-repo/semantics/publishedVersio