'All Good Things Must Come to an End': Terminating Co-Ownership Under the 'Old' Partition and Sale Rules

Despite its benefits, co-ownership of land creates problems where relations between the parties
have soured, or one person simply wants to extricate themselves from this arrangement. The
remedies of compulsory partition and sale allow one joint tenant or tenant in common to terminate
co-ownership against the wishes of the others, by seeking a court order to this effect. Throughout
parts of the common law world, this has be en based on nineteenth century English legislation namely
the Partition Act 1868, the key elements of which remain in force in Western Australia,
South Australia, Tasmania and the Australian Capital Territory. This article provides an up-to-date
analysis of the law on compulsory partition and sale as derived from the 1868 Act and analogous
provisions, drawing not only on Australian cases, but on frequently overlooked decisions from
courts in both parts of Ireland and in parts of Canada, as well as ‘old’ English judgments on the
1868 Act.

A Probe-Goal Approach to Agreement and Incorporation Restrictions in Southern Tiwa

Southern Tiwa (Tanoan) exhibits agreement with up to three arguments (ergative, absolutive, dative). This agreement is subject to certain restrictions resembling the Person-Case Constraint paradigm (Bonet 1991). Moreover, there is a correlation between agreement restrictions and conditions on (the obviation of) noun-incorporation in Southern Tiwa, as explicitly and elegantly captured by Rosen (1990) in terms of a heterogeneous feature hierarchy and rules of association. We attempt to recast Rosen’s central insights in terms of Anagnostopoulou’s probe-sharing model of Person-Case Constraint effects (Anagnostopoulou 2003, 2006), to show that the full range of Southern Tiwa agreement and (non-)incorporation restrictions can be given a single, unified analysis within the probe-goal-Agree framework of Chomsky (2001). In particular, we argue that Southern Tiwa’s triple-agreement system is characterized by (a) an independent class probe located on the heads T and v, and (b) a rule that allows this class probe to be deleted in the context of local-person T-agreement. The various restrictions on agreement and non-incorporation then reduce to a single source: failure of class-valuation with DP (as opposed to NP) arguments.

Towards optimal clinical and epidemiological registration of haematological malignancies: Guidelines for recording progressions, transformations and multiple diagnoses

Haematological malignancies (HM) represent over 6% of the total cancer incidence in Europe and affect all ages, ranging between 45% of all cancers in children and 7% in the elderly. Thirty per cent of childhood cancer deaths are due to HM, 8% in the elderly. Their registration presents specific challenges, mainly because HM may transform or progress in the course of the disease into other types of HM. In the context of cancer registration decisions have to be made about classifying subsequent notifications on the same patient as the same tumour (progression), a transformation or a new tumour registration. Allocation of incidence date and method of diagnosis must also be standardised. We developed European Network of Cancer Registries (ENCR) recommendations providing specific advice for cancer registries to use haematology and molecular laboratories as data sources, conserve the original date of incidence in case of change of diagnosis, make provision for recording both the original as well as transformed tumour and to apply precise rules for recording and counting multiple diagnoses. A reference table advising on codes which reflect a potential transformation or a new tumour is included. This work will help to improve comparability of data produced by population-based cancer registries, which are indispensable for aetiological research, health care planning and clinical research, an increasing important area with the application of targeted therapies.

An Update of the Rules for Pyranoside Sulfonate Displacement

The original 1967 Richardson–Hough rules for predicting SN2 displacement viability in carbohydrate sulfonate derivatives with external nucleophiles have now been updated. Not only do the original rules still hold, but the newly updated rules rationalize why O-triflates (trifluoromethanesulfonate esters) frequently allow many seemingly “disallowed” pyranosidic nucleophilic substitutions to proceed. The new guidelines, which are based on three decades of experimental evidence, allow the feasibility of many pyranosidic O-triflate SN2 displacements to be gauged beforehand.

Rules and Stereoelectronic Guidelines for the Anionic Nucleophilic Displacement of Furanoside and Furanose O-sulfonates

