Contextual Deliberation of Cognitive Agents in Defeasible Logic

This article extends Defeasible Logic to deal with the contextual deliberation process of cognitive agents. First, we introduce meta-rules to reason with rules. Meta-rules are rules that have as a consequent rules for motivational components, such as obligations, intentions and desires. In other words, they include nested rules. Second, we introduce explicit preferences among rules. They deal with complex structures where nested rules can be involved.

Adsorption of binary hydrocarbon mixtures in carbon slit pores: A density functional theory study

Adsorption of binary hydrocarbon mixtures involving methane in carbon slit pores is theoretically studied here from the viewpoints of separation and of the effect of impurities on methane storage. It is seen that even small amounts of ethane, propane, or butane can significantly reduce the methane capacity of carbons. Optimal pore sizes and pressures, depending on impurity concentration, are noted in the present work, suggesting that careful adsorbent and process design can lead to enhanced separation. These results are consistent with earlier literature studies for the infinite dilution limit. For methane storage applications a carbon micropore width of 11.4 Angstrom (based on distance between centers of carbon atoms on opposing walls) is found to be the most suitable from the point of view of lower impurity uptake during high-pressure adsorption and greater impurity retention during low-pressure delivery. The results also theoretically confirm unusual recently reported observations of enhanced methane adsorption in the presence of a small amount of heavier hydrocarbon impurity.

Binary vectors for sense and antisense expression of arabidopsis ESTs

Our laboratory is interested in devising methods to identify functions for the vast numbers of arabidopsis genes now available. For this purpose, we have constructed a set of binary vectors that will allow the quick production of transgenic arabidopsis plants containing either sense or antisense copies of EST clones obtained from the PRL2 library. These vectors are based on the pSLJ series containing the bialophos resistance (BAR) gene that confers resistance to the herbicide BASTA. Tn addition, our vectors contain a 35S CaMV promoter-polylinker-nos terminator cassette that allows the direct cloning of arabidopsis ESTs in either antisense (pAOV and pAOV2) or sense (pSOV and pSOV2) orientation. We also describe the construction of two additional vectors conferring BASTA resistance and containing the pBluescript polylinker in both orientations inserted between the 35S CaMV promoter and nos terminator (pKMB and pSMB).

Surface miscibility of EPC/DOTAP/DOPE in binary and ternary mixed monolayers

Surface pressure (pi)-molecular area (A) curves were used to characterize the packing of pseudo-ternary mixed Langmuir monolayers of egg phosphatidylcholine (EPC), 1,2-dioleoyl-3-trimethylammonium propane (DOTAP) and L-alpha-dioleoyl phosphatidylethanolamine (DOPE). This pseudo-ternary mixture EPC/DOPE/DOTAP has been successfully employed in liposome formulations designed for DNA non-viral vectors. Pseudo-binary mixtures were also studied as a control. Miscibility behavior was inferred from pi-A curves applying the additivity rule by calculating the excess free energy of mixture (Delta G(Exc)). The interaction between the lipids was also deduced from the surface compressional modulus (C(s)(-1)). The deviation from ideality shows dependence on the lipid polar head type and monolayer composition. For lower DOPE concentrations, the forces are predominantly attractive. However, if the monolayer is DOPE rich, the DOTAP presence disturbs the PE-PE intermolecular interaction and the net interaction is then repulsive. The ternary monolayer EPC/DOPE/DOTAP presented itself in two configurations, modulated by the DOPE content, in a similar behavior to the DOPE/DOTAP monolayers. These results contribute to the understanding of the lipid interactions and packing in self-assembled systems associated with the in vitro and in vivo stability of liposomes. (C) 2010 Elsevier B.V. All rights reserved.

Binary games with many players

