Robert Brandom's normative-pragmatic theory is intended to represent the minimal set of practical abilities whose exhibition qualifies creatures as speaking a language. His model of a minimally discursive practice (MDP) is one in which participants, devoid of logical vocabulary, are only capable of making assertions and drawing inferences. This dissertation argues that Brandom's purely assertional practices are not MDPs and that speech acts of asking questions (queries) must be included in any practice that counts as an MDP. I propose several (...) novel alternations to Brandom's deontic scorekeeping model of discourse, which I then utilize to generate a normative-pragmatic analysis of inquisitive practices. This analysis supports the claim that agents who can assert need to be able to ask questions and vice versa. The upshot is that intentionality belongs to those who can ask and answer questions. (shrink)

I aim to develop a tool for comparing theories of vagueness, using Structured Query Language. Relevant SQL snippets will be used throughout.

Large databases of linguistic annotations are used for testing linguistic hypotheses and for training language processing models. These linguistic annotations are often syntactic or prosodic in nature, and have a hierarchical structure. Query languages are used to select particular structures of interest, or to project out large slices of a corpus for external analysis. Existing languages suffer from a variety of problems in the areas of expressiveness, efficiency, and naturalness for linguistic query. We describe the domain of (...) linguistic trees and discuss the expressive requirements for a query language. Then we present a language that can express a wide range of queries over these trees, and show that the language is first-order complete over trees. (shrink)

Exploring the risks, ambiguities, and unstable conceptual worlds of contemporary thought, Crossover Queries brings together the wide-ranging writings, across twenty years, of one of our most important philosophers.Ranging from twentieth-century European philosophy—the thought of Heidegger, Foucault, Derrida, Levinas, Janicaud, and others—to novels and artworks, music and dance, from traditional Jewish thought to Jain andBuddhist metaphysics, Wyschogrod’s work opens radically new vistas while remaining mindful that the philosopher stands within and is responsible to a philosophical legacy conditioned by the negative.Rather than (...) point to a Hegelian dialectic of overcoming negation or to a postmetaphysical exhaustion, Wyschogrod treats negative moments as opening novel spaces for thought. She probes both the desire for God and an ethics grounded in the interests of the other person, seeing these as moments both of crossing over and of negation. Alert to the catastrophes that have marked our times, she exposes the underlying logical structures of nihilatory forces that have been exerted to exterminate whole peoples. Analyzing the negationsof biological research and cultural images of mechanized and robotic bodies, she shows how they contest the body as lived in ordinary experience.“Crossover Queries brings together important essays on a remarkable range of topics by one of our most insightful cultural critics. Commenting on philosophical and theological issues that have shaped the recent past as well as scientific and technological questions that will preoccupy us in the near future, Wyschogrod consistently alerts us to the urgency of problems whose importance few recognize. To avoid the challenge these essays pose is to avoid responsibility for a future that appears to be increasingly fragile.”—Mark C. Taylor, Columbia University. (shrink)

The editorial introduces issue 21.1 of Technoetic Arts via a critical reflection on the artificial intelligence hype (AI hype) that emerged in 2022. Tracing the history of the critique of Large Language Models, the editorial underscores that there are substantial ethical challenges related to bias in the training data, copyright issues, as well as ecological challenges which the technology industry has consistently downplayed over the years. -/- The editorial highlights the distinction between the current AI technology’s reliance on extensive pre-existing (...) human-generated data for pattern recognition and the performative process inherent in art practice. Patterns of creative output can be replicated without a thorough understanding of underlying concepts. In contrast, the performative process of art practice, as explored through the conceptual frameworks of creativity by Noam Chomsky, Charles Sanders Peirce, and Roger T. Ames and discussed in previous publications by this editorial's author, creates concepts and continually ‘strives to extend itself towards the unknown.’ -/- Following this introductory section, the editorial provides an overview of the ten articles featured in this issue of Technoetic Arts. The first four texts engage with emerging technologies from various perspectives in art and design. The subsequent six articles, part of a special section titled 'Perspectives from Chandigarh,' reflect a quest for meaningful existence within colonial, patriarchal, and biopolitical structures that frame everyday practices of exclusion and oppression. (shrink)

This thesis proposes and presents two new models for belief representation and belief revision. The first model is the B-structures model which relies on a notion of partial language splitting and tolerates some amount of inconsistency while retaining classical logic. The model preserves an agent's ability to answer queries in a coherent way using Belnap's four-valued logic. Axioms analogous to the AGM axioms hold for this new model. The distinction between implicit and explicit beliefs is represented and psychologically plausible, (...) computationally tractable procedures for query answering and belief base revision are obtained. ;The second model presents a method for relevance sensitive non-monotonic inference from belief sequences which incorporates insights pertaining to prioritized inference and relevance sensitive, inconsistency tolerant belief revision. Our model uses a finite, logically open sequence of propositional formulas as a representation for beliefs and defines a notion of inference from maxiconsistent subsets of formulas guided by two orderings: a temporal sequencing and an ordering based on relevance relations between the conclusion and formulas in the sequence. The relevance relations are ternary as opposed to standard binary axiomatizations. The inference operation thus defined easily handles iterated revision by maintaining a revision history, blocks the derivation of inconsistent answers from a possibly inconsistent sequence and maintains the distinction between explicit and implicit beliefs. In doing so, it provides a finitely representable formalism and a plausible model of reasoning for automated agents. (shrink)

To address the problems of both structured coordination of linked and modularised ontologies and to query a large dynamic ontology system, we propose a basic granularity framework and a set of functions to query such a granulated system. The granularity framework enforces a constrained and structured modularization. This facilitates automation of both dividing a large body of represented information as well as relinking the pieces. The functions enable basic cross-granular querying in a transparent and scalable way, as they (...) rely on the unambiguous management layer provided by the granularity framework, and are reusable for ontologies represented and stored in different formats. (shrink)

Recent studies indicate that indicative conditionals like "If people wear masks, the spread of Covid-19 will be diminished" require a probabilistic dependency between their antecedents and consequents to be acceptable (Skovgaard-Olsen et al., 2016). But it is easy to make the slip from this claim to the thesis that indicative conditionals are acceptable only if this probabilistic dependency results from a causal relation between antecedent and consequent. According to Pearl (2009), understanding a causal relation involves multiple, hierarchically organized conceptual dimensions: (...) prediction, intervention, and counterfactual dependence. In a series of experiments, we test the hypothesis that these conceptual dimensions are differentially encoded in indicative and counterfactual conditionals. If this hypothesis holds, then there are limits as to how much of a causal relation is captured by indicative conditionals alone. Our results show that the acceptance of indicative and counterfactual conditionals can become dissociated. Furthermore, it is found that the acceptance of both is needed for accepting a causal relation between two co-occurring events. The implications that these findings have for the hypothesis above, and for recent debates at the intersection of the psychology of reasoning and causal judgment, are critically discussed. Our findings are consistent with viewing indicative conditionals as answering predictive queries requiring evidential relevance (even in the absence of direct causal relations). Counterfactual conditionals in contrast target causal relevance, specifically. Finally, we discuss the implications our results have for the yet unsolved question of how reasoners succeed in constructing causal models from verbal descriptions. (shrink)

