bluuebunny/crossref_metadata_2025_split huggingface dataset:
A computed tomography scan application to evaluate adiposity in a minipig model of human obesity
Authors: Val-Laillet D. , Blat S. , Louveau I. , Malbert C. H. 
Published: July 2010

The aim of the present study was to describe and validate a computed tomography (CT) method to analyse adiposity distribution in Göttingen minipigs. Adiposity was evaluated in two groups of minipigs. In group 1 (n8), measurements were performed before and after the induction of obesity. In group 2 (n7), animals were fed rations designed to obtain heterogeneous adiposity before analyses. CT acquisitions were associated with anatomical, ultrasonography and body chemical measurements. Our CT method was based on acquisition of a single slice at a fixed anatomical landmark, calculation of individual X-ray density ranges for CT values and delineation of the three main adipose compartments (subcutaneous adipose tissue, SAT; retroperitoneal adipose tissue, RAT; and visceral adipose tissue, VAT). Our validation measures showed that the CT-scan method was accurate, sensitive and reliable. The CT data were found to be correlated with body weight, abdominal perimeter, ultrasonography, anatomical measurements and body chemical composition (fromr0·84 to 0·93,P < 0·001 for all), with a pitfall concerning the precise estimation of VAT. With increased body weight, the amount of adipose tissue increased and the relative proportion of SAT increased, whereas the relative proportion of RAT and VAT decreased (P < 0·001 for all). Adiposity measured by CT, and especially SAT, was found to be negatively correlated with insulin sensitivity (r0·54,P < 0·05). In conclusion, a precise evaluation of the adipose compartments in minipigs was done by CT. Therefore, the use of Göttingen minipigs is relevant to further investigate the relationship between the different adipose tissues and obesity.
European integration as colonial discourse
Authors: POLAT NECATI 
Published: July 2010

AbstractA not infrequent musing on the growing European integration is that the process may signal a historic discontinuity with the logic and functioning of the modern state, forming an alternative to the Westphalian order. This article takes issue with this notion, holding that, more accurately, the interaction in Europe between the currents of post-national integration and the nation-state may have reduced the integrated Europe to a mere parody of the nation-state. In articulating this argument, the article draws on the ‘hybrid’ anxiety placed by Homi Bhabha at the heart of the encounter between the coloniser and the colonised – a binary perversely reproduced, the article claims, in the dichotomy between the European integration and the European nation-state. Next, through a discussion of ‘catachresis’ and ‘time-lag’, strategies of reversal introduced by Gayatri Spivak and Bhabha, respectively, the article rehearses ideas as to whether or not something of a post-Westphalian order can still be salvaged from the ongoing process of integration. Throughout, the article seeks to rely on the later Wittgenstein on meaning, especially his privileging of what is conventionally treated as secondary in meaning formation; namely appearances, difference, absence, mimesis, and the burlesque, as opposed to a transcendental essence, presence, or identity.
Incorporating verbal feedback into a robot-assisted rehabilitation system
Authors: Barkana Duygun Erol , Das Jadav , Wang Furui , Groomes Thomas E. , Sarkar Nilanjan 
Published: July 2010

SUMMARYThis paper presents a control architecture, which has the potential to monitor the task and safety issues, to provide assessment of the progress and alter the task parameters, and to incorporate patient's feedback in order to make the necessary modifications to impart effective therapy during the execution of the task in an automated manner. Experimental results are presented to demonstrate the efficacy of the proposed control architecture.
Transformations of logic programs on infinite lists
Authors: PETTOROSSI ALBERTO , PROIETTI MAURIZIO , SENNI VALERIO 
Published: July 2010

