A general framework for measuring inconsistency through minimal inconsistent sets

Hunter and Konieczny explored the relationships between measures of inconsistency for a belief base and the minimal inconsistent subsets of that belief base in several of their papers. In particular, an inconsistency value termed MIVC, defined from minimal inconsistent subsets, can be considered as a Shapley Inconsistency Value. Moreover, it can be axiomatized completely in terms of five simple axioms. MinInc, one of the five axioms, states that each minimal inconsistent set has the same amount of conflict. However, it conflicts with the intuition illustrated by the lottery paradox, which states that as the size of a minimal inconsistent belief base increases, the degree of inconsistency of that belief base becomes smaller. To address this, we present two kinds of revised inconsistency measures for a belief base from its minimal inconsistent subsets. Each of these measures considers the size of each minimal inconsistent subset as well as the number of minimal inconsistent subsets of a belief base. More specifically, we first present a vectorial measure to capture the inconsistency for a belief base, which is more discriminative than MIVC. Then we present a family of weighted inconsistency measures based on the vectorial inconsistency measure, which allow us to capture the inconsistency for a belief base in terms of a single numerical value as usual. We also show that each of the two kinds of revised inconsistency measures can be considered as a particular Shapley Inconsistency Value, and can be axiomatically characterized by the corresponding revised axioms presented in this paper.

Measuring conflict and agreement between two prioritized knowledge bases in possibilistic logic.

In this paper we investigate the relationship between two prioritized knowledge bases by measuring both the conflict and the agreement between them.First of all, a quantity of conflict and two quantities of agreement are defined. The former is shown to be a generalization of the well-known Dalal distance which is the hamming distance between two interpretations. The latter are, respectively, a quantity of strong agreement which measures the amount ofinformation on which two belief bases “totally” agree, and a quantity of weak agreement which measures the amount of information that is believed by onesource but is unknown to the other. All three quantity measures are based on the weighted prime implicant, which represents beliefs in a prioritized belief base. We then define a degree of conflict and two degrees of agreement based on our quantity of conflict and quantities of agreement. We also consider the impact of these measures on belief merging and information source ordering.

Effect of temporal separation on synchronization in rhythmic performance

A variety of short time delays inserted between pairs of subjects were found to affect their ability to synchronize a musical task. The subjects performed a clapping rhythm together from separate sound-isolated rooms via headphones and without visual contact. One-way time delays between pairs were manipulated electronically in the range of 3 to 78 ms. We are interested in quantifying the envelope of time delay within which two individuals produce synchronous per- formances. The results indicate that there are distinct regimes of mutually coupled behavior, and that `natural time delay'o¨delay within the narrow range associated with travel times across spatial arrangements of groups and ensembleso¨supports the most stable performance. Conditions outside of this envelope, with time delays both below and above it, create characteristic interaction dynamics in the mutually coupled actions of the duo. Trials at extremely short delays (corresponding to unnaturally close proximity) had a tendency to accelerate from anticipation. Synchronization lagged at longer delays (larger than usual physical distances) and produced an increasingly severe deceleration and then deterioration of performed rhythms. The study has implications for music collaboration over the Internet and suggests that stable rhythmic performance can be achieved by `wired ensembles' across distances of thousands of kilometers.

A hybrid metaheuristic approach to the university course timetabling problem

This paper describes the development of a novel metaheuristic that combines an electromagnetic-like mechanism (EM) and the great deluge algorithm (GD) for the University course timetabling problem. This well-known timetabling problem assigns lectures to specific numbers of timeslots and rooms maximizing the overall quality of the timetable while taking various constraints into account. EM is a population-based stochastic global optimization algorithm that is based on the theory of physics, simulating attraction and repulsion of sample points in moving toward optimality. GD is a local search procedure that allows worse solutions to be accepted based on some given upper boundary or ‘level’. In this paper, the dynamic force calculated from the attraction-repulsion mechanism is used as a decreasing rate to update the ‘level’ within the search process. The proposed method has been applied to a range of benchmark university course timetabling test problems from the literature. Moreover, the viability of the method has been tested by comparing its results with other reported results from the literature, demonstrating that the method is able to produce improved solutions to those currently published. We believe this is due to the combination of both approaches and the ability of the resultant algorithm to converge all solutions at every search process.

Dynamic evolution of the genetic search region through fuzzy coding

