Width and serialization of classical planning problems

We introduce a width parameter that bounds the complexity of classical planning problems and domains, along with a simple but effective blind-search procedure that runs in time that is exponential in the problem width. We show that many benchmark domains have a bounded and small width provided thatgoals are restricted to single atoms, and hence that such problems are provably solvable in low polynomial time. We then focus on the practical value of these ideas over the existing benchmarks which feature conjunctive goals. We show that the blind-search procedure can be used for both serializing the goal into subgoals and for solving the resulting problems, resulting in a ‘blind’ planner that competes well with a best-first search planner guided by state-of-the-art heuristics. In addition, ideas like helpful actions and landmarks can be integrated as well, producing a planner with state-of-the-art performance.

SAT Modulo Linear Arithmetic for Solving Polynomial

Polynomial constraint solving plays a prominent role in several areas of hardware and software analysis and verification, e.g., termination proving, program invariant generation and hybrid system verification, to name a few. In this paper we propose a new method for solving non-linear constraints based on encoding the problem into an SMT problem considering only linear arithmetic. Unlike other existing methods, our method focuses on proving satisfiability of the constraints rather than on proving unsatisfiability, which is more relevant in several applications as we illustrate with several examples. Nevertheless, we also present new techniques based on the analysis of unsatisfiable cores that allow one to efficiently prove unsatisfiability too for a broad class of problems. The power of our approach is demonstrated by means of extensive experiments comparing our prototype with state-of-the-art tools on benchmarks taken both from the academic and the industrial world.

Generating highly balanced sudoku problems as hard problems

Sudoku problems are some of the most known and enjoyed pastimes, with a never diminishing popularity, but, for the last few years those problems have gone from an entertainment to an interesting research area, a twofold interesting area, in fact. On the one side Sudoku problems, being a variant of Gerechte Designs and Latin Squares, are being actively used for experimental design, as in [8, 44, 39, 9]. On the other hand, Sudoku problems, as simple as they seem, are really hard structured combinatorial search problems, and thanks to their characteristics and behavior, they can be used as benchmark problems for refining and testing solving algorithms and approaches. Also, thanks to their high inner structure, their study can contribute more than studies of random problems to our goal of solving real-world problems and applications and understanding problem characteristics that make them hard to solve. In this work we use two techniques for solving and modeling Sudoku problems, namely, Constraint Satisfaction Problem (CSP) and Satisfiability Problem (SAT) approaches. To this effect we define the Generalized Sudoku Problem (GSP), where regions can be of rectangular shape, problems can be of any order, and solution existence is not guaranteed. With respect to the worst-case complexity, we prove that GSP with block regions of m rows and n columns with m = n is NP-complete. For studying the empirical hardness of GSP, we define a series of instance generators, that differ in the balancing level they guarantee between the constraints of the problem, by finely controlling how the holes are distributed in the cells of the GSP. Experimentally, we show that the more balanced are the constraints, the higher the complexity of solving the GSP instances, and that GSP is harder than the Quasigroup Completion Problem (QCP), a problem generalized by GSP. Finally, we provide a study of the correlation between backbone variables – variables with the same value in all the solutions of an instance– and hardness of GSP.

Statistical modelling of CSP solving algorithms performance

The goal of this work is to try to create a statistical model, based only on easily computable parameters from the CSP problem to predict runtime behaviour of the solving algorithms, and let us choose the best algorithm to solve the problem. Although it seems that the obvious choice should be MAC, experimental results obtained so far show, that with big numbers of variables, other algorithms perfom much better, specially for hard problems in the transition phase.

Problems of the randomization test for AB designs