AbstractWe consider an extension of logic programs, called ω-programs, that can be used to define predicates overinfinite lists. ω-programs allow us to specify properties of the infinite behavior of reactive systems and, in general, properties of infinite sequences of events. The semantics of ω-programs is an extension of the perfect model semantics. We present variants of the familiar unfold/fold rules which can be used for transforming ω-programs. We show that these new rules are correct, that is, their application preserves the perfect model semantics. Then we outline a general methodology based on program transformation for verifying properties of ω-programs. We demonstrate the power of our transformation-based verification methodology by proving some properties of Büchi automata and ω-regular languages.
Threads and or-parallelism unified
Authors: SANTOS COSTA VíTOR , DUTRA INÊS , ROCHA RICARDO 
Published: July 2010

AbstractOne of the main advantages of Logic Programming (LP) is that it provides an excellent framework for the parallel execution of programs. In this work we investigate novel techniques to efficiently exploit parallelism from real-world applications in low cost multi-core architectures. To achieve these goals, we revive and redesign the YapOr system to exploit or-parallelism based on a multi-threaded implementation. Our new approach takes full advantage of the state-of-the-art fast and optimized YAP Prolog engine and shares the underlying execution environment, scheduler and most of the data structures used to support YapOr's model. Initial experiments with our new approach consistently achieve almost linear speedups for most of the applications, proving itself as a good alternative for exploiting implicit parallelism in the currently available low cost multi-core architectures.
CHR(PRISM)-based probabilistic logic learning
Authors: SNEYERS JON , MEERT WANNES , VENNEKENS JOOST , KAMEYA YOSHITAKA , SATO TAISUKE 
Published: July 2010

AbstractPRISM is an extension of Prolog with probabilistic predicates and built-in support for expectation-maximization learning. Constraint Handling Rules (CHR) is a high-level programming language based on multi-headed multiset rewrite rules.In this paper, we introduce a new probabilistic logic formalism, called CHRiSM, based on a combination of CHR and PRISM. It can be used for high-level rapid prototyping of complex statistical models by means of “chance rules”. The underlying PRISM system can then be used for several probabilistic inference tasks, including probability computation and parameter learning. We define the CHRiSM language in terms of syntax and operational semantics, and illustrate it with examples. We define the notion of ambiguous programs and define a distribution semantics for unambiguous programs. Next, we describe an implementation of CHRiSM, based on CHR(PRISM). We discuss the relation between CHRiSM and other probabilistic logic programming languages, in particular PCHR. Finally, we identify potential application domains.
Disjunctive ASP with functions: Decidable queries and effective computation
Authors: ALVIANO MARIO , FABER WOLFGANG , LEONE NICOLA 
Published: July 2010

AbstractQuerying over disjunctive ASP with functions is a highly undecidable task in general. In this paper we focus on disjunctive logic programs with stratified negation and functions under the stable model semantics (ASPfs). We show that query answering in this setting is decidable, if the query is finitely recursive (ASPfsfr). Our proof yields also an effective method for query evaluation. It is done by extending the magic set technique to ASPfsfr. We show that the magic-set rewritten program is query equivalent to the original one (under both brave and cautious reasoning). Moreover, we prove that the rewritten program is also finitely ground, implying that it is decidable. Importantly, finitely ground programs are evaluable using existing ASP solvers, making the class of ASPfsfr queries usable in practice.
Loop formulas for description logic programs
Authors: WANG YISONG , YOU JIA-HUAI , YUAN LI YAN , SHEN YI-DONG 
Published: July 2010

AbstractDescription Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logics, for the Semantic Web. In this paper, we generalize the notions of completion and loop formulas of logic programs to description logic programs and show that the answer sets of a dl-program can be precisely captured by the models of its completion and loop formulas. Furthermore, we propose a new, alternative semantics for dl-programs, called the canonical answer set semantics, which is defined by the models of completion that satisfy what are called canonical loop formulas. A desirable property of canonical answer sets is that they are free of circular justifications. Some properties of canonical answer sets are also explored.
A program-level approach to revising logic programs under the answer set semantics
Authors: DELGRANDE JAMES P. 
Published: July 2010