We examine a problem with n players each facing the same binary choice. One choice is superior to the other. The simple assumption of competition - that an individual's payoff falls with a rise in the number of players making the same choice, guarantees the existence of a unique symmetric equilibrium (involving mixed strategies). As n increases, there are two opposing effects. First, events in the middle of the distribution - where a player finds itself having made the same choice as many others - become more likely, but the payoffs in these events fall. In opposition, events in the tails of the distribution - where a player finds itself having made the same choice as few others - become less likely, but the payoffs in these events remain high. We provide a sufficient condition (strong competition) under which an increase in the number of players leads to a reduction in the equilibrium probability that the superior choice is made.

Refining specifications to logic programs

The refinement calculus provides a framework for the stepwise development of imperative programs from specifications. In this paper we study a refinement calculus for deriving logic programs. Dealing with logic programs rather than imperative programs has the dual advantages that, due to the expressive power of logic programs, the final program is closer to the original specification, and each refinement step can achieve more. Together these reduce the overall number of derivation steps. We present a logic programming language extended with specification constructs (including general predicates, assertions, and types and invariants) to form a wide-spectrum language. General predicates allow non-executable properties to be included in specifications. Assertions, types and invariants make assumptions about the intended inputs of a procedure explicit, and can be used during refinement to optimize the constructed logic program. We provide a semantics for the extended logic programming language and derive a set of refinement laws. Finally we apply these to an example derivation.

Properties of rapidly solidified binary copper alloys

A number of binary Cu-X alloys (X = Fe, Cr, Si and Al) with alloying elements up to approximate to 12 at % for Fe and Cr, and = 20 at% for Al and Si were cast into thin ribbons (30-50 mu m thickness) by chill block melt spinning. The structural state of the as-cast ribbons was determined by X-ray diffraction (XRD) and microstructures of the quenched alloys were compared with the ingot equivalent, It was possible to achieve solid solution and fine dispersion of secondary phase beyond XRD detection up to approximate to 8 at% solute for Fe and Cr, which is beyond the expected concentration limits from equilibrium phase diagrams. The effects of alloying on resistivity and microhardness are also presented.

Model for Differential Nursing Diagnosis of Alterations in Urinary Elimination Based on Fuzzy Logic

Nursing diagnoses associated with alterations of urinary elimination require different interventions, Nurses, who are not specialists, require support to diagnose and manage patients with disturbances of urine elimination. The aim of this study was to present a model based on fuzzy logic for differential diagnosis of alterations in urinary elimination, considering nursing diagnosis approved by the North American Nursing Diagnosis Association, 2001-2002. Fuzzy relations and the maximum-minimum composition approach were used to develop the system. The model performance was evaluated with 195 cases from the database of a previous study, resulting in 79.0% of total concordance and 19.5% of partial concordance, when compared with the panel of experts. Total discordance was observed in only three cases (1.5%). The agreement between model and experts was excellent (kappa = 0.98, P < .0001) or substantial (kappa = 0.69, P < .0001) when considering the overestimative accordance (accordance was considered when at least one diagnosis was equal) and the underestimative discordance (discordance was considered when at least one diagnosis was different), respectively. The model herein presented showed good performance and a simple theoretical structure, therefore demanding few computational resources.

Developing logic programs from specifications using stepwise refinement

In this paper we demonstrate a refinement calculus for logic programs, which is a framework for developing logic programs from specifications. The paper is written in a tutorial-style, using a running example to illustrate how the refinement calculus is used to develop logic programs. The paper also presents an overview of some of the advanced features of the calculus, including the introduction of higher-order procedures and the refinement of abstract data types.

A refinement calculus for logic programs

Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic programming language, including executable constructs such as sequential conjunction, disjunction, and existential quantification, as well as specification constructs such as general predicates, assumptions and universal quantification. A declarative semantics is defined for this wide-spectrum language based on executions. Executions are partial functions from states to states, where a state is represented as a set of bindings. The semantics is used to define the meaning of programs and specifications, including parameters and recursion. To complete the calculus, a notion of correctness-preserving refinement over programs in the wide-spectrum language is defined and refinement laws for developing programs are introduced. The refinement calculus is illustrated using example derivations and prototype tool support is discussed.