Inconsistency Handling in Ontology-Mediated Query Answering: A Progress Report

International audienceThis paper accompanies an invited talk on inconsistency handling in OMQA and presents a concise summary of the research that has been conducted in the area

Law and Development

This is a draft of a book to accompany a course on the sociology of law and law and development at Boston University

The Desire for Utopia in the Critical Study of Religion

This dissertation argues that the critical methods developed by and used within the field of religious studies can be reimagined as an expression of the modern desire for Utopia. It investigates how applications of critical social theory occlude the category of experience either deliberately or through methodological slight. Utopia addresses this problematic of representing the existential dimension of social life through its particular formulation of social contradiction. Analyzing Utopia\u27s own representational situation within modernity affords scholars in religion a means to consider their investments in and desires for representing society as a totality that creates the conditions for and anticipates resolutions to these contradictions

Kiel Declarative Programming Days 2013

This report contains the papers presented at the Kiel Declarative Programming Days 2013, held in Kiel (Germany) during September 11-13, 2013. The Kiel Declarative Programming Days 2013 unified the following events: * 20th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2013) * 22nd International Workshop on Functional and (Constraint) Logic Programming (WFLP 2013) * 27th Workshop on Logic Programming (WLP 2013) All these events are centered around declarative programming, an advanced paradigm for the modeling and solving of complex problems. These specification and implementation methods attracted increasing attention over the last decades, e.g., in the domains of databases and natural language processing, for modeling and processing combinatorial problems, and for high-level programming of complex, in particular, knowledge-based systems

Computational Complexity of Strong Admissibility for Abstract Dialectical Frameworks

Abstract dialectical frameworks (ADFs) have been introduced as a formalism for modeling and evaluating argumentation allowing general logical satisfaction conditions. Different criteria used to settle the acceptance of arguments arecalled semantics. Semantics of ADFs have so far mainly been defined based on the concept of admissibility. Recently, the notion of strong admissibility has been introduced for ADFs. In the current work we study the computational complexityof the following reasoning tasks under strong admissibility semantics. We address 1. the credulous/skeptical decision problem; 2. the verification problem; 3. the strong justification problem; and 4. the problem of finding a smallest witness of strong justification of a queried argument