N = 1 designs imply repeated registrations of the behaviour of the same experimental unit and the measurements obtained are often few due to time limitations, while they are also likely to be sequentially dependent. The analytical techniques needed to enhance statistical and clinical decision making have to deal with these problems. Different procedures for analysing data from single-case AB designs are discussed, presenting their main features and revising the results reported by previous studies. Randomization tests represent one of the statistical methods that seemed to perform well in terms of controlling false alarm rates. In the experimental part of the study a new simulation approach is used to test the performance of randomization tests and the results suggest that the technique is not always robust against the violation of the independence assumption. Moreover, sensitivity proved to be generally unacceptably low for series lengths equal to 30 and 40. Considering the evidence available, there does not seem to be an optimal technique for single-case data analysis

Assessing positive mental health in people with chronic physical health problems: correlations with socio-demographic variables and physical health status

Background: A holistic perspective on health implies giving careful consideration to the relationship between physical and mental health. In this regard the present study sought to determine the level of Positive Mental Health (PMH) among people with chronic physical health problems, and to examine the relationship between the observed levels of PMH and both physical health status and socio-demographic variables. Methods: The study was based on the Multifactor Model of Positive Mental Health (Lluch, 1999), which comprises six factors: Personal Satisfaction (F1), Prosocial Attitude (F2), Self-control (F3), Autonomy (F4), Problem-solving and Self-actualization (F5), and Interpersonal Relationship Skills (F6). The sample comprised 259 adults with chronic physical health problems who were recruited through a primary care center in the province of Barcelona (Spain). Positive mental health was assessed by means of the Positive Mental Health Questionnaire (Lluch, 1999). Results: Levels of PMH differed, either on the global scale or on specific factors, in relation to the following variables: age: global PMH scores decreased with age (r=-0.129; p=0.038); b) gender: men scored higher on F1 (t=2.203; p=0.028) and F4 (t=3.182; p=0.002), while women scored higher on F2 (t -3.086; p=0.002) and F6 (t=-2.744; p=0.007); c) number of health conditions: the fewer the number of health problems the higher the PMH score on F5 (r=-0.146; p=0.019); d) daily medication: polymedication patients had lower PMH scores, both globally and on various factors; e) use of analgesics: occasional use of painkillers was associated with higher PMH scores on F1 (t=-2.811; p=0.006). There were no significant differences in global PMH scores according to the type of chronic health condition. The only significant difference in the analysis by factors was that patients with hypertension obtained lower PMH scores on the factor Autonomy (t=2.165; p=0.032). Conclusions: Most people with chronic physical health problems have medium or high levels of PMH. The variables that adversely affect PMH are old age, polypharmacy and frequent consumption of analgesics. The type of health problem does not influence the levels of PMH. Much more extensive studies with samples without chronic pathology are now required in order to be able to draw more robust conclusions.

Audit firm tenure and qualified opinions: New evidence from Spain

The 2010 Green Paper on Audit Policy by the European Commission has explicitly questioned the sufficiency of audit rotation rules established by European Union Members to guarantee auditor independence. In addition, the Paper clearly states that more research is needed regarding the effects of long audit tenures on independence. In this article, we have replicated the research by Ruiz-Barbadillo, Gómez-Aguilar, and Biedma (2005) about the effects of audit firm tenure on independence with more updated data. However, unlike them, we have performed panel data estimations instead of pooled regression. Our approach allows for a better control of individual unobserved heterogeneity, thus reducing potential problems caused by omitted variable bias. While Ruiz-Barbadillo et al. reported an unexpected positive effect of tenure on the likelihood of audit qualifications, we do not show any significant effect of tenure on the opinion of the audit report. Our results are robust to various sensitivity analyses.

¿Para qué sirven los problemas en la clase de matemáticas? = What is the use of problems in Mathematics lessons?

The results obtained in several yield tests, at an international level (mainly the famous PISA 2003 report, by the OCDE), have raised a multiplicity of performances in order to improve the students' yield regarding problem solving. In this article we set a clear guideline on how problems should be used in Mathematics lessons, not for obtaining better scores in the yield tests but for improving the development of Mathematical thinking in students. From this perspective, the author analyses, through eight reflections, how the concept of problem, transmitted both in the school and from society, influences the students