We propose a framework to compute the utility of an agreement w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas in a decidable fragment of First-order Logic and agreements expressed as a formula. We ground our framework in Description Logics (DL) endowed with disjunction, to be compliant with Semantic Web technologies. A logi...

Access management for learning communities requires a unified theory, sustaining the implementation of instructional policies, for ‘social networks’. The management method we have reached is based on the integration of content-rich resources in ‘operations’ that model/control the access of those seeking to learn something by using them, with or without assistance. Activities may be sequenced em...

Measuring inconsistency degrees of knowledge bases of different agents facilitates the understanding of an agent to her environment. Several semantic and syntactic based approaches have been proposed to quantify inconsistencies. By analyzing the limitations of existing approaches, we deeply explore the logical property of the Additivity condition through the connected components based on a grap...

We present the architecture and design details of a logic database system that extends functionality in a number of ways. The system supports indefinite (non-Horn) facts in extensional database (EDB) and existential quantification in intensional database (IDB) rules. Semantic query optimization is integrated as part of the query processing module. The system also deals with efficient rule manag...

In this paper, we address the problem of specifying a property in LTL over a subset of the states of a system under test, ignoring the rest of the states. A modern LTL semantics that applies for both finite and infinite traces is considered. We introduce specialized operators (syntax and semantic) that help specifying properties over propositional scopes, where each scope constitute a subset of...

Uncertainty reasoning is one of the important issues of many research fields, such as artificial intelligence, knowledge-based systems, data-mining etc.. This paper proposes the theory of uncertainty reasoning in the “If...then...” type uncertainty reasoning mode based on the lattice-valued first-order logic Lvfl. The “If...then...” rule presented here is the rule in which both antecedent and c...

The area of belief revision studies how a rational agent may incorporate new information about a domain into its belief corpus. An agent is characterized by a belief stateK, and receives a new item of information α which is to be included among its set of beliefs. Revision then is a function from a belief state and a formula to a new belief state. We propose here a more general framework for be...

This study investigated the effect of using visual aids, semantic elaboration, and visual aids plus semantic elaboration on the Iranian EFL learners' vocabulary learning. To conduct the study, the researchers assigned 49 elementary learners to three homogeneous groups according to their proficiency level. Then, a pre-test of Paribakht and Wesche's Vocabulary Knowledge Scale was given to each gr...

Fibring is defined as a mechanism for combining logics with a firstorder base, at both the semantic and deductive levels. A completeness theorem is established for a wide class of such logics, using a variation of the Henkin method that takes advantage of the presence of equality and inequality in the logic. As a corollary, completeness is shown to be preserved when fibring logics in that class...