A technique for automatic exploration of the genetic search region through fuzzy coding (Sharma and Irwin, 2003) has been proposed. Fuzzy coding (FC) provides the value of a variable on the basis of the optimum number of selected fuzzy sets and their effectiveness in terms of degree-of-membership. It is an indirect encoding method and has been shown to perform better than other conventional binary, Gray and floating-point encoding methods. However, the static range of the membership functions is a major problem in fuzzy coding, resulting in longer times to arrive at an optimum solution in large or complicated search spaces. This paper proposes a new algorithm, called fuzzy coding with a dynamic range (FCDR), which dynamically allocates the range of the variables to evolve an effective search region, thereby achieving faster convergence. Results are presented for two benchmark optimisation problems, and also for a case study involving neural identification of a highly non-linear pH neutralisation process from experimental data. It is shown that dynamic exploration of the genetic search region is effective for parameter optimisation in problems where the search space is complicated.

A New Gradient Descent Approach for Local Learning of Fuzzy Neural Models

The majority of reported learning methods for Takagi-Sugeno-Kang fuzzy neural models to date mainly focus on the improvement of their accuracy. However, one of the key design requirements in building an interpretable fuzzy model is that each obtained rule consequent must match well with the system local behaviour when all the rules are aggregated to produce the overall system output. This is one of the distinctive characteristics from black-box models such as neural networks. Therefore, how to find a desirable set of fuzzy partitions and, hence, to identify the corresponding consequent models which can be directly explained in terms of system behaviour presents a critical step in fuzzy neural modelling. In this paper, a new learning approach considering both nonlinear parameters in the rule premises and linear parameters in the rule consequents is proposed. Unlike the conventional two-stage optimization procedure widely practised in the field where the two sets of parameters are optimized separately, the consequent parameters are transformed into a dependent set on the premise parameters, thereby enabling the introduction of a new integrated gradient descent learning approach. A new Jacobian matrix is thus proposed and efficiently computed to achieve a more accurate approximation of the cost function by using the second-order Levenberg-Marquardt optimization method. Several other interpretability issues about the fuzzy neural model are also discussed and integrated into this new learning approach. Numerical examples are presented to illustrate the resultant structure of the fuzzy neural models and the effectiveness of the proposed new algorithm, and compared with the results from some well-known methods.

Possibilistic Information Fusion Using Maximal Coherent Subsets

When multiple sources provide information about the same unknown quantity, their fusion into a synthetic interpretable message is often a tedious problem, especially when sources are conicting. In this paper, we propose to use possibility theory and the notion of maximal coherent subsets, often used in logic-based representations, to build a fuzzy belief structure that will be instrumental both for extracting useful information about various features of the information conveyed by the sources and for compressing this information into a unique possibility distribution. Extensions and properties of the basic fusion rule are also studied.

A graded BDI agent model to represent and reason about preferences

In this research note, we introduce a graded BDI agent development framework, g-BDI for short, that allows to build agents as multi-context systems that reason about three fundamental and graded mental attitudes (i.e. beliefs, desires and intentions). We propose a sound and complete logical framework for them and some logical extensions to accommodate slightly different views on desires. © 2011 Elsevier B.V. All rights reserved.

A sequential algorithm for sparse support vector classifiers

Support vector machines (SVMs), though accurate, are not preferred in applications requiring high classification speed or when deployed in systems of limited computational resources, due to the large number of support vectors involved in the model. To overcome this problem we have devised a primal SVM method with the following properties: (1) it solves for the SVM representation without the need to invoke the representer theorem, (2) forward and backward selections are combined to approach the final globally optimal solution, and (3) a criterion is introduced for identification of support vectors leading to a much reduced support vector set. In addition to introducing this method the paper analyzes the complexity of the algorithm and presents test results on three public benchmark problems and a human activity recognition application. These applications demonstrate the effectiveness and efficiency of the proposed algorithm.


--------------------------------------------------------------------------------

A defeasible reasoning model of inductive concept learning from examples and communication

This paper introduces a logical model of inductive generalization, and specifically of the machine learning task of inductive concept learning (ICL). We argue that some inductive processes, like ICL, can be seen as a form of defeasible reasoning. We define a consequence relation characterizing which hypotheses can be induced from given sets of examples, and study its properties, showing they correspond to a rather well-behaved non-monotonic logic. We will also show that with the addition of a preference relation on inductive theories we can characterize the inductive bias of ICL algorithms. The second part of the paper shows how this logical characterization of inductive generalization can be integrated with another form of non-monotonic reasoning (argumentation), to define a model of multiagent ICL. This integration allows two or more agents to learn, in a consistent way, both from induction and from arguments used in the communication between them. We show that the inductive theories achieved by multiagent induction plus argumentation are sound, i.e. they are precisely the same as the inductive theories built by a single agent with all data. © 2012 Elsevier B.V.