_ Source: _Volume 7, Issue 4, pp 258 - 271 This contribution to the symposium on Annalisa Coliva’s _Extended Rationality_ is largely sympathetic with the moderate view of the structure of epistemic warrant which is defended in the book. However, it takes issue with some aspects of Coliva’s Wittgenstein-inspired ‘hinge epistemology’, focussing especially on her conception of propositional warrant, her treatment of epistemic closure, her antirealist conception of truth, and the significance of her answer to so-called Humean scepticism.

In this paper, we study the path based continuous spatial keyword queries, which find the answer set continuously when the query point moves on a given path. Under this setting, we explore two primitive spatial keyword queries, namely k nearest neighbor query and range query. The technical challenges lie in that: retrieving qualified vertices in large road networks efficiently, and issuing the query continuously for points on the path, which turns out to be inapplicable. To overcome (...) the above challenges, we first propose a backbone road network index structure, which supports the distance computation efficiently and offers a global insights of the whole road network. Motivated by the safe zone technique, we then transform our queries to the issue of finding event points, which capture the changes of answer set. By this transformation, our queries are to be simple and feasible. To answer the queries, we propose a Two-Phase Progressive computing framework, which first computes the answer sets for some crucial vertices on the path, and then identifies the event points by the retrieved answer sets. Extensive experiments on both real and synthetic data sets are conducted to evaluate the performance of our proposed algorithms, and the results show that our algorithms outperform competitors by several orders of magnitude. (shrink)

During a call, telemarketers sometimes solicit respondent’s opinions about a product or service. This turns out to be a query with multiple implications, and respondents are alive to them. On the one hand, the recipient orients to a local preference to evaluate the telemarketer’s product positively. On the other hand, a positive assessment may result in expectations and commitments that survive the sequence and that are relevant for the call’s outcome. The recipient is faced with two types of preference (...) structures, one grounded in the sequence and the other one in the course of action it is part of. The preferences may be incompatible. Analysis shows that the shape of response turns with congruent preferences is observably different from response turns with cross-cutting preferences. In the latter case, the dispreferred character of the response to the caller’s ultimate purpose – that is, making a proposal for a commercial transaction – dominates over the response to the opinion query as just an opinion query in its own right. To generalize, the analysis shows that preparatory sequences in standardized courses of action in institutional settings are a special type of presequence. The participants develop a course of action through ordered series of preparatory sequences. Although locally responding to initiatives of the interlocutor, each response shows an orientation to both the local contingencies of the ongoing sequence and to the overall course of action it is contributing to. (shrink)

The work of Chandra and Harel contained in Chandra and Harel 156–178) can be considered as the beginning of the construction of a theoretical framework in which the computability and the complexity of queries to relational databases could be studied. In the definition of the class CQ of computable queries, the authors included untyped queries , that is, queries whose answers are relations of possibly different arities on different relational structures or databases. However, it seems that in the quite (...) wide and important work which followed on the subject, untyped queries were not considered at all, neither in the abstract machines side , nor in the logic framework. We propose to re-introduce these queries in the study of query computability and complexity without the need to leave the relational model. One important application which we consider in the theoretical setting is the computation of numerical queries, that is, queries which range over the naturals. Numerical queries do not fit in the current state of the theory regarding the two formalisms referenced above, since they can result in numerical values which are not necessarily in the domain of the given structure. We define an extension of the reflective relational machine of Abiteboul et al. , which we call untyped reflective relational machine , and we prove that this model is complete considering the whole class CQ . In the logic framework, we define a new quantifier, which we call conditional quantifier , and we build with it an infinitary logic which we denote by L ω 1 ω c . The difference between this logic and the well-known infinitary logic L ω 1 ω is that a formula of our logic can induce relations of different arities on different structures or databases. Then we prove that L ω 1 ω c strictly includes the whole sub-class of the total computable queries, including untyped queries. Finally, we define a fragment of L ω 1 ω c which we prove that exactly captures the sub-class of the total computable queries, but which is undecidable. We also define an undecidable fragment of L ω 1 ω which exactly captures the sub-class of the total and typed computable queries. (shrink)

We propose a new relevance sensitive model for representing and revising belief structures, which relies on a notion of partial language splitting and tolerates some amount of inconsistency while retaining classical logic. The model preserves an agent's ability to answer queries in a coherent way using Belnap's four-valued logic. Axioms analogous to the AGM axioms hold for this new model. The distinction between implicit and explicit beliefs is represented and psychologically plausible, computationally tractable procedures for query answering and (...) belief.. (shrink)

Referring to basic Weberian notions of rationalization and secularization, I try to find a more accurate sense of the term “secularization”, intending to describe adequately the position of religion in modernity. The result of this query is—or at least should be—a new, original conceptualization of religion as one of finite provinces of meaning within one paramount reality of the life-world, as defined by Alfred Schutz. I proceed by exposing a well known, major oversimplification of the Weberian concept of secularization, (...) very well outlined in Peter Berger’s The sacred canopy, in order to point to the genuine, much more differentiated position of Max Weber in this matter (especially from the period of Foundations of social economic and Economy and society), and, consequently, to return to the roots of Berger’s thought: phenomenological sociology of Alfred Schutz, an attempt to assure the philosophical foundations of Weber’s sociological theory. At a closer glimpse, transformation of religion in the modern process of rationalization does not consist—according to Weber—in eliminating religion and thus depriving society of the religious source of meaning, but in parallel emancipation of many different domains of rationality, including religion itself. Using Schutz’s analysis of the social world as a complex structure of many different final provinces of meaning, I describe religion as such a province and show what does the process of rationalization of this province consist and what it should consist in: a complex, ongoing exchange of cognitive relevances and contents, combined with growing autonomy of many different sub-worlds. Schutz’s theory of symbol, rooted in Edmund Husserl’s description of constitution of complex objects in mono- and polythetic acts of consciousness, moves the analysis to the epistemological level, pointing to a chance of intensifying our cognitive relation to reality through increasing interpenetration of various sub-universes of meaning. (shrink)

