Parameterized complexity of abduction in Schaefer’s framework

Journal of Logic and Computation ◽

10.1093/logcom/exaa079 ◽

2020 ◽

Author(s):

Yasir Mahmood ◽

Arne Meier ◽

Johannes Schmidt

Keyword(s):

Constraint Satisfaction ◽

Parameterized Complexity ◽

Algebraic Approach ◽

Abductive Reasoning ◽

Fine Grained ◽

Theory Of Computing ◽

Reasoning Problem ◽

Dimensional Classification ◽

Complexity Classification

Abstract Abductive reasoning is a non-monotonic formalism stemming from the work of Peirce. It describes the process of deriving the most plausible explanations of known facts. Considering the positive version, asking for sets of variables as explanations, we study, besides the problem of wether there exists a set of explanations, two explanation size limited variants of this reasoning problem (less than or equal to, and equal to a given size bound). In this paper, we present a thorough two-dimensional classification of these problems: the first dimension is regarding the parameterized complexity under a wealth of different parameterizations, and the second dimension spans through all possible Boolean fragments of these problems in Schaefer’s constraint satisfaction framework with co-clones (T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1–3, 1978, San Diego, California, USA, R.J. Lipton, W.A. Burkhard, W.J. Savitch, E.P. Friedman, A.V. Aho eds, pp. 216–226. ACM, 1978). Thereby, we almost complete the parameterized complexity classification program initiated by Fellows et al. (The parameterized complexity of abduction. In Proceedings of the Twenty-Sixth AAAI Conference on Articial Intelligence, July 22–26, 2012, Toronto, Ontario, Canada, J. Homann, B. Selman eds. AAAI Press, 2012), partially building on the results by Nordh and Zanuttini (What makes propositional abduction tractable. Artificial Intelligence, 172, 1245–1284, 2008). In this process, we outline a fine-grained analysis of the inherent parameterized intractability of these problems and pinpoint their FPT parts. As the standard algebraic approach is not applicable to our problems, we develop an alternative method that makes the algebraic tools partially available again.

Download Full-text

Diagnoses, Dimensions, and DSM-5

The Oxford Handbook of Clinical Psychology ◽

10.1093/oxfordhb/9780195366884.013.0013 ◽

2010 ◽

pp. 254-279

Author(s):

Thomas A. Widiger ◽

Maryanne Edmundson

Keyword(s):

Substance Use ◽

Mental Disorders ◽

Paradigm Shift ◽

Empirical Support ◽

Statistical Manual ◽

Diagnostic And Statistical Manual ◽

Dsm 5 ◽

Dimensional Classification ◽

Diagnosis And Classification

The Diagnostic and Statistical Manual of Mental Disorders, Third Edition (DSM-III) is often said to have provided a significant paradigm shift in how psychopathology is diagnosed. The authors of DSM-5 have the empirical support and the opportunity to lead the field of psychiatry to a comparably bold new future in diagnosis and classification. The purpose of this chapter is to address the validity of the categorical and dimensional models for the classification and diagnosis of psychopathology. Considered in particular will be research concerning substance use disorders, mood disorders, and personality disorders. Limitations and concerns with respect to a dimensional classification of psychopathology are also considered. The chapter concludes with a recommendation for a conversion to a more quantitative, dimensional classification of psychopathology.

Download Full-text

Towards a contemporary approach for understanding personality pathology in developmental context: An integrative model

Development and Psychopathology ◽

10.1017/s0954579421000869 ◽

2021 ◽

pp. 1-10

Author(s):

Melody R. Altschuler ◽

Robert F. Krueger

Keyword(s):

Personality Disorders ◽

Personality Pathology ◽

Integrative Model ◽

Research Domain Criteria ◽

Developmental Context ◽

Dimensional Classification ◽

Developmental Theories ◽

Underlying Mechanisms ◽

Research Domain

