TY - JOUR A1 - Brain, Martin A1 - Gebser, Martin A1 - Pührer, Jörg A1 - Schaub, Torsten A1 - Tompits, Hans A1 - Woltran, Stefan T1 - "That is illogical, Captain!" : the debugging support tool spock for answer-set programs ; system description Y1 - 2007 ER - TY - JOUR A1 - Gebser, Martin A1 - Kaufmann, Benjamin A1 - Neumann, André A1 - Schaub, Torsten T1 - Conflict-driven answer set enumeration Y1 - 2007 SN - 978-3-540- 72199-4 ER - TY - JOUR A1 - Gebser, Martin A1 - Kaufmann, Benjamin A1 - Neumann, André A1 - Schaub, Torsten T1 - Conflict-driven answer set solving Y1 - 2007 SN - 978-1-57735-323-2 ER - TY - JOUR A1 - Gebser, Martin A1 - Gharib, Mona A1 - Schaub, Torsten T1 - Incremental answer sets and their computation Y1 - 2007 ER - TY - JOUR A1 - Gebser, Martin A1 - Schaub, Torsten T1 - Generic tableaux for answer set programming Y1 - 2007 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten T1 - A consistency-based framework for merging knowledge bases Y1 - 2007 SN - 1570-8683 ER - TY - JOUR A1 - Gebser, Martin A1 - Liu, Lengning A1 - Namasivayam, Gayathri A1 - Neumann, André A1 - Schaub, Torsten A1 - Truszczynski, Miroslaw T1 - The first answer set programming system competition Y1 - 2007 SN - 978-3-540- 72199-4 ER - TY - CHAP ED - Hamann, Wolf-Rainer ED - Feldmeier, Achim ED - Oskinova, Lidia M. T1 - Clumping in hot-star winds : proceedings of an international workshop held in Potsdam, Germany, 18. - 22. June 2007 N2 - Stellar winds play an important role for the evolution of massive stars and their cosmic environment. Multiple lines of evidence, coming from spectroscopy, polarimetry, variability, stellar ejecta, and hydrodynamic modeling, suggest that stellar winds are non-stationary and inhomogeneous. This is referred to as 'wind clumping'. The urgent need to understand this phenomenon is boosted by its far-reaching implications. Most importantly, all techniques to derive empirical mass-loss rates are more or less corrupted by wind clumping. Consequently, mass-loss rates are extremely uncertain. Within their range of uncertainty, completely different scenarios for the evolution of massive stars are obtained. Settling these questions for Galactic OB, LBV and Wolf-Rayet stars is prerequisite to understanding stellar clusters and galaxies, or predicting the properties of first-generation stars. In order to develop a consistent picture and understanding of clumped stellar winds, an international workshop on 'Clumping in Hot Star Winds' was held in Potsdam, Germany, from 18. - 22. June 2007. About 60 participants, comprising almost all leading experts in the field, gathered for one week of extensive exchange and discussion. The Scientific Organizing Committee (SOC) included John Brown (Glasgow), Joseph Cassinelli (Madison), Paul Crowther (Sheffield), Alex Fullerton (Baltimore), Wolf-Rainer Hamann (Potsdam, chair), Anthony Moffat (Montreal), Stan Owocki (Newark), and Joachim Puls (Munich). These proceedings contain the invited and contributed talks presented at the workshop, and document the extensive discussions. KW - Sternwinde KW - Massenverlust KW - Strahlungstransport KW - hydrodynamische Modellierung KW - massereiche Sterne KW - stellar winds KW - mass loss KW - radiative transfer KW - hydrodynamic modeling KW - massive stars Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-13981 SN - 978-3-940793-33-1 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - CHAP A1 - Oskinova, Lidia M. A1 - Hamann, Wolf-Rainer A1 - Feldmeier, Achim T1 - X-raying clumped stellar winds N2 - X-ray spectroscopy is a sensitive probe of stellar winds. X-rays originate from optically thin shock-heated plasma deep inside the wind and propagate outwards throughout absorbing cool material. Recent analyses of the line ratios from He-like ions in the X-ray spectra of O-stars highlighted problems with this general paradigm: the measured line ratios of highest ions are consistent with the location of the hottest X-ray emitting plasma very close to the base of the wind, perhaps indicating the presence of a corona, while measurements from lower ions conform with the wind-embedded shock model. Generally, to correctly model the emerging Xray spectra, a detailed knowledge of the cool wind opacities based on stellar atmosphere models is prerequisite. A nearly grey stellar wind opacity for the X-rays is deduced from the analyses of high-resolution X-ray spectra. This indicates that the stellar winds are strongly clumped. Furthermore, the nearly symmetric shape of X-ray emission line profiles can be explained if the wind clumps are radially compressed. In massive binaries the orbital variations of X-ray emission allow to probe the opacity of the stellar wind; results support the picture of strong wind clumping. In high-mass X-ray binaries, the stochastic X-ray variability and the extend of the stellar-wind part photoionized by X-rays provide further strong evidence that stellar winds consist of dense clumps. Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-18133 ER - TY - CHAP A1 - Feldmeier, Achim A1 - Hamann, Wolf-Rainer A1 - Rätzel, D. A1 - Oskinova, Lidia M. T1 - Hydrodynamic simulations of clumps N2 - Clumps in hot star winds can originate from shock compression due to the line driven instability. One-dimensional hydrodynamic simulations reveal a radial wind structure consisting of highly compressed shells separated by voids, and colliding with fast clouds. Two-dimensional simulations are still largely missing, despite first attempts. Clumpiness dramatically affects the radiative transfer and thus all wind diagnostics in the UV, optical, and in X-rays. The microturbulence approximation applied hitherto is currently superseded by a more sophisticated radiative transfer in stochastic media. Besides clumps, i.e. jumps in the density stratification, so-called kinks in the velocity law, i.e. jumps in dv/dr, play an eminent role in hot star winds. Kinks are a new type of radiative-acoustic shock, and propagate at super-Abbottic speed. Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-17975 ER - TY - CHAP A1 - Hamann, Wolf-Rainer A1 - Oskinova, Lidia M. A1 - Feldmeier, Achim T1 - Spectrum formation in clumpy stellar winds N2 - Modeling expanding atmospheres is a difficult task because of the extreme non-LTE situation, the need to account for complex model atoms, especially for the iron-group elements with their millions of lines, and because of the supersonic expansion. Adequate codes have been developed e.g. by Hillier (CMFGEN), the Munich group (Puls, Pauldrach), and in Potsdam (PoWR code, Hamann et al.). While early work was based on the assumption of a smooth and homogeneous spherical stellar wind, the need to account for clumping became obvious about ten years ago. A relatively simple first-order clumping correction was readily implemented into the model codes. However, its simplifying assumptions are severe. Most importantly, the clumps are taken to be optically thin at all frequencies (”microclumping”). We discuss the consequences of this approximation and describe an approach to account for optically thick clumps (“macroclumping”). First results demonstrate that macroclumping can generally reduce the strength of spectral features, depending on their optical thickness. The recently reported discrepancy between the Hα diagnostic and the Pv resonance lines in O star spectra can be resolved without decreasing the mass-loss rates, when macroclumping is taken into account. Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-17838 ER - TY - JOUR A1 - Gebser, Martin A1 - Schaub, Torsten A1 - Tompits, Hans A1 - Woltran, Stefan T1 - Alternative characterizations for program equivalence under aswer-set semantics : a preliminary report Y1 - 2007 ER - TY - THES A1 - Konczak, Kathrin T1 - Preferences in answer set programming T1 - Präferenzen in der Antwortmengenprogrammierung N2 - Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm, having its roots in nonmonotonic reasoning, deductive databases, and logic programming with negation as failure. The basic idea of ASP is to represent a computational problem as a logic program whose answer sets correspond to solutions, and then to use an answer set solver for finding answer sets of the program. ASP is particularly suited for solving NP-complete search problems. Among these, we find applications to product configuration, diagnosis, and graph-theoretical problems, e.g. finding Hamiltonian cycles. On different lines of ASP research, many extensions of the basic formalism have been proposed. The most intensively studied one is the modelling of preferences in ASP. They constitute a natural and effective way of selecting preferred solutions among a plethora of solutions for a problem. For example, preferences have been successfully used for timetabling, auctioning, and product configuration. In this thesis, we concentrate on preferences within answer set programming. Among several formalisms and semantics for preference handling in ASP, we concentrate on ordered logic programs with the underlying D-, W-, and B-semantics. In this setting, preferences are defined among rules of a logic program. They select preferred answer sets among (standard) answer sets of the underlying logic program. Up to now, those preferred answer sets have been computed either via a compilation method or by meta-interpretation. Hence, the question comes up, whether and how preferences can be integrated into an existing ASP solver. To solve this question, we develop an operational graph-based framework for the computation of answer sets of logic programs. Then, we integrate preferences into this operational approach. We empirically observe that our integrative approach performs in most cases better than the compilation method or meta-interpretation. Another research issue in ASP are optimization methods that remove redundancies, as also found in database query optimizers. For these purposes, the rather recently suggested notion of strong equivalence for ASP can be used. If a program is strongly equivalent to a subprogram of itself, then one can always use the subprogram instead of the original program, a technique which serves as an effective optimization method. Up to now, strong equivalence has not been considered for logic programs with preferences. In this thesis, we tackle this issue and generalize the notion of strong equivalence to ordered logic programs. We give necessary and sufficient conditions for the strong equivalence of two ordered logic programs. Furthermore, we provide program transformations for ordered logic programs and show in how far preferences can be simplified. Finally, we present two new applications for preferences within answer set programming. First, we define new procedures for group decision making, which we apply to the problem of scheduling a group meeting. As a second new application, we reconstruct a linguistic problem appearing in German dialects within ASP. Regarding linguistic studies, there is an ongoing debate about how unique the rule systems of language are in human cognition. The reconstruction of grammatical regularities with tools from computer science has consequences for this debate: if grammars can be modelled this way, then they share core properties with other non-linguistic rule systems. N2 - Die Antwortmengenprogrammierung entwickelte sich in den späten 90er Jahren als neues Paradigma der logischen Programmierung und ist in den Gebieten des nicht-monotonen Schließens und der deduktiven Datenbanken verwurzelt. Dabei wird eine Problemstellung als logisches Programm repräsentiert, dessen Lösungen, die so genannten Antwortmengen, genau den Lösungen des ursprünglichen Problems entsprechen. Die Antwortmengenprogrammierung bildet ein geeignetes Fundament zur Repräsentation und zum Lösen von Entscheidungs- und Suchproblemen in der Komplexitätsklasse NP. Anwendungen finden wir unter anderem in der Produktkonfiguration, Diagnose und bei graphen-theoretischen Problemen, z.B. der Suche nach Hamiltonschen Kreisen. In den letzten Jahren wurden viele Erweiterungen der Antwortmengenprogrammierung betrachtet. Die am meisten untersuchte Erweiterung ist die Modellierung von Präferenzen. Diese bilden eine natürliche und effektive Möglichkeit, unter einer Vielzahl von Lösungen eines Problems bevorzugte Lösungen zu selektieren. Präferenzen finden beispielsweise in der Stundenplanung, bei Auktionen und bei Produktkonfigurationen ihre Anwendung. Der Schwerpunkt dieser Arbeit liegt in der Modellierung, Implementierung und Anwendung von Präferenzen in der Antwortmengenprogrammierung. Da es verschiedene Ansätze gibt, um Präferenzen darzustellen, konzentrieren wir uns auf geordnete logische Programme, wobei Präferenzen als partielle Ordnung der Regeln eines logischen Programms ausgedrückt werden. Dabei betrachten wir drei verschiedene Semantiken zur Interpretation dieser Präferenzen. Im Vorfeld wurden für diese Semantiken die bevorzugten Antwortmengen durch einen Compiler oder durch Meta-Interpretation berechnet. Da Präferenzen Lösungen selektieren, stellt sich die Frage, ob es möglich ist, diese direkt in den Berechnungsprozeß von präferenzierten Antwortmengen zu integrieren, so dass die bevorzugten Antwortmengen ohne Zwischenschritte berechnet werden können. Dazu entwickeln wir zuerst ein auf Graphen basierendes Gerüst zur Berechnung von Antwortmengen. Anschließend werden wir darin Präferenzen integrieren, so dass bevorzugte Antwortmengen ohne Compiler oder Meta-Interpretation berechnet werden. Es stellt sich heraus, dass die integrative Methode auf den meisten betrachteten Problemklassen wesentlich leistungsfähiger ist als der Compiler oder Meta-Interpretation. Ein weiterer Schwerpunkt dieser Arbeit liegt in der Frage, inwieweit sich geordnete logische Programme vereinfachen lassen. Dazu steht die Methodik der strengen Äquivalenz von logischen Programmen zur Verfügung. Wenn ein logisches Programm streng äquivalent zu einem seiner Teilprogramme ist, so kann man dieses durch das entsprechende Teilprogramm ersetzen, ohne dass sich die zugrunde liegende Semantik ändert. Bisher wurden strenge Äquivalenzen nicht für logische Programme mit Präferenzen untersucht. In dieser Arbeit definieren wir erstmalig strenge Äquivalenzen für geordnete logische Programme. Wir geben notwendige und hinreichende Bedingungen für die strenge Äquivalenz zweier geordneter logischer Programme an. Des Weiteren werden wir auch die Frage beantworten, inwieweit geordnete logische Programme und deren Präferenzstrukturen vereinfacht werden können. Abschließend präsentieren wir zwei neue Anwendungsbereiche von Präferenzen in der Antwortmengenprogrammierung. Zuerst definieren wir neue Prozeduren zur Entscheidungsfindung innerhalb von Gruppenprozessen. Diese integrieren wir anschließend in das Problem der Planung eines Treffens für eine Gruppe. Als zweite neue Anwendung rekonstruieren wir mit Hilfe der Antwortmengenprogrammierung eine linguistische Problemstellung, die in deutschen Dialekten auftritt. Momentan wird im Bereich der Linguistik darüber diskutiert, ob Regelsysteme von (menschlichen) Sprachen einzigartig sind oder nicht. Die Rekonstruktion von grammatikalischen Regularitäten mit Werkzeugen aus der Informatik erlaubt die Unterstützung der These, dass linguistische Regelsysteme Gemeinsamkeiten zu anderen nicht-linguistischen Regelsystemen besitzen. KW - Präferenzen KW - Antwortmengenprogrammierung KW - logische Programmierung KW - Künstliche Intelligenz KW - preferences KW - priorities KW - answer set programming KW - logic programming KW - artificial intelligence Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-12058 ER - TY - JOUR A1 - Gebser, Martin A1 - Kaufmann, Benjamin A1 - Neumann, André A1 - Schaub, Torsten T1 - Clasp : a conflict-driven answer set solver Y1 - 2007 SN - 978-3-540- 72199-4 ER - TY - JOUR A1 - Brain, Martin A1 - Faber, Wolfgang A1 - Maratea, Marco A1 - Polleres, Axel A1 - Schaub, Torsten A1 - Schindlauer, Roman T1 - What should an ASP solver output? : a multiple position paper Y1 - 2007 ER - TY - THES A1 - Tönjes, Ralf T1 - Pattern formation through synchronization in systems of nonidentical autonomous oscillators T1 - Musterbildung durch Synchronisation in Systemen nicht identischer, autonomer Oszillatoren N2 - This work is concerned with the spatio-temporal structures that emerge when non-identical, diffusively coupled oscillators synchronize. It contains analytical results and their confirmation through extensive computer simulations. We use the Kuramoto model which reduces general oscillatory systems to phase dynamics. The symmetry of the coupling plays an important role for the formation of patterns. We have studied the ordering influence of an asymmetry (non-isochronicity) in the phase coupling function on the phase profile in synchronization and the intricate interplay between this asymmetry and the frequency heterogeneity in the system. The thesis is divided into three main parts. Chapter 2 and 3 introduce the basic model of Kuramoto and conditions for stable synchronization. In Chapter 4 we characterize the phase profiles in synchronization for various special cases and in an exponential approximation of the phase coupling function, which allows for an analytical treatment. Finally, in the third part (Chapter 5) we study the influence of non-isochronicity on the synchronization frequency in continuous, reaction diffusion systems and discrete networks of oscillators. N2 - Die vorliegende Arbeit beschäftigt sich in Theorie und Simulation mit den raum-zeitlichen Strukturen, die entstehen, wenn nicht-identische, diffusiv gekoppelte Oszillatoren synchronisieren. Wir greifen dabei auf die von Kuramoto hergeleiteten Phasengleichungen zurück. Eine entscheidene Rolle für die Musterbildung spielt die Symmetrie der Kopplung. Wir untersuchen den ordnenden Einfluss von Asymmetrie (Nichtisochronizität) in der Phasenkopplungsfunktion auf das Phasenprofil in Synchronisation und das Zusammenspiel zwischen dieser Asymmetrie und der Frequenzheterogenität im System. Die Arbeit gliedert sich in drei Hauptteile. Kapitel 2 und 3 beschäftigen sich mit den grundlegenden Gleichungen und den Bedingungen für stabile Synchronisation. Im Kapitel 4 charakterisieren wir die Phasenprofile in Synchronisation für verschiedene Spezialfälle sowie in der von uns eingeführten exponentiellen Approximation der Phasenkopplungsfunktion. Schliesslich untersuchen wir im dritten Teil (Kap.5) den Einfluss von Nichtisochronizität auf die Synchronisationsfrequenz in kontinuierlichen, oszillatorischen Reaktions-Diffusionssystemen und diskreten Netzwerken von Oszillatoren. KW - Synchronisation KW - Musterbildung KW - Phasen-Gleichungen KW - Phasen-Oszillatoren KW - Kuramoto Modell KW - synchronization KW - pattern formation KW - phase equations KW - phase oscillators KW - Kuramoto model Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-15973 ER -