Does y obtain under the counterfactual supposition that x? The answer to this question is famously thought to depend on whether y obtains in the most similar world in which x obtains. What this notion of ‘similarity’ consists in is controversial, but in recent years, graphical causal models have proved incredibly useful in getting a handle on considerations of similarity between worlds. One limitation of the resulting conception of similarity is that it says nothing about what would obtain were the (...) causal structure to be different from what it actually is, or from what we believe it to be. In this paper, we explore the possibility of using graphical causal models to resolve counterfactual queries about causal structure by introducing a notion of similarity between causal graphs. Since there are multiple principled senses in which a graph G* can be more similar to a graph G than a graph G**, we introduce multiple similarity metrics, as well as multiple ways to prioritize the various metrics when settling counterfactual queries about causal structure. (shrink)

There is no consensus as to whether a Liar sentence is meaningful or not. Still, a widespread conviction with respect to Liar sentences (and other ungrounded sentences) is that, whether or not they are meaningful, they are useless . The philosophical contribution of this paper is to put this conviction into question. Using the framework of assertoric semantics , which is a semantic valuation method for languages of self-referential truth that has been developed by the author, we show that certain (...) computational problems, called query structures , can be solved more efficiently by an agent who has self-referential resources (amongst which are Liar sentences) than by an agent who has only classical resources; we establish the computational power of self-referential truth . The paper concludes with some thoughts on the implications of the established result for deflationary accounts of truth. (shrink)

This paper presents an enhanced ontology formalization, combining previous work in Conceptual Structure Theory and Order-Sorted Logic. Most existing ontology formalisms place greater importance on concept types, but in this paper we focus on relation types, which are in essence predicates on concept types. We formalize the notion of ‘predicate of predicates’ as meta-relation type and introduce the new hierarchy of meta-relation types as part of the ontology definition. The new notion of closure of a relation or meta-relation type is (...) presented as a means to complete that relation or meta-relation type by transferring extra arguments and properties from other related types. The end result is an expanded ontology, called the closure of the original ontology, on which automated inference could be more easily performed. Our proposal could be viewed as a novel and improved ontology formalization within Conceptual Structure Theory and a contribution to knowledge representation and formal reasoning (e.g., to build a query-answering system for legal knowledge). (shrink)

First-order logic is known to have a severely limited expressive power on finite structures. As a result, several different extensions have been investigated, including fragments of second-order logic, fixpoint logic, and the infinitary logic L∞ωω in which every formula has only a finite number of variables. In this paper, we study generalized quantifiers in the realm of finite structures and combine them with the infinitary logic L∞ωω to obtain the logics L∞ωω, where Q = {Qi: iε I} is (...) a family of generalized quantifiers on finite structures. Using the logics L∞ωω, we can express polynomial-time properties that are not definable in L∞ωω, such as “there is an even number of x” and “there exists at least n/2 x” , without going to second-order logic. We show that equivalence of finite structures relative to L∞ωω can be characterized in terms of certain pebble games that are a variant of the Ehrenfeucht—Fraïssé games. We combine this game-theoretic characterization with sophisticated combinatorial tools from Ramsey theory, such as van der Waerden's Theorem and Folkman's Theorem, in order to investigate the scope and limits of generalized quantifiers in finite model theory. We obtain sharp lower bounds for expressibility in the logics L∞ωω and discover an intrinsic difference between adding finitely many simple unary generalized quantifiers to L∞ωω adding infinitely many. In particular, we show that if Qis a finite sequence of simple unary generalized quantifiers, then the equicardinality, or Härtig, quantifier is not definable in L∞ωω. We also show that the query “does the equivalence relation E have an even number of equivalence classes” is not definable in the extension L∞ωω of L∞ωω by the Härtig quantifier I and any finite sequence Q of simple unary generalized quantifiers. (shrink)

Information-seeking interactions in multi-agent systems are required for situations in which there exists an expert agent that has vast knowledge about some topic, and there are other agents (questioners or clients) that lack and need information regarding that topic. In this work, we propose a strategy for automatic knowledge acquisition in an information-seeking setting in which agents use a structured argumentation formalism for knowledge representation and reasoning. In our approach, the client conceives the other agent as an expert in a (...) particular domain and is committed to believe in the expert’s qualified opinion about a given query. The client’s goal is to ask questions and acquire knowledge until it is able to conclude the same as the expert about the initial query. On the other hand, the expert’s goal is to provide just the necessary information to help the client understand its opinion. Since the client could have previous knowledge in conflict with the information acquired from the expert agent, and given that its goal is to accept the expert’s position, the client may need to adapt its previous knowledge. The operational semantics for the client-expert interaction will be defined in terms of a transition system. This semantics will be used to formally prove that, once the client-expert interaction finishes, the client will have the same assessment the expert has about the performed query. (shrink)

In this article we introduce a logical structure for normative reasoning, called Normative Detachment Structure with Ideal Conditions, that can be used to represent the content of certain legal texts in a normalized way. The structure exploits the deductive properties of a system of bimodal logic able to distinguish between ideal and actual normative statements, as well as a novel formalization of conditional normative statements able to capture interesting cases of contrary-to-duty reasoning and to avoid deontic paradoxes. Furthermore, we illustrate (...) how the theoretical framework proposed can be mechanized to get an automated procedure of query-answering on an example of legal text. (shrink)

There are properties of finite structures that are expressible with the use of Hilbert's ε-operator in a manner that does not depend on the actual interpretation for ε-terms, but not expressible in plain first-order. This observation strengthens a corresponding result of Gurevich, concerning the invariant use of an auxiliary ordering in first-order logic over finite structures. The present result also implies that certain non-deterministic choice constructs, which have been considered in database theory, properly enhance the expressive power of (...) first-order logic even as far as deterministic queries are concerned, thereby answering a question raised by Abiteboul and Vianu. (shrink)