Rules for predicting anionic S_N2 displacement viability in furanose and furanoside sulfonates are presented

Revision rules in the theory of evidence

Combination rules proposed so far in the Dempster-Shafer theory of evidence, especially Dempster rule, rely on a basic assumption, that is, pieces of evidence being combined are considered to be on a par, i.e. play the same role. When a source of evidence is less reliable than another, it is possible to discount it and then a symmetric combination operation is still used. In the case of revision, the idea is to let prior knowledge of an agent be altered by some input information. The change problem is thus intrinsically asymmetric. Assuming the input information is reliable, it should be retained whilst the prior information should
be changed minimally to that effect. Although belief revision is already an important subfield of artificial intelligence, so far, it has been little addressed in evidence theory. In this paper, we define the notion of revision for the theory of evidence and propose several different revision rules, called the inner and outer
revisions, and a modified adaptive outer revision, which better corresponds to the idea of revision. Properties of these revision rules are also investigated.

Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions

Although Answer Set Programming (ASP) is a powerful framework for declarative problem solving, it cannot in an intuitive way handle situations in which some rules are uncertain, or in which it is more important to satisfy some constraints than others. Possibilistic ASP (PASP) is a natural extension of ASP in which certainty weights are associated with each rule. In this paper we contrast two different views on interpreting the weights attached to rules. Under the first view, weights reflect the certainty with which we can conclude the head of a rule when its body is satisfied. Under the second view, weights reflect the certainty that a given rule restricts the considered epistemic states of an agent in a valid way, i.e. it is the certainty that the rule itself is correct. The first view gives rise to a set of weighted answer sets, whereas the second view gives rise to a weighted set of classical answer sets.

Interpretable and Reconfigurable Clustering of Document Datasets by Deriving Word-based Rules

Clusters of text documents output by clustering algorithms are often hard to interpret. We describe motivating real-world scenarios that necessitate reconfigurability and high interpretability of clusters and outline the problem of generating clusterings with interpretable and reconfigurable cluster models. We develop two clustering algorithms toward the outlined goal of building interpretable and reconfigurable cluster models. They generate clusters with associated rules that are composed of conditions on word occurrences or nonoccurrences. The proposed approaches vary in the complexity of the format of the rules; RGC employs disjunctions and conjunctions in rule generation whereas RGC-D rules are simple disjunctions of conditions signifying presence of various words. In both the cases, each cluster is comprised of precisely the set of documents that satisfy the corresponding rule. Rules of the latter kind are easy to interpret, whereas the former leads to more accurate clustering. We show that our approaches outperform the unsupervised decision tree approach for rule-generating clustering and also an approach we provide for generating interpretable models for general clusterings, both by significant margins. We empirically show that the purity and f-measure losses to achieve interpretability can be as little as 3 and 5%, respectively using the algorithms presented herein.

Answer set programs with optional rules: a possibilistic approach

Many problems in artificial intelligence can be encoded as answer set programs (ASP) in which some rules are uncertain. ASP programs with incorrect rules may have erroneous conclusions, but due to the non-monotonic nature of ASP, omitting a correct rule may also lead to errors. To derive the most certain conclusions from an uncertain ASP program, we thus need to consider all situations in which some, none, or all of the least certain rules are omitted. This corresponds to treating some rules as optional and reasoning about which conclusions remain valid regardless of the inclusion of these optional rules. While a version of possibilistic ASP (PASP) based on this view has recently been introduced, no implementation is currently available. In this paper we propose a simulation of the main reasoning tasks in PASP using (disjunctive) ASP programs, allowing us to take advantage of state-of-the-art ASP solvers. Furthermore, we identify how several interesting AI problems can be naturally seen as special cases of the considered reasoning tasks, including cautious abductive reasoning and conformant planning. As such, the proposed simulation enables us to solve instances of the latter problem types that are more general than what current solvers can handle.