Mexitl: Multimedia in Executable Interval Temporal Logic

This paper explores a formalism for describing a wide class of multimedia document constraints, based on an interval temporal logic. We describe the requirements that arise from the multimedia documents application area, and we illustrate these requirements using several examples. Then we present the temporal logic formalism that we use. This logic extends existing interval temporal logic with a number of new features: actions, framing of actions, past operators, a projection-like operator called filter and a new handling of interval length. The notation is applied to the specification of the examples, and in particular a set of logical manipulations, providing feedback to an author, is presented. A model theory, logic and satisfaction relation are defined for the notation.     

Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems

There are two main solving schemas for constraint satisfaction and optimization problems: i) search, whose basic step is branching over the values of a variables, and ii) dynamic programming, whose basic step is variable elimination. Variable elimination is time and space exponential in a graph parameter called induced width, which renders the approach infeasible for many problem classes. However, by restricting variable elimination so that only low arity constraints are processed and recorded, it can be effectively combined with search, because the elimination of variables may reduce drastically the search tree size.In this paper we introduce BE-BB(k), a hybrid general algorithm that combines search and variable elimination. The parameter k controls the tradeoff between the two strategies. The algorithm is space exponential in k. Regarding time, we show that its complexity is bounded by k and a structural parameter from the constraint graph. We provide experimental evidence that the hybrid algorithm can outperform state-of-the-art algorithms in constraint satisfaction, Max-CSP and Weighted CSP. Especially in optimization tasks, the advantage of our approach over plain search can be overwhelming.     

Constraint-Based Design of Embedded Intelligent Systems

Substantial progress has been achieved using the standard Constraint Satisfaction Problem framework. However, there is a major unsolved challenge confronting the constraint research community: the constraint-based design of embedded intelligent systems. This requires a new online model of constraint satisfaction and new computational tools for specifying, modeling, verifying and implementing constraint-based, hybrid, intelligent systems, such as robots. The Constraint Net model of Zhang and Mackworth allows the design of hybrid intelligent systems as situated robots: modeling the robot and the environment symmetrically as dynamic systems. If the robot's perceptual and control systems are designed as constraint-satisfying devices then the total robotic system, consisting of the robot symmetrically coupled to the environment, can be proven correct. Some theoretical and practical advances based on this model are described, including experiments with the constraint-based design of robot soccer players.     

Applying Plan Recognition Algorithms To Program Understanding

Program understanding is often viewed as the task of extracting plans and design goals from program source. As such, it is natural to try to apply standard AI plan recognition techniques to the program understanding problem. Yet program understanding researchers have quietly, but consistently, avoided the use of these plan recognition algorithms. This paper shows that treating program understanding as plan recognition is too simplistic and that traditional AI search algorithms for plan recognition are not suitable, as is, for program understanding. In particular, we show (1) that the program understanding task differs significantly from the typical general plan recognition task along several key dimensions, (2) that the program understanding task has particular properties that make it particularly amenable to constraint satisfaction techniques, and (3) that augmenting AI plan recognition algorithms with these techniques can lead to effective solutions for the program understanding problem.     

A fuzzy constraint satisfaction approach for electronic shopping assistance

The Internet and World Wide Web offer an additional channel for consumers to find, select, and buy products. However, unlike shopping in the traditional store, consumers have no direct contact with human clerks to get the required information in the electronic store. The objective of this paper is to propose a fuzzy constraint satisfaction approach to help buyers find fully satisfactory or replacement products in electronic shopping. For the buyer who can give precise product requirements, the proposed approach can generate product-ranking lists based on the satisfaction degrees of each product to the given requirements. For the buyer who may not input accurate requirements, a similarity analysis approach is proposed to assess buyer requirements automatically during his browsing process. The proposed approach could help buyers find the preferred products on the top of the ranking list without further searching the remaining pages. The experimental results show the applicability of the proposed approach for electronic shopping assistance.     

Forgiveness and Conflict Resolution in Marriage.

Two studies examined whether forgiveness in married couples is associated with better conflict resolution. Study 1 examined couples in their 3rd year of marriage and identified 2 forgiveness dimensions (retaliation and benevolence). Husbands' retaliatory motivation was a significant predictor of poorer wife-reported conflict resolution, whereas wives' benevolence motivation predicted husbands' reports of better conflict resolution. Examining longer term marriages, Study 2 identified three forgiveness dimensions (retaliation, avoidance and benevolence). Whereas wives' benevolence again predicted better conflict resolution, husbands' avoidance predicted wives' reports of poorer conflict resolution. All findings were independent of both spouses' marital satisfaction. The findings are discussed in terms of the importance of forgiveness for marital conflict and its implications for spouse goals. Future research directions on forgiveness are outlined. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

