arXiv subjects

Matthias Wendt

Publications and source records attributed to Matthias Wendt.

40 records · Page 3Linked to original sources

arXiv2011

Nucleation studies under the conditions of carbon-rich AGB star envelopes: TiC

Many studies of especially dust nucleation in winds of carbon-rich AGB stars consider primarily carbon as dust forming material. But dust grains formed in such circumstellar envelopes are rather a mixture of several chemical elements such as titanium or silicon in addition to the main component carbon as verified by many investigations of pre-solar grains enclosed in meteorites, for example. In this contribution we focus on the study of the nucleation of titanium carbide particles from the gas phase. Therefore, the necessary properties of molecular titanium carbide clusters have been estimated within density functional approaches and first implications on the homogeneous nucleation of TiC are studied for conditions being representative for circumstellar dust shells around carbon-rich AGB stars.

astro-ph.SR↗

arXiv2010

Classifying spaces and fibrations of simplicial sheaves

In this paper, we discuss the construction of classifying spaces of fibre sequences in model categories of simplicial sheaves. One construction proceeds via Brown representability and provides a classification in the pointed model category. The second construction is given by the classifying space of the monoid of homotopy self-equivalences of a simplicial sheaf and provides the unpointed classification.

math.AT↗

arXiv2003

A uniform approach to logic programming semantics

Part of the theory of logic programming and nonmonotonic reasoning concerns the study of fixed-point semantics for these paradigms. Several different semantics have been proposed during the last two decades, and some have been more successful and acknowledged than others. The rationales behind those various semantics have been manifold, depending on one's point of view, which may be that of a programmer or inspired by commonsense reasoning, and consequently the constructions which lead to these semantics are technically very diverse, and the exact relationships between them have not yet been fully understood. In this paper, we present a conceptually new method, based on level mappings, which allows to provide uniform characterizations of different semantics for logic programs. We will display our approach by giving new and uniform characterizations of some of the major semantics, more particular of the least model semantics for definite programs, of the Fitting semantics, and of the well-founded semantics. A novel characterization of the weakly perfect model semantics will also be provided.

cs.AI↗

arXiv2003

Formal Concept Analysis and Resolution in Algebraic Domains

We relate two formerly independent areas: Formal concept analysis and logic of domains. We will establish a correspondene between contextual attribute logic on formal contexts resp. concept lattices and a clausal logic on coherent algebraic cpos. We show how to identify the notion of formal concept in the domain theoretic setting. In particular, we show that a special instance of the resolution rule from the domain logic coincides with the concept closure operator from formal concept analysis. The results shed light on the use of contexts and domains for knowledge representation and reasoning purposes.

cs.LO↗