We here examine the expressive power of first order logic with generalized quantifiers over finite ordered structures. In particular, we address the following problem: Given a family Q of generalized quantifiers expressing a complexity class C, what is the expressive power of first order logic FO(Q) extended by the quantifiers in Q? From previously studied examples, one would expect that FO(Q) captures L C , i.e., logarithmic space relativized to an oracle in C. We show that this is not (...) always true. However, after studying the problem from a general point of view, we derive sufficient conditions on C such that FO(Q) captures L C . These conditions are fulfilled by a large number of relevant complexity classes, in particular, for example, by NP. As an application of this result, it follows that first order logic extended by Henkin quantifiers captures L NP . This answers a question raised by Blass and Gurevich [Ann. Pure Appl. Logic, vol. 32, 1986]. Furthermore we show that for many families Q of generalized quantifiers (including the family of Henkin quantifiers), each FO(Q)-formula can be replaced by an equivalent FO(Q)-formula with only two occurrences of generalized quantifiers. This generalizes and extends an earlier normal-form result by I. A. Stewart [Fundamenta Inform. vol. 18, 1993]. (shrink)

In this article, I query whether participation in the labour market can hinder neo-republican freedom as non-domination. I briefly present the view of Philip Pettit on the topic, based on the distinction between offering a reward and threatening a punishment. I compare it to the analysis of labour republicans, recently reconstructed by Alex Gourevitch, according to whom, the exclusion of a group of individuals from the control of productive assets represents a form of structural domination. Then, I explain why (...) I take a position that is different from both. I hold that capitalist structural domination leads only to exploitation, not interpersonal domination. In doing this, I consider two objections that might be raised against my argument. The first one is based on incomplete contracts and on a possible ideal benchmark for job offers. The second one challenges the supposed arbitrariness of unequal property relations within the capitalist social system. (shrink)

Imagining structures from the ekphrastic descriptions of the Jerusalem Temple and Temple Mount in I Kings and Ezekiel is an ancient meditation discipline, which was adopted from Jewish practices into early Christian monasticism. Though it could take various forms, ‘imagining/remembering Jerusalem’ was often practised as a devotional exercise throughout the European Middle Ages. Drawings of such an imagined character are significant to late medieval exegesis of these and related scriptural materials, particularly those associated with the commentaries of Nicholas of (...) Lyra and the collection of visual meditations known as the Speculum theologie. This chapter queries a late medieval illuminated manuscript that, in the fifteenth century, formed part of the library of St John's Hospital in Exeter, to suggest that its materials were acquired and used for scriptural study and sermon composition by scholars of the hospital and its associated school. (shrink)

This paper queries the logic of the structure of hierarchical philosophical systems. Following the Indian tradition of siddhānta, Tibetan Buddhist traditions articulate a hierarchy of philosophical views. The ‘Middle Way’ philosophy or Madhyamaka—the view that holds that the ultimate truth is emptiness—is, in general, held to be the highest view in the systematic depictions of philosophies in Tibet, and is contrasted with realist schools of thought, Buddhist and non-Buddhist. But why should an antirealist or nominalist position be said to be (...) ‘better’ than a realist position? What is the criterion for this claim and is it, or can it, be more than a criterion that is tradition-specific for only Tibetan Buddhists? In this paper, I will look at the criteria to evaluate Buddhist philosophical traditions, particularly as articulated in what came to be referred as the ‘nonsectarian’ tradition. I draw from the recent work of Jorge Ferrer to query the assumptions of the hierarchical structures of ‘nonsectarian’ traditions and attempt to articulate an evaluative criteria for a nonsectarian stance that are not based solely on metaphysical or tradition-specific claims. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:“I would rather be a cyborg than a goddess”Becoming-Intersectional in Assemblage TheoryJasbir K. Puar“Grids happen” writes Brian Massumi, at a moment in Parables for the Virtual where one is tempted to be swept away by the endless affirmative becomings of movement, flux, and potential, as opposed to being pinned down by the retroactive positioning of identity (2002, 8). For the most part, Massumi has been less interested in how (...) grids happen than in asking how they can un-happen, or not happen. What the tension between the two purportedly opposing forces signals, at this junction of scholarly criticism, might be thought of as a dialogue between theories that deploy the subject as a primary analytic frame, and those that highlight the forces that make subject formation tenuous, if not impossible or even undesirable. I have seen this tension manifest acutely in my own work on intersectionality and assemblage theory. On the one hand I have been a staunch advocate of what is now commonly known as an intersectional approach: analyses that foreground the mutually co-constitutive forces of race, class, sex, gender, and nation. Numerous feminist thinkers consider intersectionality the dominant paradigm through which feminist theory has analyzed difference; Leslie McCall argues that intersectionality might be considered “the most important theoretical contribution that women’s studies, in conjunction with other fields, has made so far” (McCall 2005, 1771). Intersectional analysis is now a prevalent approach in queer theory.1 At the same time, encountering a poststructuralist fatigue with the now-predictable yet still [End Page 49] necessary demands for subject recognition, I also argued in my book, Terrorist Assemblages: Homonationalism in Queer Times, that intersectionality as an intellectual rubric and a tool for political intervention must be supplemented—if not complicated and reconceptualized—by a notion of assemblage. Following Massumi on the “retrospective ordering” of identities such as “gender, race, and sexual orientation” which “back-form their reality,” in Terrorist Assemblages I write, “[I]ntersectional identities and assemblages must remain as interlocutors in tension... intersectional identities are the byproducts of attempts to still and quell the perpetual motion of assemblages, to capture and reduce them, to harness their threatening mobility” (Puar 2007, 213). Subject positioning on a grid is never self-coinciding; positioning does not precede movement but rather it is induced by it; epistemological correctives cannot apprehend ontological becomings; the complexity of process is continually mistaken for a resultant product.2Since the publication of Terrorist Assemblages, in response to anxieties about my apparent prescription to leave intersectionality behind (as if one could), I have often been asked to elaborate on the political usages of assemblages and assemblage theory. A prominent concept in the work of Gilles Deleuze and Felix Guattari, assemblage seems to inspire doubt about its political “ applicability,” while intersectionality seems to hold fast as a successful tool for political and scholarly transformation. Part of the assumption at work in these queries is that representation, and its recognized subjects, is the dominant, primary, or most efficacious platform of political intervention, while a Deleuzian nonrepresentational, non-subject-oriented politics is deemed impossible. Perhaps these queries also reveal concerns about how they might be somehow incompatible or even oppositional, despite the fact that intersectionality and assemblage are not analogous in terms of content, utility, or deployment. As analytics, they may not be reconcilable. Yet they need not be oppositional but rather, I argue, frictional.In what follows, I offer some preliminary thoughts on the limits and possibilities of intersectionality and assemblage and what might be gained by thinking them through and with each other. What are the strengths of each in the realms of theory, political organizing, legal structures, and method? Through highlighting the convivial crossings of these two differentiated but not oppositional genealogies, I offer some thoughts on epistemological correctives in feminist knowledge production—which has been driven, sometimes single-mindedly, by the mandate of intersectional analysis—to see what kinds of futures are possible for feminist theorizing. I reread the formative concept that fueled the metaphoric invocation of intersectionality, specifically Kimberlé Crenshaw’s use of the traffic intersection, to show where intersectionality, as that which retroactively forms the grid and... (shrink)