The Influence of Prior Commitment on the Reactions of Layoff Survivors to Organizational Downsizing.

Nurses (N := 179; Study 1) and managers (N = 154; Study 2) participated in 2 panel studies examining the relationship among prior commitment (affective and continuance commitment and perceived organizational support), coping strategies, and survivors' attitudes and perceptions during and following downsizing. In Study 1, perceived organizational support was significantly positively related to control-oriented coping, job satisfaction, and intention to remain and negatively related to perceived job insecurity and burnout 2 years later. In Study 2, coping mediated the relationship between the prior commitment variables and job alienation, health symptoms, and burnout following the downsizing. Control-oriented coping was associated with elevated levels of health symptoms and burnout following the downsizing, suggesting that control-oriented coping may have positive effects in the short term but potentially harmful effects in the long term. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Competency-Based Behavior Consultation Training: An Evaluation of Consultant Outcomes, Treatment Effects, and Consumer Satisfaction.

Assessments of consultants, clients, and consumer satisfaction were used to examine the effects of a competency-based consultation training program conducted over 4 years. Using a multiple-baseline framework to assess training effects on consultants and single-case study designs to evaluate changes in client behavior, a number of significant results were found. As predicted, consultants (N=24) significantly increased their consultation skills and knowledge, but with no change in attitudes toward behavioral intervention techniques. Supervised consultation with preschool teachers and parents resulted in a range of behavior change in clients (N=39), with an overall effect size of 0.51. Consumers reported a high level of satisfaction with training and consultation services. Results of a long-term follow-up with consultants indicated positive views and use of consultation. The discussion focuses on these results, and implications for consultation training and future research directions. (PsycINFO Database Record (c) 2011 APA, all rights reserved)     

Constraint Lingo: towards high‐level constraint programming

Logic programming requires that the programmer convert a problem into a set of constraints based on predicates. Choosing the predicates and introducing appropriate constraints can be intricate and error prone. If the problem domain is structured enough, we can let the programmer express the problem in terms of more abstract, higher‐level constraints. A compiler can then convert the higher‐level program into a logic‐programming formalism. The compiler writer can experiment with alternative low‐level representations of the higher‐level constraints in order to achieve a high‐quality translation. The programmer can then take advantage of both a reduction in complexity and an improvement in runtime speed for all problems within the domain. We apply this analysis to the domain of tabular constraint‐satisfaction problems. Examples of such problems include logic puzzles solvable on a hatch grid and combinatorial problems such as graph coloring and independent sets. The proper abstractions for these problems are rows, columns, entries, and their interactions. We present a higher‐level language, Constraint Lingo, dedicated to problems in this domain. We also describe how we translate programs from Constraint Lingo into lower‐level logic formalisms such as the logic of propositional schemata. These translations require that we choose among competing lower‐level representations in order to produce efficient results. The overall effectiveness of our approach depends on the appropriateness of Constraint Lingo, our ability to translate Constraint Lingo programs into high‐quality representations in logic formalisms, and the efficiency with which logic engines can compute answer sets. We comment on our computational experience with these tools in solving both graph problems and logic puzzles. Copyright © 2004 John Wiley & Sons, Ltd.     

A Multicultural Test of the Theory of Work Adjustment: Investigating the Role of Heterosexism and Fit Perceptions in the Job Satisfaction of Lesbian, Gay, and Bisexual Employees.

Two expanded models (i.e., mediated and moderated) of the theory of work adjustment (TWA; R. V. Dawis, G. England, & L. H. Lofquist, 1964; R. V. Dawis & L. H. Lofquist, 1984) were tested for their capacity to explain the job satisfaction of a sample of lesbian, gay, and bisexual employees (N=397). Consistent with cultural critiques of the TWA, person-organization fit perceptions were tested as the mediator of the relationship between heterosexism and job satisfaction in one set of hypotheses, and experiences with informal heterosexism were tested as a moderator in the relationship between person-organization fit perceptions and job satisfaction in a separate set of hypotheses. The mediated model but not the moderated model was supported. Results were confirmed by a cross-validation sample. (PsycINFO Database Record (c) 2010 APA, all rights reserved)