Narrow Results

The introduction of negation in Logic Programming using the Negation as Failure Rule causes some problems regarding the completeness of the SLDNF-Resolution proof procedure. One of the causes of incompleteness arises when evaluating a non-ground negative literal. This is solved by forbidding these evaluations. Obviously, there is the possibility of having only non-ground negative literals in the goal (the floundering of the goal). There is a class of programs and goals (allowed) that has been proved to have the non-floundering property. In this paper an algorithm is proposed which recognizes a wider class of programs with this property and which is based on abstract interpretation techniques.

The evaluation of feedback collected from students at the end of the year is very essential for every educational institution. It is important to improve the teaching–learning process and the annual appraisal process. The existing approach utilizes a Likert scale questionnaire, which allows students to express their level of agreement or disagreement with given statements or provide a neutral response. Additionally, the feedback form includes open-ended questions where students can provide textual feedback. This study introduces a Lexicon-based approach to automatically analyze the textual feedback concerning different aspects of teaching. Aspect-based Sentiment Analysis (ABSA) of student feedback aims to identify sentiments expressed toward various aspects of teachers, such as their ability to address student doubts and their overall knowledge. This study explores linguistic characteristics found in sentences, including negation, modifiers and contact shifters. To assess the sentiment of a sentence, the SentiWordNet lexicon is utilized to assign scores to individual words. Based on these scores, the sentence is categorized as either positive, negative or neutral. According to the experimental findings, the Aspect-Oriented Lexicon-Based (AOLB) approach demonstrates superior performance compared to other baseline methods when it comes to accurately scoring sentiment. The approach achieved a high accuracy rate of 94% for the student feedback dataset-I, 74% for the student feedback dataset-II, 55% for laptop reviews and 59% for restaurant reviews in the SemEval 2014 dataset-III.

In this work, we present several ways to obtain different types of weighting triangles, due to these types characterize some interesting properties of Extended Ordered Weighted Averaging operators, EOWA, and Extended Quasi-linear Weighted Mean, EQLWM, as well as of their reverse functions. We show that any quantifier determines an EOWA operator which is also an Extended Aggregation Function, EAF, i.e., the weighting triangle generated by a quantifier is always regular. Moreover, we present different results about generation of weighting triangles by means of sequences and fractal structures. Finally, we introduce a degree of orness of a weighting triangle associated with an EOWA operator. After that, we mention some results on each class of triangle, considering each one of these triangles as triangles associated with their corresponding EOWA operator, and we calculate the ornessof some interesting examples.

Grouping functions, as one new case of not necessarily associative particular binary aggregation functions, have been proposed in the literature for their vast applications in fuzzy community detection problems, image processing and decision making. On the other hand, due to the wide applications in fuzzy reasoning, fuzzy control and approximate reasoning, the investigations of fuzzy implications derived from specific binary aggregation functions become a natural and hot research topic. In this paper, we focus on this research area and consider the ${\mathcal{ℐ}}_{\mathcal{𝒢},\mathcal{𝒩}}$-implications induced from quasi-grouping functions and negations on bounded lattices. To be precise, firstly, by removing the continuity condition, we extend the notion of grouping functions on the unit closed interval to the so-called quasi-grouping functions on bounded lattices. Secondly, we give some basic properties and two construction methods of quasi-grouping functions on bounded lattices. Finally, we give the concept of ${\mathcal{ℐ}}_{\mathcal{𝒢},\mathcal{𝒩}}$-implications and focus on the conditions under which they can satisfy the certain algebraic properties possessed by implications on bounded lattices.

This paper is devoted to the investigation of commutative implications on a complete lattice L. It is proved that the disjunctive normal form (DNF) of a linguistic composition * is included in the conjunctive normal form (CNF) of that *, i.e., DNF(*) ≤ CNF(*) holds, for a special family of t-norms, t-conorms and negations induced by commutative implications.

To generate a proper Korean predicate, a natural modal expression is the most important factor for a machine translation (MT) system. Tense, aspect, mood, negation, and voice are the major constituents related to modal expression. The linguistic encoding of a modal expression is quite different between Chinese and Korean in terms of linguistic typology and genealogy. In this paper, a new applicable categorization of Korean modality system viz. tense, aspect, mood, negation, and voice, will be proposed through a contrastive analysis of Chinese and Korean from the viewpoint of a practical MT system. In order to precisely determine the modal expression, effective feature selection frameworks for Chinese are presented with a variety of machine learning methods. As a result, our proposed approach achieved an accuracy of 83.10%.

A simple recurrent network with a perceptual simulation layer was trained on a corpus of affirmative and negated sentences. Linguistic negation can be encoded by the network via the inclusion (or absence) of features and categories associated with the senses, in one step, without the need for an explicit logical operation or for treating the negating word any differently than any other words. Visualizing negation as a trajectory in perceptual simulation space is explored in detail, and the implications for artificial intelligence, embodied computational models, and more practical implications of everyday use of negations are discussed.

We place the concept of dialectic synthesis in a fuzzy logic setting. Our purpose is to use the triplet thesis–antithesis–synthesis in applications to human trafficking and modern slavery. We are particularly interested in a country’s government’s response to its vulnerability to these situations.