Listed buildings, even if they are not top landmarks, are increasingly attracting visitors. People express interest in hidden gems in their neighborhood or along their travel itinerary, and in the history of the building they live in. All required data has been meticulously collected by the offices for historical monuments but is not flexibly accessible. In Bremen, the database of buildings (with location, map of the estate, construction history, architect, photos) is searchable and browsable online3, but that only helps users (...) who know how to use a rigidly structured database search form. Our beginning BauDenkMalNetz effort (“listed building web”) aims at a wider purpose: modeling the semantic structure of these data, starting in Bremen but open for other data, and exposing them via a semantic web interface with enhanced querying and presentation capabilities. Requirements beyond interactive browsing comprise auto-generation of customized printed guides (e. g. “Bauhaus villas in my neighborhood”), on-demand presentation on mobile devices (e. g. “medieval churches along my travel itinerary”), and serving linked data for usage by other services. (shrink)

This article starts with the analysis of the existing electronic commerce system, summarizes its characteristics, and analyzes and solves its existing problems. Firstly, the characteristics of the relational database My Structured Query Language and the distributed database HBase are analyzed, their respective advantages and disadvantages are summarized, and the advantages and disadvantages of each are taken into account when storing data. My SQL is used to store structured business data in the system, while HBase is used to store unstructured (...) data such as pictures. These two storage mechanisms together constitute a data storage subsystem. Secondly, considering the large amount of data in the e-commerce system and the complex calculation of the data mining algorithm, this paper uses MapReduce to realize the parallelization of the data mining algorithm and builds a Hadoop-based commodity recommendation subsystem on this basis. We use JavaEE technology to design a full-featured web mall system. Finally, based on the impact of cloud computing, mobile e-commerce is analyzed, including relevant theories, service mode, architecture, core technology, and the application in e-commerce, which can realize e-commerce precision marketing, find the optimal path of logistics, and take effective security measures to avoid transaction risks. This method can avoid the disadvantages of the traditional e-commerce, where large-scale data cannot be processed in a timely manner, realize the value of mining data behind, and realize the precision marketing of e-commerce enterprises. (shrink)

Community search is a query-oriented variant of community detection problem, and the goal is to retrieve a single community from a given set of nodes. Most of the existing community search methods adopt handcrafted features, so there are some limitations in applications. Our idea is motivated by the recent advances of node embedding. Node embedding uses deep learning method to obtain feature representation of nodes directly from graph structure automatically and offers a new method to measure the distance between (...) two nodes. In this paper, we propose a two-stage community search algorithm with a minimum spanning tree strategy based on node embedding. At the first stage, we propose a node embedding model NEBRW and map nodes to the points in a low-dimensional vector space. At the second stage, we propose a new definition of community from the distance viewpoint, transform the problem of community search to a variant of minimum spanning tree problem, and uncover the target community with an improved Prim algorithm. We test our algorithm on both synthetic and real-world network datasets. The experimental results show that our algorithm is more effective for community search than baselines. (shrink)

In this paper, I examine Kearney's call for an ethical imagination from a specifically Levinasian perspective. I begin by reviewing Kearney's proposal, querying the structure of his ethical imagination. I then give a brief sketch of Levinas's thought with special attention to his theme of le tiers, and the necessary passage from ethics to the politics of justice. I will argue that Kearny's diacritical method exemplifies an appropriate approach to the said, the region of justice, history, and politics, while suggesting (...) that Levinas offers Kearney a more radical anthropology than can be found in Ricoeur. My wager is that a basic tension that manifests in Kearney's determination of the ethical imagination may ideally correlate to the aporetic passage from ethics to politics in Levinas such that they exhibit a specific complementarity. I conclude by exploring the problems and promises of my argument and the motives for my thesis. (shrink)

It is a familiar idea that in learning to do philosophy we have to acquire new habits of thought, a supposition that may help explain why it does not happen quickly and why, especially in retrospect, the process has something of the feeling of an upbringing, of being gradually drawn into a distinctive way of life. Familiar also, to many, will be the instruction to concentrate purely on the arguments of those philosophers we study, ignoring the irrelevancies of character and (...) biography, advice seemingly aimed at a happy coincidence of moral and intellectual virtue, ruling out, as it does, the recourse to personal criticism in philosophical discussion.Yet if philosophy is correctly to be approached as a structure of ideas, detached from the life of its creators, why was it so intriguing, as students, to find, occasionally, a picture of the author on the dust jacket of our set text, and why were we so curious about the characters of the speakers invited to philosophy society? Partly, no doubt, this interest was, and is, no more than a natural curiosity about people from whom we might expect to learn, an entirely understandable attitude, and not necessarily trivial, but one with no essential connection to the subject. Yet reading Alex Voorhoeve’s beautifully produced collection of his conversations with 11 thinkers on ethics does make one wonder whether the personal has some further bearing on philosophy, and if so how this might be and with what significance. Perhaps even the dust jacket reflects this query, with 10 of the interviewees caught by Steve Pyke’s striking photographs, their faces sharply lit, yet not as we would ever meet them, emerging somewhat eerily from an impenetrably black background. All are reproduced in a larger format inside, together with an uncredited photograph of the 11th in an instructively contrasting style. (shrink)