AbstractAn approach to the revision of logic programs under the answer set semantics is presented. For programs P and Q, the goal is to determine the answer sets that correspond to the revision of P by Q, denoted P * Q. A fundamental principle of classical (AGM) revision, and the one that guides the approach here, is the success postulate. In AGM revision, this stipulates that α ∈ K * α. By analogy with the success postulate, for programs P and Q, this means that the answer sets of Q will in some sense be contained in those of P * Q. The essential idea is that for P * Q, a three-valued answer set for Q, consisting of positive and negative literals, is first determined. The positive literals constitute a regular answer set, while the negated literals make up a minimal set of naf literals required to produce the answer set from Q. These literals are propagated to the program P, along with those rules of Q that are not decided by these literals. The approach differs from work in update logic programs in two main respects. First, we ensure that the revising logic program has higher priority, and so we satisfy the success postulate; second, for the preference implicit in a revision P * Q, the program Q as a whole takes precedence over P, unlike update logic programs, since answer sets of Q are propagated to P. We show that a core group of the AGM postulates are satisfied, as are the postulates that have been proposed for update logic programs.
FO(FD): Extending classical logic with rule-based fixpoint definitions
Authors: HOU PING , DE CAT BROES , DENECKER MARC 
Published: July 2010

AbstractWe introduce fixpoint definitions, a rule-based reformulation of fixpoint constructs. The logic FO(FD), an extension of classical logic with fixpoint definitions, is defined. We illustrate the relation between FO(FD) and FO(ID), which is developed as an integration of two knowledge representation paradigms. The satisfiability problem for FO(FD) is investigated by first reducing FO(FD) to difference logic and then using solvers for difference logic. These reductions are evaluated in the computation of models for FO(FD) theories representing fairness conditions and we provide potential applications of FO(FD).
A complete and terminating execution model for Constraint Handling Rules
Authors: BETZ HARIOLF , RAISER FRANK , FRÜHWIRTH THOM 
Published: July 2010

AbstractWe observe that the various formulations of the operational semantics of Constraint Handling Rules proposed over the years fall into a spectrum ranging from the analytical to the pragmatic. While existing analytical formulations facilitate program analysis and formal proofs of program properties, they cannot be implemented as is. We propose a novel operational semantics ω!, which has a strong analytical foundation, while featuring a terminating execution model. We prove its soundness and completeness with respect to existing analytical formulations and we provide an implementation in the form of a source-to-source transformation to CHR with rule priorities.
Decidability properties for fragments of CHR
Authors: GABBRIELLI MAURIZIO , MAURO JACOPO , MEO MARIA CHIARA , SNEYERS JON 
Published: July 2010

AbstractWe study the decidability of termination for two CHR dialects which, similarly to the Datalog like languages, are defined by using a signature which does not allow function symbols (of arity > 0). Both languages allow the use of the = built-in in the body of rules, thus are built on a host language that supports unification. However each imposes one further restriction. The first CHR dialect allows onlyrange-restrictedrules, that is, it does not allow the use of variables in the body or in the guard of a rule if they do not appear in the head. We show that the existence of an infinite computation is decidable for this dialect. The second dialect instead limits the number of atoms in the head of rules to one. We prove that in this case, the existence of a terminating computation is decidable. These results show that both dialects are strictly less expressive1than Turing Machines. It is worth noting that the language (without function symbols) without these restrictions is as expressive as Turing Machines.
Logic programming for finding models in the logics of knowledge and its applications: A case study
Authors: BARAL C. , GELFOND G. , PONTELLI E. , SON T. 
Published: July 2010

AbstractThe logics of knowledge are modal logics that have been shown to be effective in representing and reasoning about knowledge in multi-agent domains. Relatively few computational frameworks for dealing with computation of models and useful transformations in logics of knowledge (e.g., to support multi-agent planning with knowledge actions and degrees of visibility) have been proposed. This paper explores the use of logic programming (LP) to encode interesting forms of logics of knowledge and compute Kripke models. The LP modeling is expanded with useful operators on Kripke structures, to support multi-agent planning in the presence of both world-altering and knowledge actions. This results in the first ever implementation of a planner for this type of complex multi-agent domains.
Formalization of psychological knowledge in answer set programming and its application
Authors: BALDUCCINI MARCELLO , GIROTTO SARA 
Published: July 2010

