10,067 research outputs found

    On the Complexity of Temporal-Logic Path Checking

    Full text link
    Given a formula in a temporal logic such as LTL or MTL, a fundamental problem is the complexity of evaluating the formula on a given finite word. For LTL, the complexity of this task was recently shown to be in NC. In this paper, we present an NC algorithm for MTL, a quantitative (or metric) extension of LTL, and give an NCC algorithm for UTL, the unary fragment of LTL. At the time of writing, MTL is the most expressive logic with an NC path-checking algorithm, and UTL is the most expressive fragment of LTL with a more efficient path-checking algorithm than for full LTL (subject to standard complexity-theoretic assumptions). We then establish a connection between LTL path checking and planar circuits, which we exploit to show that any further progress in determining the precise complexity of LTL path checking would immediately entail more efficient evaluation algorithms than are known for a certain class of planar circuits. The connection further implies that the complexity of LTL path checking depends on the Boolean connectives allowed: adding Boolean exclusive or yields a temporal logic with P-complete path-checking problem

    Large-scale Parallel Stratified Defeasible Reasoning

    Get PDF
    We are recently experiencing an unprecedented explosion of available data from the Web, sensors readings, scientific databases, government authorities and more. Such datasets could benefit from the introduction of rule sets encoding commonly accepted rules or facts, application- or domain-specific rules, commonsense knowledge etc. This raises the question of whether, how, and to what extent knowledge representation methods are capable of handling huge amounts of data for these applications. In this paper, we consider inconsistency-tolerant reasoning in the form of defeasible logic, and analyze how parallelization, using the MapReduce framework, can be used to reason with defeasible rules over huge datasets. We extend previous work by dealing with predicates of arbitrary arity, under the assumption of stratification. Moving from unary to multi-arity predicates is a decisive step towards practical applications, e.g. reasoning with linked open (RDF) data. Our experimental results demonstrate that defeasible reasoning with millions of data is performant, and has the potential to scale to billions of facts

    On the cost-complexity of multi-context systems

    Full text link
    Multi-context systems provide a powerful framework for modelling information-aggregation systems featuring heterogeneous reasoning components. Their execution can, however, incur non-negligible cost. Here, we focus on cost-complexity of such systems. To that end, we introduce cost-aware multi-context systems, an extension of non-monotonic multi-context systems framework taking into account costs incurred by execution of semantic operators of the individual contexts. We formulate the notion of cost-complexity for consistency and reasoning problems in MCSs. Subsequently, we provide a series of results related to gradually more and more constrained classes of MCSs and finally introduce an incremental cost-reducing algorithm solving the reasoning problem for definite MCSs

    Value creation and change in social structures: the role of entrepreneurial innovation from an emergence perspective

    Get PDF
    Aim: Our aim is to develop a more complete understanding of how processes that entrepreneurs perform interact with wider society and the causal effects of society on entrepreneurial behaviour and vice versa. We aim to show how entrepreneurial agency is put into effect in relation to the disruption of social structure and social change. This has implications for innovation and entrepreneurship policy and practice, and for entrepreneurship theory. We also investigate the role of ‘value’ in these processes. Contribution to the literature Our central argument is that emergent forms (or ‘emergents’) may be short lived (ephemeral) but have causal power on the performance of the actors in the system of inter-relationships in the innovation ecosystem. The emphasis on inter-related social processes and ontological stratification provides theoretical development of extant entrepreneurship theory on new venture creation (by explaining process), effectuation (by linking individualism and holism) and opportunity recognition (by deconstructing opportunity into anticipation, ontology and process). Methodology The paper takes an 'emergence' perspective as a way to understand entrepreneurial processes that give rise to innovation. The anticipation of value and the inter-relationship with social and organisational structures are fundamental to this perspective. A longitudinal analysis of a case study of the development of a new business model within an entrepreneurial firm is described. The case is followed through seven phases in which the relationship between process and emergent ontological status is shown to have destabilising and stabilising effects which produce emergent properties. Results and Implications One methodological contribution is framing how to conceptualise the empirical evidence. Emergents have causal effects on the anticipations of value inherent in their particular system of innovation. This causality is manifest as the attraction of resource in the firm; the stabilisation of the emergent constitutes strategy in the enterprise. A key role of the entrepreneurs in our case study was the creation and maintenance of evolving ontological materiality, as meaningful to themselves and to those with whom they interacted. In simple terms, they made things meaningful to people who mattered

    Introduction: The history and scope of the sociology of higher education

    Get PDF
    No abstract available
    • …
    corecore