This paper has aimed to remedy a neglect of multi-party disputes by addressing how those involved in a two-party argument may collaborate with others who are co-present. Collaboration is a complex phenomenon. In the first place, we have seen that disputes, although initially produced by two parties, do not consist simply of two sides. Rather, given one party's displayed position, stance, or claim, another party can produce opposition by simply aligning against that position or by aligning with a counterposition. This (...) means that parties can dispute a particular position for different reasons and by different means. It is therefore possible for several parties to serially oppose another's claim without achieving collaboration. A second complexity, then, is just that collaboration is a negotiated phenomenon. For example, while it is possible for an outside party to produce an uninvited alignment display that is sympathetic to an already-stated position in a two-party dispute, the party whose position it supports can agree or disagree with that display. Thus, outsiders' uninvited alignment displays that occur subsequent to those of the insiders or principals in a two-party dispute must be considered as collaboration offers, which can be accepted or rejected. But that is not the end of it, for an outside party can offer alignments that now align with a principal party's position and then, addressing a different aspect of the principal's talk, align against it. Finally, in addition to being offered, collaboration can also be solicited. A principal in a two-party dispute solicits collaboration by inviting an outsider to display an alignment favorable to inviter's own position or to participate in a joint activity that supports that stance. Such solicits can be accepted, rejected, or, again, handled in such a way as to exhibit neutrality. Argumentative collaboration, in short, is a specific, momentary, and delicate state of affairs that is also an organized, technical achievement.The fact that the subjects for this study were children has become submerged in the formal analysis of alignment structures and collaboration. Thus, following this research, two directions can be pursued. One would be to ask how children's arguments differ from those occurring among adults. A reasoned answer would be that matters of substance or content may distinguish disputes among youthful persons from those occurring among older ones, while the forms of disputing remain relatively invariant (Maynard, 1985a, 1985b). In other words, by studying multi-party disputes among first-grade children, we learn about the structure of collaboration as a generic phenomenon among at least practitioners of standard English no matter what their age. This claim can be sustained in part because the analysis presented here depends upon deriving a priori conventional relations between utterances, rather than statistical relations between variables (Coulter, 1983). We have not examined exogenous influences — which would include the age characteristics of participants — on disputes, but rather the endogenously-produced structure of argumentative discourse. Still, the claim that patterns of collaboration are generic to children and adults can be examined with further research on multi-party disputes among different age groups.Another, more radical, research orientation, would be to consider, in any social arena where the members are identified as children, how it is that such a ‘membership category’ (Sacks, 1972) is relevant. If that query is made, then research on ‘children's arguments’ would involve investigating formal practices for exhibiting the accountable category ‘children’ as much as it would mean describing the ways that disputing is done. Those who have studied children's arguments, in Pollner's (1979) terms, have treated ‘children’ as a social fact, a ‘thing,’ rather than as a socially organized meaning, or ‘ing.’To attend to the -ing of things involves a radical modification of the attitude of daily life, for it requires attending to the processes of constitution in lieu of the product thus constituted (Pollner, 1979: 253, fn. 11).In short, we have treated arguments as the important event without also seeing how it is that the category ‘children’ is constituted as a recognizable feature of and within the research setting. (shrink)

The central aims of this paper are to show how linguistic corpora have been used and can be used in philosophy and to argue that linguistic corpora and corpus analysis should be added to the philosopher’s toolkit of ways to address philosophical questions. A linguistic corpus is a curated collection of texts representing language use that can be queried to answer research questions. Among many other uses, linguistic corpora can help answer questions about the meaning of words and the structure (...) of discourse. Through a discussion of examples, the paper shows that there are many philosophical questions that can be addressed by using a linguistic corpus. However, linguistic corpora need not (and often cannot) replace traditional philosophical methods. Lastly, it argues that the special properties of linguistic corpora, including their independence and the current ease and cheapness of access, make them an indispensable resource for philosophers. (shrink)

This discussion piece critically examines some of the key ideology that figures in Elizabeth Fricker's ‘Stating and Insinuating’, raises a number of queries about the details of Fricker's argumentation, and develops some ideas about the normative structure of testimony that relate to the themes of that paper.

