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.

Weak and strong disjunction in possibilistic ASP

Possibilistic answer set programming (PASP) unites answer set programming (ASP) and possibilistic logic (PL) by associating certainty values with rules. The resulting framework allows to combine both non-monotonic reasoning and reasoning under uncertainty in a single framework. While PASP has been well-studied for possibilistic definite and possibilistic normal programs, we argue that the current semantics of possibilistic disjunctive programs are not entirely satisfactory. The problem is twofold. First, the treatment of negation-as-failure in existing approaches follows an all-or-nothing scheme that is hard to match with the graded notion of proof underlying PASP. Second, we advocate that the notion of disjunction can be interpreted in several ways. In particular, in addition to the view of ordinary ASP where disjunctions are used to induce a non-deterministic choice, the possibilistic setting naturally leads to a more epistemic view of disjunction. In this paper, we propose a semantics for possibilistic disjunctive programs, discussing both views on disjunction. Extending our earlier work, we interpret such programs as sets of constraints on possibility distributions, whose least specific solutions correspond to answer sets.

Non-equilibrium properties of trapped ions under sudden application of a laser

Coherent quantum-state manipulation of trapped ions using classical laser fields is a trademark of modern quantum technologies. In this work, we study aspects of work statistics and irreversibility in a single trapped ion due to sudden interaction with the impinging laser. This is clearly an out-of-equilibrium process where work is performed through illumination of an ion by the laser. Starting with the explicit evaluation of the first moments of the work distribution, we proceed to a careful analysis of irreversibility as quantified by the nonequilibrium lag. The treatment employed here is not restricted to the Lamb-Dicke limit, what allows us to investigate the interplay between nonlinearities and irreversibility. We show, for instance, that in the resolved carrier and sideband regimes, variation of the Lamb-Dicke parameter may cause a non-monotonic behavior of the irreversibility indicator. Counterintuitively, we find a working point where nonlinearity helps reversibility, making the sudden quench of the Hamiltonian closer to what would have been obtained quasistatically and isothermally.

Maximum of dielectric permittivity caused by structural transition in ferroelectric BaTiO3-SrTiO3 superlattices

We invoke the onset of dislocations along the BaTiO3-SrTiO3 interface as reported by Wunderlich et al. to explain the non-monotonic behaviour of the dielectric permittivity as a function of superlattice periodicity and the less than four-fold in-plane symmetry at the dielectric maximum. At a periodicity of about 10/10, depending on composition and growth mechanism, several groups report a maximum of dielectric permittivity. In addition to that we observe in-plane symmetry less than tetragonal for 10/10 superlattices by HR-XRD, in contrast to initial low-resolution data from Tabata et al. thus challenging the assumption of unrelaxed strain all the way through the superlattice. The aim of this article is to link both effects to the increasing volume fraction of conducting layers close to the interface in series with the superlattice layers.

Variable temperature electrochemical strain microscopy of Sm-doped ceria

Variable temperature electrochemical strain microscopy has been used to study the electrochemical activity of Sm-doped ceria as a function of temperature and bias. The electrochemical strain microscopy hysteresis loops have been collected across the surface at different temperatures and the relative activity at different temperatures has been compared. The relaxation behavior of the signal at different temperatures has been also evaluated to relate kinetic process during bias induced electrochemical reactions with temperature and two different kinetic regimes have been identified. The strongly non-monotonic dependence of relaxation behavior on temperature is interpreted as evidence for water-mediated mechanisms.

Towards Possibilistic Fuzzy Answer Set Programming

Fuzzy answer set programming (FASP) is a generalization of answer set programming to continuous domains. As it can not readily take uncertainty into account, however, FASP is not suitable as a basis for approximate reasoning and cannot easily be used to derive conclusions from imprecise information. To cope with this, we propose an extension of FASP based on possibility theory. The resulting framework allows us to reason about uncertain information in continuous domains, and thus also about information that is imprecise or vague. We propose a syntactic procedure, based on an immediate consequence operator, and provide a characterization in terms of minimal models, which allows us to straightforwardly implement our framework using existing FASP solvers.

Answer set programs with optional rules: a possibilistic approach

Many problems in artificial intelligence can be encoded as answer set programs (ASP) in which some rules are uncertain. ASP programs with incorrect rules may have erroneous conclusions, but due to the non-monotonic nature of ASP, omitting a correct rule may also lead to errors. To derive the most certain conclusions from an uncertain ASP program, we thus need to consider all situations in which some, none, or all of the least certain rules are omitted. This corresponds to treating some rules as optional and reasoning about which conclusions remain valid regardless of the inclusion of these optional rules. While a version of possibilistic ASP (PASP) based on this view has recently been introduced, no implementation is currently available. In this paper we propose a simulation of the main reasoning tasks in PASP using (disjunctive) ASP programs, allowing us to take advantage of state-of-the-art ASP solvers. Furthermore, we identify how several interesting AI problems can be naturally seen as special cases of the considered reasoning tasks, including cautious abductive reasoning and conformant planning. As such, the proposed simulation enables us to solve instances of the latter problem types that are more general than what current solvers can handle.

From inconsistency handling to non-canonical requirements management: A logical perspective

As a class of defects in software requirements specification, inconsistency has been widely studied in both requirements engineering and software engineering. It has been increasingly recognized that maintaining consistency alone often results in some other types of non-canonical requirements, including incompleteness of a requirements specification, vague requirements statements, and redundant requirements statements. It is therefore desirable for inconsistency handling to take into account the related non-canonical requirements in requirements engineering. To address this issue, we propose an intuitive generalization of logical techniques for handling inconsistency to those that are suitable for managing non-canonical requirements, which deals with incompleteness and redundancy, in addition to inconsistency. We first argue that measuring non-canonical requirements plays a crucial role in handling them effectively. We then present a measure-driven logic framework for managing non-canonical requirements. The framework consists of five main parts, identifying non-canonical requirements, measuring them, generating candidate proposals for handling them, choosing commonly acceptable proposals, and revising them according to the chosen proposals. This generalization can be considered as an attempt to handle non-canonical requirements along with logic-based inconsistency handling in requirements engineering.

Lanthanide luminescent logic gate mimics in soft matter: [H(+)] and [F(-)] dual-input device in a polymer gel with potential for selective component release

The non-covalent incorporation of responsive luminescent lanthanide, Ln(iii), complexes with orthogonal outputs from Eu(iii) and Tb(iii) in a gel matrix allows for in situ logic operation with colorimetric outputs. Herein, we report an exemplar system with two inputs ([H(+)] and [F(-)]) within a p(HEMA-co-MMA) polymer organogel acting as a dual-responsive device and identify future potential for such systems.

Efficient RkNN Retrieval with Arbitrary Non-Metric Similarity Measures

A RkNN query returns all objects whose nearest k neighbors
contain the query object. In this paper, we consider RkNN
query processing in the case where the distances between
attribute values are not necessarily metric. Dissimilarities
between objects could then be a monotonic aggregate of dissimilarities
between their values, such aggregation functions
being specified at query time. We outline real world cases
that motivate RkNN processing in such scenarios. We consider
the AL-Tree index and its applicability in RkNN query
processing. We develop an approach that exploits the group
level reasoning enabled by the AL-Tree in RkNN processing.
We evaluate our approach against a Naive approach
that performs sequential scans on contiguous data and an
improved block-based approach that we provide. We use
real-world datasets and synthetic data with varying characteristics
for our experiments. This extensive empirical
evaluation shows that our approach is better than existing
methods in terms of computational and disk access costs,
leading to significantly better response times.