Vetting Sexual Offenders: State Over-extension, the Punishment Deficit and the Failure to Manage Risk

This article examines the state regulation of sexual offenders in the particular context of pre-employment vetting. A successive range of statutory frameworks have been put in place, culminating in the Safeguarding Vulnerable Groups Act 2006, to prevent unsuitable individuals from working with the vulnerable, and children in particular. Contemporary legislative and policy developments are set against a backdrop of broader concerns in the area of crime and justice, namely risk regulation, preventative governance and ‘precautionary logic.’ Proponents of these approaches have largely ignored concerns over their feasibility. This article specifically addresses this fissure within the specific field of vetting. It is argued that ‘hyper innovation’ and state over-extension in this area are particularly problematic and have resulted in exceptionally uncertain and unsafe policies. These difficulties relate principally to unrealistic public expectations about the state’s ability to control crime; unintended and ambiguous policy effects; and ultimately the failure of the state to deliver on its self-imposed regulatory mandate to effectively manage risk.

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.

Characterizing and Extending Answer Set Semantics using Possibility Theory

Answer Set Programming (ASP) is a popular framework for modelling combinatorial problems. However, ASP cannot be used easily for reasoning about uncertain information. Possibilistic ASP (PASP) is an extension of ASP that combines possibilistic logic and ASP. In PASP a weight is associated with each rule, whereas this weight is interpreted as the certainty with which the conclusion can be established when the body is known to hold. As such, it allows us to model and reason about uncertain information in an intuitive way. In this paper we present new semantics for PASP in which rules are interpreted as constraints on possibility distributions. Special models of these constraints are then identified as possibilistic answer sets. In addition, since ASP is a special case of PASP in which all the rules are entirely certain, we obtain a new characterization of ASP in terms of constraints on possibility distributions. This allows us to uncover a new form of disjunction, called weak disjunction, that has not been previously considered in the literature. In addition to introducing and motivating the semantics of weak disjunction, we also pinpoint its computational complexity. In particular, while the complexity of most reasoning tasks coincides with standard disjunctive ASP, we find that brave reasoning for programs with weak disjunctions is easier.

Possibilistic Answer Set Programming Revisited

Possibilistic answer set programming (PASP) extends answer set programming (ASP) by attaching to each rule a degree of certainty. While such an extension is important from an application point of view, existing semantics are not well-motivated, and do not always yield intuitive results. To develop a more suitable semantics, we first introduce a characterization of answer sets of classical ASP programs in terms of possibilistic logic where an ASP program specifies a set of constraints on possibility distributions. This characterization is then naturally generalized to define answer sets of PASP programs. We furthermore provide a syntactic counterpart, leading to a possibilistic generalization of the well-known Gelfond-Lifschitz reduct, and we show how our framework can readily be implemented using standard ASP solvers.

Towards Possibilistic Fuzzy Answer Set Programming

Fuzzy answer set programming (FASP) is a generalization of answer set programming to continuous domains. As it can not readily take uncertainty into account, however, FASP is not suitable as a basis for approximate reasoning and cannot easily be used to derive conclusions from imprecise information. To cope with this, we propose an extension of FASP based on possibility theory. The resulting framework allows us to reason about uncertain information in continuous domains, and thus also about information that is imprecise or vague. We propose a syntactic procedure, based on an immediate consequence operator, and provide a characterization in terms of minimal models, which allows us to straightforwardly implement our framework using existing FASP solvers.

Glycosylation of Vitamin D Binding Protein Reduced in Juvenile Idiopathic Arthritis Patients At Risk of Disease Extension.

Background/Purpose:Juvenile idiopathic arthritis (JIA) comprises a poorly understood group of chronic, childhood onset, autoimmune diseases with variable clinical outcomes. We investigated whether profiling of the synovial fluid (SF) proteome by a fluorescent dye based, two-dimensional gel (DIGE) approach could distinguish the subset of patients in whom inflammation extends to affect a large number of joints, early in the disease process. The post-translational modifications to candidate protein markers were verified by a novel deglycosylation strategy.Methods:SF samples from 57 patients were obtained around time of initial diagnosis of JIA. At 1 year from inclusion patients were categorized according to ILAR criteria as oligoarticular arthritis (n=26), extended oligoarticular (n=8) and polyarticular disease (n=18). SF samples were labeled with Cy dyes and separated by two-dimensional electrophoresis. Multivariate analyses were used to isolate a panel of proteins which distinguish patient subgroups. Proteins were identified using MALDI-TOF mass spectrometry with vitamin D binding protein (VDBP) expression and siaylation further verified by immunohistochemistry, ELISA test and immunoprecipitation. Candidate biomarkers were compared to conventional inflammation measure C-reactive protein (CRP). Sialic acid residues were enzymatically cleaved from immunopurified SF VDBP, enriched by hydrophilic interaction liquid chromatography (HILIC) and analysed by mass spectrometry.Results:Hierarchical clustering based on the expression levels of a set of 23 proteins segregated the extended-to-be oligoarticular from the oligoarticular patients. A cleaved isoform of VDBP, spot 873, is present at significantly reduced levels in the SF of oligoarticular patients at risk of disease extension, relative to other subgroups (p<0.05). Conversely total levels of vitamin D binding protein are elevated in plasma and ROC curves indicate an improved diagnostic sensitivity to detect patients at risk of disease extension, over both spot 873 and CRP levels. Sialysed forms of intact immunopurified VDBP were more prevalent in persistent oligoarticular patient synovial fluids.Conclusion:The data indicate that a subset of the synovial fluid proteome may be used to stratify patients to determine risk of disease extension. Reduced conversion of VDBP to a macrophage activation factor may represent a novel pathway contributing to increased risk of disease extension in JIA patients.