Numerous results about capturing complexity classes of queries by means of logical languages work for ordered structures only, and deal with non-generic, or order-dependent, queries. Recent attempts to improve the situation by characterizing wide classes of finite models where linear order is definable by certain simple means have not been very promising, as certain commonly believed conjectures were recently refuted (Dawar's Conjecture). We take on another approach that has to do with normalization of a given order (rather than with (...) defining a linear order from scratch). To this end, we show that normalizability of linear order is a strictly weaker condition than definability (say, in the least fixpoint logic), and still allows for extending Immerman-Vardi-style results to generic queries. It seems to be the weakest such condition. We then conjecture that linear order is normalizable in the least fixpoint logic for any finitely axiomatizable class of rigid structures. Truth of this conjecture, which is a strengthened version of Stolboushkin's conjecture, would have the same practical implications as Dawar's Conjecture. Finally, we suggest a series of reductions of the two conjectures to specialized classes of graphs, which we believe should simplify further work. (shrink)

Bio-ontologies are essential tools for accessing and analyzing the rapidly growing pool of plant genomic and phenomic data. Ontologies provide structured vocabularies to support consistent aggregation of data and a semantic framework for automated analyses and reasoning. They are a key component of the Semantic Web. This paper provides background on what bio-ontologies are, why they are relevant to botany, and the principles of ontology development. It includes an overview of ontologies and related resources that are relevant to plant science, (...) with a detailed description of the Plant Ontology (PO). We discuss the challenges of building an ontology that covers all green plants (Viridiplantae). Key results: Ontologies can advance plant science in four keys areas: 1. comparative genetics, genomics, phenomics, and development, 2. taxonomy and systematics, 3. semantic applications and 4. education. Conclusions: Bio-ontologies offer a flexible framework for comparative plant biology, based on common botanical understanding. As genomic and phenomic data become available for more species, we anticipate that the annotation of data with ontology terms will become less centralized, while at the same time, the need for cross-species queries will become more common, causing more researchers in plant science to turn to ontologies. (shrink)

Under the influence of Hilary Putnam’s collapse of the fact/value dichotomy, a resurging approach that challenges the movements of American pragmatism and discourse ethics, I tease out in the first section of my paper the demand for the warranted assertibility hypothesis in Putnam’s sense that may be possible, relying on moral realism to get rid of ‘rampant Platonism’. Tracing back to ‘communicative action’ or the Habermasian way that puts forward the reciprocal understanding of discourse instigates the idea of life-world as (...) composed of ‘culturally transmitted and linguistically organized stock of interpretative patterns’, this section looks for whether Habermas’ psychoanalysis of prolonged discussion can accord with Putnam’s thick ethical terms or not. The last section of the paper pitfalls Putnam’s stance to accepting Habermas’ ‘discourse ethics’ that centers around the context of entangling ‘rational thoughts’ to ‘communication’, but he introduces the idea of fallibilism in a rational query that also attacks the Habermasian metaphysical idea of the validity of ethical statements that goes towards the truth. My next attempt is to see whether Putnam’s objective dictum towards morality that resonates the collapse of fact/value dichotomy from a universalistic stand can successfully evade Rorty’s naive realism and Habermas’ ‘sociologism about values’ respectively. This sort of claim insists on a universalizable pattern of culture-relative value. I consider that the idea of a fact/value dichotomy engages with the inextricable entanglement between the normative and descriptive content, besides the epistemic values having exclusively intertwined with the structure of factual discourse that intends towards collapsing the fact/value dichotomy, a subjective universalizability predilection. (shrink)

A sentence of first-order logic is satisfiable if it is true in some structure, and finitely satisfiable if it is true in some finite structure. The question arises as to whether there exists an algorithm for determining whether a given formula of first-order logic is satisfiable, or indeed finitely satisfiable. This question was answered negatively in 1936 by Church and Turing (for satisfiability) and in 1950 by Trakhtenbrot (for finite satisfiability).In contrast, the satisfiability and finite satisfiability problems are algorithmically solvable (...) for restricted subsets---or, as we say, fragments---of first-order logic, a fact which is today of considerable interest in Computer Science. This book provides an up-to-date survey of the principal axes of research, charting the limits of decision in first-order logic and exploring the trade-off between expressive power and complexity of reasoning. Divided into three parts, the book considers for which fragments of first-order logic there is an effective method for determining satisfiability or finite satisfiability. Furthermore, if these problems are decidable for some fragment, what is their computational complexity? Part I focusses on fragments defined by restricting the set of available formulas. Topics covered include the Aristotelian syllogistic and its relatives, the two-variable fragment, the guarded fragment, the quantifier-prefix fragments and the fluted fragment. Part II investigates logics with counting quantifiers. Starting with De Morgan's numerical generalization of the Aristotelian syllogistic, we proceed to the two-variable fragment with counting quantifiers and its guarded subfragment, explaining the applications of the latter to the problem of query answering in structured data. Part III concerns logics characterized by semantic constraints, limiting the available interpretations of certain predicates. Taking propositional modal logic and graded modal logic as our cue, we return to the satisfiability problem for two-variable first-order logic and its relatives, but this time with certain distinguished binary predicates constrained to be interpreted as equivalence relations or transitive relations. The work finishes, slightly breaching the bounds of first-order logic proper, with a chapter on logics interpreted over trees. (shrink)

This study assesses the retractions of scientific articles in engineering journals indexed on the Web of Science from 1945 to 2015. The data set was built based on documents containing the keywords retracted, retraction, withdrawal, or redress. We used database exploration techniques, including Structured Query Language and analysis of variance, for data analysis. We analyzed 238 retractions published by 117 journals. The most common reason for retraction was unethical research, and higher impact factors journals tended to publish more retractions. (...) In conclusion, most of the analyzed retractions were the result of unethical research and were retracted by editors. (shrink)

Objective: There are benefits and risks of giving patients more granular control of their personal health information in electronic health record (EHR) systems. When designing EHR systems and policies, informaticists and system developers must balance these benefits and risks. Ethical considerations should be an explicit part of this balancing. Our objective was to develop a structured ethics framework to accomplish this. -/- Methods: We reviewed existing literature on the ethical and policy issues, developed an ethics framework called a “Points to (...) Consider” (P2C) document, and convened a national expert panel to review and critique the P2C. -/- Results: We developed the P2C to aid informaticists designing an advanced query tool for an electronic health record (EHR) system in Indianapolis. The P2C consists of six questions (“Points”) that frame important ethical issues, apply accepted principles of bioethics and Fair Information Practices, comment on how questions might be answered, and address implications for patient care. -/- Discussion: The P2C is intended to clarify whatis at stake when designers try to accommodate potentially competing ethical commitments and logistical realities. The P2C was developed to guide informaticists who were designing a query tool in an existing EHR that would permit patient granular control. While consideration of ethical issues is coming to the forefront of medical informatics design and development practices, more reflection is needed to facilitate optimal collaboration between designers and ethicists. This report contributes to that discussion. (shrink)

Causal reasoning and game-theoretic reasoning are fundamental topics in artificial intelligence, among many other disciplines: this paper is concerned with their intersection. Despite their importance, a formal framework that supports both these forms of reasoning has, until now, been lacking. We offer a solution in the form of (structural) causal games, which can be seen as extending Pearl's causal hierarchy to the game-theoretic domain, or as extending Koller and Milch's multi-agent influence diagrams to the causal domain. We then consider three (...) key questions: i) How can the (causal) dependencies in games - either between variables, or between strategies - be modelled in a uniform, principled manner? ii) How may causal queries be computed in causal games, and what assumptions does this require? iii) How do causal games compare to existing formalisms? To address question i), we introduce mechanised games, which encode dependencies between agents' decision rules and the distributions governing the game. In response to question ii), we present definitions of predictions, interventions, and counterfactuals, and discuss the assumptions required for each. Regarding question iii), we describe correspondences between causal games and other formalisms, and explain how causal games can be used to answer queries that other causal or game-theoretic models do not support. Finally, we highlight possible applications of causal games, aided by an extensive open-source Python library. (shrink)

We analyse the extent of possible computations following Hogarth ([2004]) conducted in Malament–Hogarth (MH) spacetimes, and Etesi and Németi ([2002]) in the special subclass containing rotating Kerr black holes. Hogarth ([1994]) had shown that any arithmetic statement could be resolved in a suitable MH spacetime. Etesi and Németi ([2002]) had shown that some relations on natural numbers that are neither universal nor co-universal, can be decided in Kerr spacetimes, and had asked specifically as to the extent of computational limits there. (...) The purpose of this note is to address this question, and further show that MH spacetimes can compute far beyond the arithmetic: effectively Borel statements (so hyperarithmetic in second-order number theory, or the structure of analysis) can likewise be resolved: Theorem A. If H is any hyperarithmetic predicate on integers, then there is an MH spacetime in which any query ? n H ? can be computed. In one sense this is best possible, as there is an upper bound to computational ability in any spacetime, which is thus a universal constant of that spacetime. Theorem C. Assuming the (modest and standard) requirement that spacetime manifolds be paracompact and Hausdorff, for any spacetime there will be a countable ordinal upper bound, , on the complexity of questions in the Borel hierarchy computable in it. Introduction 1.1 History and preliminaries Hyperarithmetic Computations in MH Spacetimes 2.1 Generalising SADn regions 2.2 The complexity of questions decidable in Kerr spacetimes An Upper Bound on Computational Complexity for Each Spacetime CiteULike Connotea Del.icio.us What's this? (shrink)

