Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing minimal (maximal) subsets of the knowledge base that have (do not have) the consequence in question. The pinpointing algorithms described in the DL literature are obtained as extensions of the standard tableau-based reasoning algorithms for computing consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a particular DL. The purpose of this paper is to develop a general approach for extending a tableau-based algorithm to a pinpointing algorithm. This approach is based on a general definition of „tableau algorithms,' which captures many of the known tableau-based algorithms employed in DLs, but also other kinds of reasoning procedures.

Recently, it was shown for the DL EL that subsumption and instance problem w.r.t. cyclic terminologies can be decided in polynomial time. In this paper, we show that both problems remain tractable even when admitting general concept inclusion axioms and simple role inclusion axioms.

Recently, it has been shown that the small DL EL, which allows for conjunction and existential restrictions, has better algorithmic properties than its counterpart FL₀, which allows for conjunction and value restrictions. Whereas the subsumption problem in FL₀ becomes already intractable in the presence of aclyc TBoxes, it remains tractable in EL even w.r.t. general concept inclusion axioms (GCIs). On the one hand, we will extend the positive result for EL by identifying a set of expressive means that can be added to EL without sacrificing tractability. On the other hand, we will show that basically all other additions of typical DL constructors to EL with GCIs make subsumption intractable, and in most cases even EXPTIME-complete. In addition, we will show that subsumption in FL₀ with GCIs is EXPTIME-complete.

Fuzzy description logics (DLs) have been investigated for over two decades, due to their capacity to formalize and reason with imprecise concepts. Very recently, it has been shown that for several fuzzy DLs, reasoning becomes undecidable. Although the proofs of these results differ in the details of each specific logic considered, they are all based on the same basic idea. In this report, we formalize this idea and provide sufficient conditions for proving undecidability of a fuzzy DL. We demonstrate the effectiveness of our approach by strengthening all previously-known undecidability results and providing new ones. In particular, we show that undecidability may arise even if only crisp axioms are considered.

Assuming the axiom of determinacy, we give a new proof of the strong partition relation on ω1. Further, we present a streamlined proof that J<λ+(a) (the ideal of sets which force cof Π α < λ) is generated from J<λ+(a) by adding a singleton. Combining these results with a polarized partition relation on ω1

We will discuss the 9th axiom of Zermelo-Fraenkel set theory with choice, which is often abbreviated ZFC, since it includes the axiom of choice (AC). AC is a controversial axiom that is mathematically equivalent to many well known theorems and has an interesting history in set theory. This thesis is a combination of discussion of the history of the axiom and the reasoning behind why the axiom is controversial. This entails several proofs of theorems that establish the fact that AC is equivalent to such theorems and notions as Tychonoff's Theorem, Zorn's Lemma, the Well-Ordering Theorem, and many more.

In the first chapter, I examine the definitions and axioms in Part One of Spinoza's Ethics. From there, I discuss five interpretations of Spinoza's notion of `axiom' in order to strengthen our understanding of the role Spinoza took axioms to play in his work. In the second chapter, I move from the discussion of what an axiom is to a consideration of the precise meaning of the fourth axiom of the first part (1A4). A key move in this chapter is to show that Spinoza does not separate causation and conception. In the third chapter, I defend the truth of 1A4 by showing that it follows from the definitions of Substance and Mode. I argue that in virtue of the conclusions of the previous two chapters, the axiom can be regarded as true for its relevant magnitude (in a way akin to the 'common notions' of Euclid's Elements). / Thesis (Master, Philosophy) -- Queen's University, 2010-09-04 13:22:27.876

Den ständiga utvecklingen av mobila chattapplikationer har bidragit till att underlätta människors vardagliga aktiviteter. Däremot utnyttjas applikationerna till att kommunicera vid kriminell verksamhet vilket har skapat nya utmaningar inom den IT-forensiska verksamheten hos brottsbekämpande myndigheter. Implementerade säkerhet- och integritetsfunktioner har försvårat åtkomst till data och tillhörande raderingsfunktioner i de mobila chattapplikationerna är en av de främsta utmaningarna. Uppsatsens syfte är att undersöka hur raderad data kan återskapas från Snapchats tillhörande SQLite-databas arroyo.db som lagrar chattkommunikation. I uppsatsen genomförs en genomgående litteraturstudie i kombination med ett experiment för att kartlägga den IT-forensiska arbetsprocessen både gällande arbetsmetoder samt eventuella brister som existerar i de IT-forensiska verktygen. Resultatet av den här uppsatsen visar att raderad chattkommunikation i Snapchat går att återskapa samt att det finns brister i den IT-forensiska arbetsprocessen. Avslutningsvis konstateras det att SQLite-forensik är ett område som är i behov av ständig utveckling för att hålla jämna steg med informationsteknologins utveckling.

In dieser Arbeit wird mathematisches Papierfalten und speziell 1-fach-Origami im universitären Kontext untersucht. Die Arbeit besteht aus drei Teilen. Der erste Teil ist im Wesentlichen der Sachanalyse des 1-fach-Origami gewidmet. Im ersten Kapitel gehen wir auf die geschichtliche Einordnung des 1-fach-Origami, betrachten axiomatische Grundlagen und diskutieren, wie das Axiomatisieren von 1-fach-Origami zum Verständnis des Axiomenbegriffs beitragen könnte. Im zweiten Kapitel schildern wir das Design der zugehörigen explorativen Studie, beschreiben unsere Forschungsziele und -fragen. Im dritten Kapitel wird 1-fach-Origami mathematisiert, definiert und eingehend untersucht. Der zweite Teil beschäftigt sich mit den von uns gestalteten und durchgeführten Kursen »Axiomatisieren lernen mit Papierfalten«. Im vierten Kapitel beschreiben wir die Lehrmethodik und die Gestaltung der Kurse, das fünfte Kapitel enthält ein Exzerpt der Kurse. Im dritten Teil werden die zugehörigen Tests beschrieben. Im sechsten Kapitel erläutern wir das Design der Tests sowie die Testmethodik. Im siebten Kapitel findet die Auswertung ebendieser Tests statt. / In this manuscript, mathematical paper folding and specifically 1-fold origami is studied in a university context. The thesis consists of three parts. The first part is mainly devoted to the factual analysis of 1-fold origami. In the first chapter, we elaborate on the historical development of 1-fold origami, consider axiomatic foundations, and discuss how axiomatizing 1-fold origami could contribute to the understanding of the concept of an axiom. In the second chapter, we describe the design of the related exploratory study, describe our research objectives and questions. In the third chapter, 1-fold origami is mathematized, defined, and explored in depth. The second part focuses on the courses with the title "Learning how to axiomatize through paperfolding" which we designed and conducted. In the fourth chapter we describe the teaching methodology and the design of the courses, and the fifth chapter contains an excerpt of the courses. In the third part we describe the associated tests. In the sixth chapter we explain the design of the tests as well as the testing methodology. In the seventh chapter, the evaluation of these tests is carried out.

No description available.