AbstractIn this paper we explore the use of Answer Set Programming (ASP) to formalize, and reason about, psychological knowledge. In the field of psychology, a considerable amount of knowledge is still expressed using only natural language. This lack of a formalization complicates accurate studies, comparisons, and verification of theories. We believe that ASP, a knowledge representation formalism allowing for concise and simple representation of defaults, uncertainty, and evolving domains, can be used successfully for the formalization of psychological knowledge. To demonstrate the viability of ASP for this task, in this paper we develop an ASP-based formalization of the mechanics of Short-Term Memory. We also show that our approach can have rather immediate practical uses by demonstrating an application of our formalization to the task of predicting a user's interaction with a graphical interface.
The system Kato: Detecting cases of plagiarism for answer-set programs
Authors: OETSCH JOHANNES , PÜHRER JÖRG , SCHWENGERER MARTIN , TOMPITS HANS 
Published: July 2010

AbstractPlagiarism detection is a growing need among educational institutions and solutions for different purposes exist. An important field in this direction is detecting cases of source-code plagiarism. In this paper, we present the tool Kato for supporting the detection of this kind of plagiarism in the area of answer-set programming (ASP). Currently, the tool is implemented for DLV programs but it is designed to handle other logic-programming dialects as well. We review the basic features of Kato, introduce its theoretical underpinnings, and discuss an application of Kato for plagiarism detection in the context of courses on logic programming at the Vienna University of Technology.
Parental magmas of Grenville Province massif-type anorthosites, and conjectures about why massif anorthosites are restricted to the Proterozoic
Authors: Bédard Jean H. 
Published: July 2010

ABSTRACTTrace element inversion modelling of Grenvillean anorthosite massifs and associated rocks yield NMORB-normalised trace element profiles enriched in highly incompatible elements; commonly with negative Nb and Th anomalies. Model melts can be divided into subtypes that cannot be linked through fractional crystallisation processes. Most model melts are depleted in the heavy rare-earth elements and can be explained by partial melting of arc basaltic sources (5–60 melting ) with garnet-bearing residues. Some of the model melts have flat NMORB-normalised profiles (for rare-earth elements), have high compatible element contents, and might have been derived from mantle fertilised by arc magmatism, followed by low-pressure fractional crystallisation. Intermediate Ce/Yb types may represent mixtures of these end-members, or less probably, variations in the crustal source composition and residual assemblage. The active tectonic context now favoured for the Grenville Province appears to be inconsistent with plume or thermal insulation models. The heat source for crustal and mantle melting could record either post-orogenic thermal relaxation of a tectonically-thickened arc crust, or basaltic underplating caused by delamination of a mantle root or subduction slab beneath this arc crust. In this context, pre-Proterozoic anorthosites may be lacking, because prior to ca. 2·5 Ga, the crust may have been too weak to be thickened tectonically. The absence of post-Proterozoic anorthosites may be due to the secular decrease in radiogenic heating and cooling of the mantle and crust.
Chemical structure in granitic magmas – a signal from the source?
Authors: Clemens J. D. , Helps P. A. , Stevens G. 
Published: July 2010

