BIO Logical Agents: Norms, Beliefs, Intentions in Defeasible Logic

In this paper we follow the BOID (Belief, Obligation, Intention, Desire) architecture to describe agents and agent types in Defeasible Logic. We argue, in particular, that the introduction of obligations can provide a new reading of the concepts of intention and intentionality. Then we examine the notion of social agent (i.e., an agent where obligations prevail over intentions) and discuss some computational and philosophical issues related to it. We show that the notion of social agent either requires more complex computations or has some philosophical drawbacks.

Agents as multi-threaded logical objects

In this paper we describe a distributed object oriented logic programming language in which an object is a collection of threads deductively accessing and updating a shared logic program. The key features of the language, such as static and dynamic object methods and multiple inheritance, are illustrated through a series of small examples. We show how we can implement object servers, allowing remote spawning of objects, which we can use as staging posts for mobile agents. We give as an example an information gathering mobile agent that can be queried about the information it has so far gathered whilst it is gathering new information. Finally we define a class of co-operative reasoning agents that can do resource bounded inference for full first order predicate logic, handling multiple queries and information updates concurrently. We believe that the combination of the concurrent OO and the LP programming paradigms produces a powerful tool for quickly implementing rational multi-agent applications on the internet.

Dissecting query performance in logical data models: Parsimony vs. greater ontological clarity

Even when data repositories exhibit near perfect data quality, users may formulate queries that do not correspond to the information requested. Users’ poor information retrieval performance may arise from either problems understanding of the data models that represent the real world systems, or their query skills. This research focuses on users’ understanding of the data structures, i.e., their ability to map the information request and the data model. The Bunge-Wand-Weber ontology was used to formulate three sets of hypotheses. Two laboratory experiments (one using a small data model and one using a larger data model) tested the effect of ontological clarity on users’ performance when undertaking component, record, and aggregate level tasks. The results indicate for the hypotheses associated with different representations but equivalent semantics that parsimonious data model participants performed better for component level tasks but that ontologically clearer data model participants performed better for record and aggregate level tasks.

A Computational Framework for Institutional Agency

This paper provides a computational framework, based on Defeasible Logic, to capture some aspects of institutional agency. Our background is Kanger-Lindahl-P\"orn account of organised interaction, which describes this interaction within a multi-modal logical setting. This work focuses in particular on the notions of counts-as link and on those of attempt and of personal and direct action to realise states of affairs. We show how standard Defeasible Logic can be extended to represent these concepts: the resulting system preserves some basic properties commonly attributed to them. In addition, the framework enjoys nice computational properties, as it turns out that the extension of any theory can be computed in time linear to the size of the theory itself.

Causal loops and the independence of causal facts

According to Hugh Mellor in Real Time II (1998, Ch. 12), assuming the logical independence of causal facts and the 'law of large numbers', causal loops are impossible because if they were possible they would produce inconsistent sets of frequencies. I clarify the argument, and argue that it would be preferable to abandon the relevant independence assumption in the case of causal loops.

Quantum error correction for continuously detected errors

We show that quantum feedback control can be used as a quantum-error-correction process for errors induced by a weak continuous measurement. In particular, when the error model is restricted to one, perfectly measured, error channel per physical qubit, quantum feedback can act to perfectly protect a stabilizer codespace. Using the stabilizer formalism we derive an explicit scheme, involving feedback and an additional constant Hamiltonian, to protect an (n-1)-qubit logical state encoded in n physical qubits. This works for both Poisson (jump) and white-noise (diffusion) measurement processes. Universal quantum computation is also possible in this scheme. As an example, we show that detected-spontaneous emission error correction with a driving Hamiltonian can greatly reduce the amount of redundancy required to protect a state from that which has been previously postulated [e.g., Alber , Phys. Rev. Lett. 86, 4402 (2001)].

Humans, dogs and parasitic zoonoses - Unravelling the relationships in a remote endemic community in Northeast India using molecular tools