A number of general points behind the story of this paper may be worth setting out separately, now that we have come to the end.There is perhaps one obvious omission to be addressed right away. Although the word “information” has occurred throughout this paper, it must have struck the reader that we have had nothing to say on what information is. In this respect, our theories may be like those in physics: which do not explain what “energy” is (a notion (...) which seems quite similar to “information” in several ways), but only give some basic laws about its behaviour and transmission.The eventual recommendation made here has been to use a broad type-theoretic framework for studying various more classical and more dynamic notions of proposition in their interaction. This is not quite the viewpoint advocated by many current authors in the area, who argue for a whole-sale switch from a ‘static’ to a ‘dynamic’ perspective on propositions. This is not the place, however, to survey the conceptual arguments for and against such a more radical move.This still leaves many questions about possible reductions from one perspective to another. For instance, it would seem that classical systems ought to serve as a ‘limiting case’, which should still be valid after procedural details of some cognitive process have been forgotten. There are various ways of implementing the desired correspondence: e.g. by considering extreme cases with ⫅ equal to identity, or, in the pure relational algebra framework by considering only pairs (x, x). What we shall want then are reductions of dynamic logics, in those special cases, to classical logic. But perhaps also, more sophisticated views are possible. How do we take a piece of ‘dynamic’ prose, remove control instructions and the like, and obtain a piece of ‘classical’ text, suitable for inference ‘in the light of eternity’?There is also a more technical side to the matter of ‘reduction’. By now, Logic has reached such a state of ‘inter-translatability’ that almost all known variant logics can be embedded into each other, via suitable translations. In particular, once an adequate semantic has been given for a new system, this usually induces an embedding into standard logic: as we know, e.g., for the case of Modal Logic. Like-wise, all systems of dynamic interpretation or inference proposed so far admit of direct embedding into an ordinary ‘static’ predicate logic having explicit transition predicates (cf. van Benthem 1988b). Thus, our moral is this. The issue is not whether the new systems of information structure or processing are essentially beyond the expressive resources of traditional logical systems: for, they are not. The issue is rather which interesting phenomena and questions will be put into the right focus by them.The next broad issue concerns the specific use of the perspective proposed here, vis-à-vis concrete proposals for information-oriented or dynamic semantics. The general strategy advocated here is to locate some suitable base calculus and then consider which ‘extras’ are peculiar to the proposal. For instance, this is the spirit in which modal S4 would be a base logic of information models, and intuitionistic logicthe special theory devoting itself to upward persistent propositions. Or, with the examples in Section 4.1, the underlying base logic is our relational algebra, whereas, say, ordinary updates then impose special properties, such as ‘idempotence’: $$xRy \Rightarrow yRy$$ Does this kind of application presuppose the existence of one distinguished base logic, of which all others are extensions? This would be attractive-and some form of relational algebra or linear logic might be a reasonable candidate. Nevertheless, the enterprise does not rest on this outcome. What matters is an increased sensitivity to the ‘landscape’ of dynamic logics, just as with the ‘Categorial Hierarchy’ in Categorial Grammar (cf. van Benthem 1989a, 1991) where the family of logics with their interconnections seems more important than any specific patriarch.Finally, perhaps the most important issue in the new framework is the possibility of new kinds of questions arising precisely because of its differences from standard logic. Notably, given the option of regarding propositions as programs, it will be of interest to consider systematically which major questions about programming languages now make sense inside logic too.EXAMPLE. Correctness. When do we have $$\left[\kern-0.15em\left[ \pi \right]\kern-0.15em\right](\left[\kern-0.15em\left[ A \right]\kern-0.15em\right]) \subseteq \left[\kern-0.15em\left[ B \right]\kern-0.15em\right]$$ for (s, t) propositions A, B and a dynamic (s, (s, t)) proposition π?Program Synthesis. Which dynamic proposition will take us from an information state satisfying A to one satisfying B? (This question needs refinement, lest there be trivial answers.)Determinism. Which propositions as programs are deterministic, in the sense of defining single-valued functions from states to states?Querying. What does it mean to ask for information in the present setting? (Again, individual types referring to e will be crucial here.)This is not merely an agenda for wishful thinking. Within Logic, there are various ways of introducing such concerns into semantics, especially, using tools from Automata Theory. (See van Benthem 1989c for further discussion of such computational perspectives in ‘cognitive programming’.)At least if one believes that ‘dynamics’ is of the essence in cognition (rather than a mere interfacing problem between the halls of eternal truth and the noisy streets of reality), the true test for the present enterprise is the development of a significant new research program not merely copying the questions of old. (shrink)

Patent landscaping is the process of finding patents related to a particular topic. It is important for companies, investors, governments, and academics seeking to gauge innovation and assess risk. However, there is no broadly recognized best approach to landscaping. Frequently, patent landscaping is a bespoke human-driven process that relies heavily on complex queries over bibliographic patent databases. In this paper, we present Automated Patent Landscaping, an approach that jointly leverages human domain expertise, heuristics based on patent metadata, and machine learning (...) to generate high-quality patent landscapes with minimal effort. In particular, this paper describes a flexible automated methodology to construct a patent landscape for a topic based on an initial seed set of patents. This approach takes human-selected seed patents that are representative of a topic, such as operating systems, and uses structure inherent in patent data such as references and class codes to “expand” the seed set to a set of “probably-related” patents and anti-seed “probably-unrelated” patents. The expanded set of patents is then pruned with a semi-supervised machine learning model trained on seed and anti-seed patents. This removes patents from the expanded set that are unrelated to the topic and ensures a comprehensive and accurate landscape. (shrink)

We analyse the computational complexity of comparing informational structures. Intuitively, we study the complexity of deciding queries such as the following: Is Alice’s epistemic information strictly coarser than Bob’s? Do Alice and Bob have the same knowledge about each other’s knowledge? Is it possible to manipulate Alice in a way that she will have the same beliefs as Bob? The results show that these problems lie on both sides of the border between tractability (P) and intractability (NP-hard). In particular, (...) we investigate the impact of assuming information structures to be partition-based (rather than arbitrary relational structures) on the complexity of various problems. We focus on the tractability of concrete epistemic tasks and not on epistemic logics describing them. (shrink)

The Provenance Ontology (PROV-O) is a World Wide Web Consortium (W3C) recommended ontology used to structure data about provenance across a wide variety of domains. Basic Formal Ontology (BFO) is a top-level ontology ISO/IEC standard used to structure a wide variety of ontologies, such as the OBO Foundry ontologies and the Common Core Ontologies (CCO). To enhance interoperability between these two ontologies, their extensions, and data organized by them, a mapping methodology and set of alignments are presented according to specific (...) criteria which prioritize semantic and logical principles. The ontology alignments are evaluated by checking their logical consistency with canonical examples of PROV-O instances and querying terms that do not satisfy the alignment criteria as formalized in SPARQL. A variety of semantic web technologies are used in support of FAIR (Findable, Accessible, Interoperable, Reusable) principles. (shrink)