Constraint rule-based programming of norms for electronic institutions

Norms constitute a powerful coordination mechanism among heterogeneous agents. In this paper, we propose a rule language to specify and explicitly manage the normative positions of agents (permissions, prohibitions and obligations), with which distinct deontic notions and their relationships can be captured. Our rule-based formalism includes constraints for more expressiveness and precision and allows to supplement (and implement) electronic institutions with norms. We also show how some normative aspects are given computational interpretation. © 2008 Springer Science+Business Media, LLC.

Lorentz TEM investigation of the switching behavior in artificial spin ice building blocks

Frustration – the inability to simultaneously satisfy all interactions – occurs in a wide range of systems including neural networks, water ice and magnetic systems. An example of the latter is the so called spin-ice in pyrochlore materials [1] which have attracted a lot of interest not least due to the emergence of magnetic monopole defects when the ‘ice rules’ governing the local ordering breaks down [2]. However it is not possible to directly measure the frustrated property – the direction of the magnetic moments – in such spin ice systems with current experimental techniques. This problem can be solved by instead studying artificial spin-ice systems where the molecular magnetic moments are replaced by nanoscale ferromagnetic islands [3-8]. Two different arrangements of the ferromagnetic islands have been shown to exhibit spin ice behaviour: a square lattice maintaining four moments at each vertex [3,8] and the Kagome lattice which has only three moments per vertex but equivalent interactions between them [4-7]. Magnetic monopole defects have been observed in both types of lattices [7-8]. One of the challenges when studying these artificial spin-ice systems is that it is difficult to arrive at the fully demagnetised ground-state [6-8].
Here we present a study of the switching behaviour of building blocks of the Kagome lattice influenced by the termination of the lattice. Ferromagnetic islands of nominal size 1000 nm by 100 nm were fabricated in five island blocks using electron-beam lithography and lift-off techniques of evaporated 18 nm Permalloy (Ni80Fe20) films. Each block consists of a central island with four arms terminated by a different number and placement of ‘injection pads’, see Figure 1. The islands are single domain and magnetised along their long axis. The structures were grown on a 50 nm thick electron transparent silicon nitride membrane to allow TEM observation, which was back-coated with a 5 nm film of Au to prevent charge build-up during the TEM experiments.
To study the switching behaviour the sample was subjected to a magnetic field strong enough to magnetise all the blocks in one direction, see Figure 1. Each block obeys the Kagome lattice ‘ice-rules’ of “2-in, 1-out” or “1-in, 2-out” in this fully magnetised state. Fresnel mode Lorentz TEM images of the sample were then recorded as a magnetic field of increasing magnitude was applied in the opposite direction. While the Fresnel mode is normally used to image magnetic domain structures [9] for these types of samples it is possible to deduce the direction of the magnetisation from the Lorentz contrast [5]. All images were recorded at the same over-focus judged to give good Lorentz contrast.
The magnetisation was found to switch at different magnitudes of the applied field for nominally identical blocks. However, trends could still be identified: all the blocks with any injection pads, regardless of placement and number, switched the direction of the magnetisation of their central island at significantly smaller magnitudes of the applied magnetic field than the blocks without injection pads. It can therefore be concluded that the addition of an injection pad lowers the energy barrier to switching the connected island, acting as a nucleation site for monopole defects. In these five island blocks the defects immediately propagate through to the other side, but in a larger lattice the monopoles could potentially become trapped at a vertex and observed [10].
References

[1] M J Harris et al, Phys Rev Lett 79 (1997) p.2554.
[2] C Castelnovo, R Moessner and S L Sondhi, Nature 451 (2008) p. 42.
[3] R F Wang et al, Nature 439 (2006) 303.
[4] M Tanaka et al, Phys Rev B 73 (2006) 052411.
[5] Y Qi, T Brintlinger and J Cumings, Phys Rev B 77 (2008) 094418.
[6] E Mengotti et al, Phys Rev B 78 (2008) 144402.
[7] S Ladak et al, Nature Phys 6 (2010) 359.
[8] C Phatak et al, Phys Rev B 83 (2011) 174431.
[9] J N Chapman, J Phys D 17 (1984) 623.
[10] The authors gratefully acknowledge funding from the EPSRC under grant number EP/D063329/1.