Roadmap for preferential logics

We give an overview of logical and semantical rules for nonmonotonic and related logics

Critical analysis of the Carmo-Jones system of Contrary-to-Duty obligations

We offer a technical analysis of the contrary to duty system proposed in Carmo-Jones. We offer analysis/simplification/repair of their system and compare it with our own related system

Independence and abstract multiplication

We investigate the notion of independence, which is at the basis of many, seemingly unrelated, properties of logic like Rational Monotony in non-monotonic logics, and interpolation theorems

Size and Logic

We show how to develop a multitude of rules of nonmonotonic logic from very simple and natural notions of size, using them as building blocks

Conditionals and modularity in general logics

In this work in progress, we discuss independence and interpolation and related topics for classical, modal, and non-monotonic logics

Cumulativity without closure of the domain under finite unions

For nonmonotonic logics, Cumulativity is an important rule. We show here that Cumulativity fans out into an infinity of different conditions, if the domain is not closed under finite unions

A New Order of Things: Network Mechanisms of Field Evolution in the Aftermath of an Exogenous Shock

This study examines the role of a major environmental shock in triggering change in the social structure of an organizational field. Based on the longitudinal analysis of changing network configurations in the global airline industry, we explore how logics of attachment shift before, during and after an exogenous shock and how the rewiring of network ties in response to the shock may act as a countervailing force to the network dynamics that drive field stratification. Using the terrorist attacks of September 11, 2001 as a natural experiment, our work reveals how shocks may affect key mechanisms of network evolution thus altering tie distribution and access among members of the field. Overall this article contributes to emergent literature on field dynamics by exposing the evolution of interorganizational dynamics when external events produce unsettled times that render extant logics brittle and open prospects for change

Paracomplete logic Kl: natural deduction, its automation, complexity and applications

In the development of many modern software solutions where the underlying systems are complex, dynamic and heterogeneous, the significance of specification-based verification is well accepted. However, often parts of the specification may not be known. Yet reasoning based on such incomplete specifications is very desirable. Here, paracomplete logics seem to be an appropriate formal setup: opposite to Tarski’s theory of truth with its principle of bivalence, in these logics a statement and its negation may be both untrue. An immediate result is that the law of excluded middle becomes invalid. In this paper we show a way to apply an automatic proof searching procedure for the paracomplete logic Kl to reason about incomplete information systems. We provide an original account of complexity of natural deduction systems, leading us closer to the efficiency of the presented proof search algorithm. Moreover, we have turned the assumptions management into an advantage showing the applicability of the proposed technique to assume-guarantee reasoning

On Properties of Update Sequences Based on Causal Rejection

We consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under answer set semantics. New information is incorporated into the current knowledge base subject to a causal rejection principle enforcing that, in case of conflicts, more recent rules are preferred and older rules are overridden. Such a rejection principle is also exploited in other approaches to update logic programs, e.g., in dynamic logic programming by Alferes et al. We give a thorough analysis of properties of our approach, to get a better understanding of the causal rejection principle. We review postulates for update and revision operators from the area of theory change and nonmonotonic reasoning, and some new properties are considered as well. We then consider refinements of our semantics which incorporate a notion of minimality of change. As well, we investigate the relationship to other approaches, showing that our approach is semantically equivalent to inheritance programs by Buccafurri et al. and that it coincides with certain classes of dynamic logic programs, for which we provide characterizations in terms of graph conditions. Therefore, most of our results about properties of causal rejection principle apply to these approaches as well. Finally, we deal with computational complexity of our approach, and outline how the update semantics and its refinements can be implemented on top of existing logic programming engines.Comment: 59 pages, 2 figures, 3 tables, to be published in "Theory and Practice of Logic Programming