Abstract Traditional categorical approaches to classifying personality disorders are limited in important ways, leading to a shift in the field to dimensional approaches to conceptualizing personality pathology. Different areas of psychology – personality, developmental, and psychopathology – can be leveraged to understand personality pathology by examining its structure, development, and underlying mechanisms. However, an integrative model that encompasses these distinct lines of inquiry has not yet been proposed. In order to address this gap, we review the latest evidence for dimensional classification of personality disorders based on structural models of maladaptive personality traits, provide an overview of developmental theories of pathological personality, and summarize the Research Domain Criteria (RDoC) initiative, which seeks to understand underlying mechanisms of psychopathology. We conclude by proposing an integrative model of personality pathology development that aims to elucidate the developmental pathways of personality pathology and its underlying mechanisms.

Download Full-text

A Machine Vision Approach for Bioreactor Foam Sensing

SLAS TECHNOLOGY Translating Life Sciences Innovation ◽

10.1177/24726303211008861 ◽

2021 ◽

pp. 247263032110088

Author(s):

Jonas Austerjost ◽

Robert Söldner ◽

Christoffer Edlund ◽

Johan Trygg ◽

David Pollard ◽

...

Keyword(s):

Machine Learning ◽

Machine Vision ◽

State Of The Art ◽

Low Cost ◽

High Accuracy ◽

Consumer Electronics ◽

Learning System ◽

Automotive Applications ◽

Fine Grained

Machine vision is a powerful technology that has become increasingly popular and accurate during the last decade due to rapid advances in the field of machine learning. The majority of machine vision applications are currently found in consumer electronics, automotive applications, and quality control, yet the potential for bioprocessing applications is tremendous. For instance, detecting and controlling foam emergence is important for all upstream bioprocesses, but the lack of robust foam sensing often leads to batch failures from foam-outs or overaddition of antifoam agents. Here, we report a new low-cost, flexible, and reliable foam sensor concept for bioreactor applications. The concept applies convolutional neural networks (CNNs), a state-of-the-art machine learning system for image processing. The implemented method shows high accuracy for both binary foam detection (foam/no foam) and fine-grained classification of foam levels.

Download Full-text

Datives with psych nouns and adjectives in Basque

Folia Linguistica ◽

10.1515/flin-2020-2050 ◽

2020 ◽

Vol 54 (3) ◽

pp. 647-696

Author(s):

Beatriz Fernández ◽

Fernando Zúñiga ◽

Ane Berro

Keyword(s):

Natural Language ◽

Linguistic Theory ◽

Psychological State ◽

Formal Expression ◽

Fine Grained ◽

Psych Verbs ◽

Other Regarding ◽

Psychological Verbs

Abstract This paper explores the formal expression of two Basque dative argument types in combination with psych nouns and adjectives, in intransitive and transitive clauses: (i) those that express the experiencer, and (ii) those that express the stimulus of the psychological state denoted by the psych noun and adjective. In the intransitive structure involving a dative experiencer (DatExpIS), the stimulus is in the absolutive case, and the intransitive copula izan ‘be’ shows both dative and absolutive agreement. This construction basically corresponds to those built upon the piacere type of psychological verbs typified in (Belletti, Adriana & Luigi Rizzi. 1988. Psych-verbs and θ-theory. Natural Language and Linguistic Theory 6. 291–352) three-way classification of Italian psych verbs. In the intransitive structure involving a dative stimulus (DatStimIS), the experiencer is marked by absolutive case, and the same intransitive copula shows both absolutive and dative agreement (with the latter corresponding to the dative stimulus and not to the experiencer). We show that the behavior of the dative argument in the two constructions is just the opposite of each other regarding a number of morphosyntactic tests, including agreement, constituency, hierarchy and selection. Additionally, we explore two parallel transitive constructions that involve either a dative experiencer and an ergative stimulus (DatExpTS) or a dative stimulus and an ergative experiencer (DatStimTS), which employ the transitive copula *edun ‘have’. Considering these configurations, we propose an extended and more fine-grained typology of psych predicates.

Download Full-text

UV Spectral Classification of B Stars

Symposium - International Astronomical Union ◽

10.1017/s0074180900079092 ◽

1985 ◽

Vol 111 ◽

pp. 411-413

Author(s):

Janet Rountree ◽

George Sonneborn ◽

Robert J. Panek

Keyword(s):

Classification System ◽

Classification Criteria ◽

High Dispersion ◽

Spectral Classification ◽

Early Type ◽

B Stars ◽

Dimensional Classification ◽

Early Type Stars ◽

Comprehensive Classification

