On the complexity of mCP-nets

This is the author accepted manuscript. The final version is available from AAAI Publications via the link in this recordmCP-nets are an expressive and intuitive formalism based on CP-nets to reason about preferences of groups of agents. The dominance semantics of mCP-nets is based on the concept of voting, and different voting schemes give rise to different dominance semantics for the group. Unlike CP-nets, which received an extensive complexity analysis, mCP-nets, as reported multiple times in the literature, lack a precise study of the voting tasks' complexity. Prior to this work, only a complexity analysis of brute-force algorithms for these tasks was available, and this analysis only gave EXPTIME upper bounds for most of those problems. In this paper, we start to fill this gap by carrying out a precise computational complexity analysis of voting tasks on acyclic binary polynomially connected mCP-nets whose constituents are standard CP-nets. Interestingly, all these problems actually belong to various levels of the polynomial hierarchy, and some of them even belong to PTIME or LOGSPACE. Furthermore, for most of these problems, we provide completeness results, which show tight lower bounds for problems that (up to date) did not have any explicit non-obvious lower bound.This work has received funding from the EPSRC grants EP/J008346/1, EP/L012138/1, and EP/M025268/1

Production of a novel medium chain length Poly(3-hydroxyalkanoate) using unprocessed biodiesel waste and its evaluation as a tissue engineering scaffold

This study demonstrated the utilisation of unprocessed biodiesel waste as a carbon feedstock for Pseudomonas mendocina CH50, for the production of PHAs. A PHA yield of 39.5% CDM was obtained using 5% (v/v) biodiesel waste substrate. Chemical analysis confirmed that the polymer produced was poly(3-hydroxyhexanoate-co-3-hydroxyoctanoate-co-3- hydroxydecanoate-co-3-hydroxydodecanoate) or P(3HHx-3HO-3HD-3HDD). P(3HHx-3HO- 3HD-3HDD) was further characterised and evaluated for its use as a tissue engineering scaffold (TES). This study demonstrated that P(3HHx-3HO-3HD-3HDD) was biocompatible with the C2C12 (myoblast) cell line. In fact, the % cell proliferation of C2C12 on the P(3HHx-3HO-3HD-3HDD) scaffold was 72% higher than the standard tissue culture plastic confirming that this novel PHA was indeed a promising new material for soft tissue engineering

Fredkin Gates for Finite-valued Reversible and Conservative Logics

The basic principles and results of Conservative Logic introduced by Fredkin and Toffoli on the basis of a seminal paper of Landauer are extended to d-valued logics, with a special attention to three-valued logics. Different approaches to d-valued logics are examined in order to determine some possible universal sets of logic primitives. In particular, we consider the typical connectives of Lukasiewicz and Godel logics, as well as Chang's MV-algebras. As a result, some possible three-valued and d-valued universal gates are described which realize a functionally complete set of fundamental connectives.Comment: 57 pages, 10 figures, 16 tables, 2 diagram

Optimizing the computation of overriding

We introduce optimization techniques for reasoning in DLN---a recently introduced family of nonmonotonic description logics whose characterizing features appear well-suited to model the applicative examples naturally arising in biomedical domains and semantic web access control policies. Such optimizations are validated experimentally on large KBs with more than 30K axioms. Speedups exceed 1 order of magnitude. For the first time, response times compatible with real-time reasoning are obtained with nonmonotonic KBs of this size

Multimodality in Pervasive Environment

Future pervasive environments are expected to immerse users in a consistent world of probes, sensors and actuators. Multimodal interfaces combined with social computing interactions and high-performance networking can foster a new generation of pervasive environments. However, much work is still needed to harness the full potential of multimodal interaction. In this paper we discuss some short-term research goals, including advanced techniques for joining and correlating multiple data flows, each with its own approximations and uncertainty models. Also, we discuss some longer term objectives, like providing users with a mental model of their own multimodal "aura", enabling them to collaborate with the network infrastructure toward inter-modal correlation of multimodal inputs, much in the same way as the human brain extracts a single self-conscious experience from multiple sensorial data flows

Quantum Computer with Mixed States and Four-Valued Logic

In this paper we discuss a model of quantum computer in which a state is an operator of density matrix and gates are general quantum operations, not necessarily unitary. A mixed state (operator of density matrix) of n two-level quantum systems is considered as an element of 4^n-dimensional operator Hilbert space (Liouville space). It allows to use a quantum computer model with four-valued logic. The gates of this model are general superoperators which act on n-ququat state. Ququat is a quantum state in a four-dimensional (operator) Hilbert space. Unitary two-valued logic gates and quantum operations for an n-qubit open system are considered as four-valued logic gates acting on n-ququat. We discuss properties of quantum four-valued logic gates. In the paper we study universality for quantum four-valued logic gates.Comment: 17 page

Complexity of inconsistency-tolerant query answering in Datalog+/- under cardinality-based repairs

Querying inconsistent ontological knowledge bases is an important problem in practice, for which several inconsistencytolerant query answering semantics have been proposed, including query answering relative to all repairs, relative to the intersection of repairs, and relative to the intersection of closed repairs. In these semantics, one assumes that the input database is erroneous, and the notion of repair describes a maximally consistent subset of the input database, where different notions of maximality (such as subset and cardinality maximality) are considered. In this paper, we give a precise picture of the computational complexity of inconsistencytolerant (Boolean conjunctive) query answering in a wide range of Datalog± languages under the cardinality-based versions of the above three repair semantics