Canine parasitic zoonoses pose a continuing public health problem, especially in developing countries and communities that are socioeconomically disadvantaged. Our study combined the use of conventional and molecular epidemic, logical tools to determine the role of dogs in transmission of gastrointestinal (GI) parasites such as hookworms, Giardia and Ascaris in a parasite endemic teagrowing community in northeast India. A highly sensitive and specific molecular tool was developed to detect and differentiate the zoonotic species of canine hookworm eggs directly from faeces. This allowed epidemiological screening of canine hookworm species in this community to be conducted with ease and accuracy. The zoonotic potential of canine Giardia was also investigated by characterising Giardia duodenalis recovered from humans and dogs living in the same locality and households at three different loci. Phylogenetic and epidemiological analysis provided compelling evidence to support the zoonotic transmission of canine Giardia. Molecular tools were also used to identify the species of Ascaris egg present in over 30% of dog faecal samples. The results demonstrated the role of dogs as a significant disseminator and environmental contaminator of Ascaris lumbricoides in communities where promiscuous defecation practices exist. Our study demonstrated the usefulness of combining conventional and molecular parasitological and epidemiological tools to help solve unresolved relationships with regards to parasitic zoonoses.

Molecular orbital calculations of two-electron states for P-donor solid-state spin qubits

We theoretically study the Hilbert space structure of two neighboring P-donor electrons in silicon-based quantum computer architectures. To use electron spins as qubits, a crucial condition is the isolation of the electron spins from their environment, including the electronic orbital degrees of freedom. We provide detailed electronic structure calculations of both the single donor electron wave function and the two-electron pair wave function. We adopted a molecular orbital method for the two-electron problem, forming a basis with the calculated single donor electron orbitals. Our two-electron basis contains many singlet and triplet orbital excited states, in addition to the two simple ground state singlet and triplet orbitals usually used in the Heitler-London approximation to describe the two-electron donor pair wave function. We determined the excitation spectrum of the two-donor system, and study its dependence on strain, lattice position, and interdonor separation. This allows us to determine how isolated the ground state singlet and triplet orbitals are from the rest of the excited state Hilbert space. In addition to calculating the energy spectrum, we are also able to evaluate the exchange coupling between the two donor electrons, and the double occupancy probability that both electrons will reside on the same P donor. These two quantities are very important for logical operations in solid-state quantum computing devices, as a large exchange coupling achieves faster gating times, while the magnitude of the double occupancy probability can affect the error rate.

Earth pressure on cantilever walls at design retained heights

There are many methods for the analysis and design of embedded cantilever retaining walls. They involve various different simplifications of the pressure distribution to allow calculation of the limiting equilibrium retained height and the bending moment when the retained height is less than the limiting equilibrium value, i.e. the serviceability case. Recently, a new method for determining the serviceability earth pressure and bending moment has been proposed. This method makes an assumption defining the point of zero net pressure. This assumption implies that the passive pressure is not fully mobilised immediately below the excavation level. The finite element analyses presented in this paper examine the net pressure distribution on walls in which the retained height is less, than the limiting equilibrium value. The study shows that for all practical walls, the earth pressure distributions on the front and back of the wall are at their limit values, Kp and K-a respectively, when the lumped factor of safety F-r is less than or equal to2.0. A rectilinear net pressure distribution is proposed that is intuitively logical. It produces good predictions of the complete bending moment diagram for walls in the service configuration and the proposed method gives results that have excellent agreement with centrifuge model tests. The study shows that the method for determining the serviceability bending moment suggested by Padfield and Mair(1) in the CIRIA Report 104 gives excellent predictions of the maximum bending moment in practical cantilever walls. It provides the missing data that have been needed to verify and justify the CIRIA 104 method.

Unagi-sentences in Japanese and mutual knowledge

This paper examines the so-called ’Unagi-sentence‘ in Japanese. So far, it has been taken for granted that the Unagi-sentence is incomplete syntactically and/or semantically. Because its structure apparently neither provides a fully-fledged semantic meaning, nor furnishes a plausible syntactic pattern (such as ‘subject-predicate‘), a number of previous works have considered the Unagi-sentence to be elliptic, and consequently reconstructed it as a complete sentence or established intermediate structures to account for its grammatical form. Other researchers have not used elliptic solutions, but sought to discover logical connections between the parts of the Unagi-sentence themselves. As a result, fixing their entire attention on the internal structure of the Unagi-sentence, these researchers inevitably needed to establish hypothetical constructs in order to explain the structure of the Unagi-sentence. The present author believes that the Unagi-sentence is neither incomplete nor a result of some hypothetical processes. The Unagi-sentence stands on its own as a complete utterance. It is basically an NP utterance which can be expanded to the form NP1 wa + NP2 da and its variations. The occurrence of the Unagi-sentence depends heavily on a presupposed context and its pragmatic features, without which the Unagi-sentence cannot exist. It is these features that the present article seeks to elucidate.