Previous studies of ultraviolet spectral classification have been insufficient to establish a comprehensive classification system for ultraviolet spectra of early-type stars because of inadequate spectral resolution. We have initiated a new study of ultraviolet spectral classification of B stars using high-dispersion IUE archival data. High-dispersion SWP spectra of MK standards and other B stars are retrieved from the IUE archives and numerically degraded to a uniform resolution of 0.25 or 0.50 Å. The spectra (in the form of plots or photowrites) are then visually examined with the aim of setting up a two-dimensional classification matrix. We follow the method used to create the MK classification system for visual spectra. The purpose of this work is to examine the applicability of the MK system (and in particular, the set of standard stars) in the ultraviolet, and to establish classification criteria in this spectral region.

Download Full-text

Prospects for the classification of mental disorders of children and adolescents

European Psychiatry ◽

10.1016/j.eurpsy.2008.07.003 ◽

2008 ◽

Vol 23 (7) ◽

pp. 481-485 ◽

Cited By ~ 1

Author(s):

M.H. Schmidt ◽

J. Sinzig

Keyword(s):

Mental Disorders ◽

Children And Adolescents ◽

Classification Systems ◽

General Question ◽

Specific Information ◽

Specific Symptom ◽

Trade Offs ◽

Dimensional Classification ◽

Dsm V

AbstractSuggestions for classification of mental disorders of children and adolescents in DSM-V and ICD-11 have been made, which differ strongly from the current descriptive approach of dimensional classification.These suggestions even comprise a dichotomized system for health care as well as for scientific purposes.Nevertheless it is obvious that we are far behind an “etiological” classification, so that trade-offs have necessarily to be made in DSM-V and ICD-11.Appropriate proposals concern the strict separation of disorders that are typical for children and adolescents as well as for adults.Furthermore a differentiation of diagnosis for infants, toddlers and preschool children is required in both classification systems. As far as it is relevant for treatment, combined diagnosis in DSM-V and subthreshold diagnosis as well as coding-possibilities for findings in molecular biology should be permitted.As personality disorders should only be diagnosed after the age of 16, it is recommended to dimensionally classify personality traits that are pathognomonic for specific symptom patterns and of prognostic relevance.DSM-V and ICD-11 should allow age-specific information on axis-IV. The article discusses the general question of how relational disorders respectively disturbances should be classified and include furthermore special recommendations concerning ICD and DSM categories.

Download Full-text

A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems

International Journal of Applied Mathematics and Computer Science ◽

10.2478/v10006-011-0058-2 ◽

2011 ◽

Vol 21 (4) ◽

pp. 733-744 ◽

Cited By ~ 1

Author(s):

Marlene Arangú ◽

Miguel Salido

Keyword(s):

Constraint Satisfaction ◽

Constraint Programming ◽

Real Life ◽

Search Space ◽

Constraint Satisfaction Problems ◽

Fine Grained ◽

Arc Consistency ◽

Life Problems ◽

Programming Techniques ◽

Np Complete

A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems Constraint programming is a powerful software technology for solving numerous real-life problems. Many of these problems can be modeled as Constraint Satisfaction Problems (CSPs) and solved using constraint programming techniques. However, solving a CSP is NP-complete so filtering techniques to reduce the search space are still necessary. Arc-consistency algorithms are widely used to prune the search space. The concept of arc-consistency is bidirectional, i.e., it must be ensured in both directions of the constraint (direct and inverse constraints). Two of the most well-known and frequently used arc-consistency algorithms for filtering CSPs are AC3 and AC4. These algorithms repeatedly carry out revisions and require support checks for identifying and deleting all unsupported values from the domains. Nevertheless, many revisions are ineffective, i.e., they cannot delete any value and consume a lot of checks and time. In this paper, we present AC4-OP, an optimized version of AC4 that manages the binary and non-normalized constraints in only one direction, storing the inverse founded supports for their later evaluation. Thus, it reduces the propagation phase avoiding unnecessary or ineffective checking. The use of AC4-OP reduces the number of constraint checks by 50% while pruning the same search space as AC4. The evaluation section shows the improvement of AC4-OP over AC4, AC6 and AC7 in random and non-normalized instances.

Download Full-text