ABSTRACTThough typically exhibiting considerable scatter, geochemical variations in granitic plutons and silicic volcanic deposits are commonly modelled as products of differentiation of originally homogeneous magmas. However, many silicic igneous bodies, particularly those classified as S-types, are internally heterogeneous in their mineralogy, geochemistry and isotope ratios, on scales from hundreds of metres down to one metre or less. The preservation of these heterogeneities supports recent models for the construction of granitic magma bodies through incremental additions of numerous batches (pulses) of magma derived from contrasting sources. Such pulses result from the sequential nature of the melting reactions and the commonly layered structure of crustal magma sources. Internal differentiation of these batches occurs, but not generally on the scales of whole magma chambers. Rather than being created through differentiation or hybridisation processes, at or near emplacement levels, much of the variation within such bodies (e.g. trace-element or Mg# variation with SiO2 or isotope ratios) is a primary or near-source feature. At emplacement levels, the relatively high magma viscosities and slow diffusion rates of many chemical components in silicic melts probably inhibit processes that would lead to homogenisation. This permits at least partial preservation of the primary heterogeneities.
Causes of compositional diversity in a lobe of the Half Dome granodiorite, Tuolumne Batholith, Central Sierra Nevada, California
Authors: Economos R. C. , Memeti V. , Paterson S. R. , Miller J. S. , Erdmann S. , Žák J. 
Published: July 2010

ABSTRACTThe causes of compositional diversity in the Tuolumne Batholith, whether source heterogeneity, magma mixing, or fractional crystallisation, is a matter of longstanding debate. This paper presents data from detailed mapping and a microstructural and major element, trace element and isotopic study of an elongate lobe of the Half Dome granodiorite that protrudes from the southern end of the batholith. The lobe is normally zoned from quartz diorite along the outer margin to high-silica leucogranite in the core. Contacts are steep and gradational, except for the central leucogranite contact, which is locally sharp: magmatic fabrics overprint contacts. A striking feature of the lobe is the 18 wt SiO2 range comparable to that observed for the entire Tuolumne Batholith. Feldspar-compatible elements (Sr and Ba) decrease towards the centre, while Rb increases. Light and middle REEs show a smooth decrease towards the centre of the lobe. Calculated initial isotopic ratios of 87Sr/86Sr(i) and εNd(t) have identical values within error across the lobe, except in the central leucogranite, the most silica rich phase, which shows a slightly more crustal signature. Field, structural, geochemical and isotopic data suggest that fractionation was the dominant process causing compositional variation in this lobe. It is envisioned that this fractionation/crystal sorting occurred in a vertically flowing and evolving magma column with the present map pattern representing a cross-section of this column. Thus the areal extent of the lobe represents a minimum size of interconnected melt at the emplacement level of the Tuolumne Batholith and, given its marginal position, limited width and proximity to colder host rocks, implies that fractionation in larger chambers likely occurred in the main Tuolumne Batholith magma chamber(s).
Structural controls on melt segregation and migration related to the formation of the diapiric Schwerin Fold in the contact aureole of the Bushveld Complex, South Africa
Authors: Longridge Luke , Gibson Roger L. , Nex Paul A. M. 
Published: July 2010

ABSTRACTPartial melting of metapelitic rocks beneath the mafic–ultramafic Rustenburg Layered Suite of the Bushveld Complex in the vicinity of the periclinal Schwerin Fold resulted in a structurally controlled distribution of granitic leucosomes in the upper metamorphic aureole. In the core of the pericline, subvertical structures facilitated the rise of buoyant leucosome through the aureole towards the contact with the Bushveld Complex, with leucosomes accumulating in en-echelon tension gashes. In a subhorizontal syn-metamorphic shear zone to the southeast of the pericline, leucosomes accumulated in subhorizontal dilational structural sites. The kinematics of this shear zone are consistent with slumping of material off the southeastern limb of the rising Schwerin pericline. The syndeformational timing of leucosome emplacement supports a syn-intrusive, density-driven origin for the Schwerin Fold. Modelling of the cooling of the Rustenburg Layered Suite and heating of the floor rocks using a multiple intrusion model indicates that temperatures above the solidus were maintained for >600,000 years up to 300 m from the contact, in agreement with rheological modelling of floor-rock diapirs that indicate growth rates on the order of 8 mm/year for the Schwerin Fold.