scholarly journals Model enumeration in propositional circumscription via unsatisfiable core analysis

2017 ◽  
Vol 17 (5-6) ◽  
pp. 708-725 ◽  
Author(s):  
MARIO ALVIANO
Keyword(s):  
Empirical Evidence ◽  
Preference Relation ◽  
Core Analysis ◽  
Minimal Models ◽  
Minimal Set ◽  
Practical Applications ◽  
Enumeration Problem ◽  
Admissible Solutions ◽  
Unsatisfiable Core ◽  
Preferred Solutions

AbstractMany practical problems are characterized by a preference relation over admissible solutions, where preferred solutions are minimal in some sense. For example, a preferred diagnosis usually comprises a minimal set of reasons that is sufficient to cause the observed anomaly. Alternatively, a minimal correction subset comprises a minimal set of reasons whose deletion is sufficient to eliminate the observed anomaly. Circumscription formalizes such preference relations by associating propositional theories with minimal models. The resulting enumeration problem is addressed here by means of a new algorithm taking advantage of unsatisfiable core analysis. Empirical evidence of the efficiency of the algorithm is given by comparing the performance of the resulting solver, circumscriptino, with hclasp, camus_mcs, lbx and mcsls on the enumeration of minimal models for problems originating from practical applications.

Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search

2020 ◽  
Vol 176 (3-4) ◽  
pp. 271-297
Author(s):  
Mario Alviano ◽  
Carmine Dodaro
Keyword(s):  
State Of The Art ◽  
Answer Set Programming ◽  
Efficient Algorithms ◽  
Satisfiability Problem ◽  
Core Analysis ◽  
Stable Model ◽  
Maximum Satisfiability ◽  
Model Search ◽  
Unsatisfiable Core ◽  
Stable Models

Many efficient algorithms for the computation of optimum stable models in the context of Answer Set Programming (ASP) are based on unsatisfiable core analysis. Among them, algorithm OLL was the first introduced in the context of ASP, whereas algorithms ONE and PMRES were first introduced for solving the Maximum Satisfiability problem (MaxSAT) and later on adapted to ASP. In this paper, we present the porting to ASP of another state-of-the-art algorithm introduced for MaxSAT, namely K, which generalizes ONE and PMRES. Moreover, we present a new algorithm called OLL-IN-ONE that compactly encodes all aggregates of OLL by taking advantage of shared aggregate sets propagators. The performance of the algorithms have been empirically compared on instances taken from the latest ASP Competition.

What works in the Socratic debate? An analysis of verbal behaviour interaction during cognitive restructuring

2020 ◽  
pp. 1-13
Author(s):  
Rebeca Pardo-Cebrián ◽  
Ana Calero-Elvira ◽  
M. Cristina Guerrero-Escagedo ◽  
Aída López-Gómez
Keyword(s):  
Empirical Evidence ◽  
Cognitive Restructuring ◽  
Verbal Interaction ◽  
Mechanisms Of Change ◽  
Socratic Method ◽  
Observational Methodology ◽  
Practical Applications ◽  
What Works ◽  
Verbal Behaviour ◽  
Socratic Questioning

Abstract Background: Cognitive restructuring is one of the most complex application procedures in psychotherapy. It is widely used by psychologists from different orientations. However, the guidelines on how to apply it do not usually have empirical evidence and there is a lack of knowledge about the mechanisms of change that explain it. Aims: The analysis of verbalizations that therapists emit during the Socratic method could help to better understand the functioning and strategies of effective debates. Method: In this study, specific verbal interaction sequences were analysed using observational methodology. The sample consisted of 113 Socratic questioning fragments belonging to 18 clinical cases, treated by behavioural therapists. Results: Among other findings, it was found that using questioning together with certain previous verbalizations directed the client’s response more effectively and those successful debates were characterized by using the aversive component in a frequent and contingent way. Conclusion: This study shows the most effective way to establish such an interaction in the Socratic method (following a style closer to Ellis’s argumentative debate), which entails relevant practical applications in therapy.

scholarly journals Anytime answer set optimization via unsatisfiable core shrinking

2016 ◽  
Vol 16 (5-6) ◽  
pp. 533-551 ◽  
Author(s):  
MARIO ALVIANO ◽  
CARMINE DODARO
Keyword(s):  
Set Optimization ◽  
Core Analysis ◽  
Logic Programs ◽  
Anytime Algorithm ◽  
Shrinking Process ◽  
The One ◽  
Weak Constraints ◽  
Unsatisfiable Core ◽  
Stable Models ◽  
Answer Set

AbstractUnsatisfiable core analysis can boost the computation of optimum stable models for logic programs with weak constraints. However, current solvers employing unsatisfiable core analysis either run to completion, or provide no suboptimal stable models but the one resulting from the preliminary disjoint cores analysis. This drawback is circumvented here by introducing a progression based shrinking of the analyzed unsatisfiable cores. In fact, suboptimal stable models are possibly found while shrinking unsatisfiable cores, hence resulting into an anytime algorithm. Moreover, as confirmed empirically, unsatisfiable core analysis also benefits from the shrinking process in terms of solved instances.

Modeling Second-Order Expectations

2002 ◽  
Vol 20 (3) ◽  
pp. 306-327 ◽  
Author(s):  
Murray Webster ◽  
Joseph M. Whitmeyer
Keyword(s):  
Empirical Evidence ◽  
Model Building ◽  
Sociological Theory ◽  
Social Situation ◽  
Theoretical Models ◽  
Theory Building ◽  
Interaction Patterns ◽  
Performance Expectations ◽  
Minimal Set ◽  
Face To Face

Theory-building is a continual, collective enterprise in which success is judged by logical consistency and successful explanation and prediction of specified empirical facts from a minimal set of assumptions. We describe some new attempts to develop Interactionist ideas on how communicated opinions from others can affect face-to-face interaction patterns and definitions of a social situation, including identities of the interactants. Our attempts take the form of developing theoretical models of how others' evaluative opinions are incorporated into existing performance expectations. We show how model-building depends on existing theoretical ideas and empirical evidence. The description illustrates some ways in which contemporary sociological theory develops.

Practical Applications of Sponsorship Theory: Empirical Evidence from English Club Rugby

1998 ◽  
Vol 12 (3) ◽  
pp. 203-219 ◽  
Author(s):  
Des Thwaites ◽  
Andrew Carruthers
Keyword(s):  
Empirical Evidence ◽  
Rugby League ◽  
Rugby Union ◽  
Corporate Sponsorship ◽  
Practical Applications ◽  
Implementation Evaluation ◽  
Professional Soccer ◽  
Rigorous Framework ◽  
Functional Control ◽  
Broad Objective

This paper studied the corporate sponsorship of both rugby league and rugby union clubs. The broad objective of the research was to establish the degree to which the rigorous framework for sponsorship management identified in the literature is applied in practice. In general the league sponsors adopted a more commercial approach to their initiatives, although further analysis highlighted the diverse nature of union sponsors who may be identified on a motivational continuum fromcommercialtophilanthropic.Clear opportunities are identified wherein sponsorship programs may be adapted to contribute more fully to corporate marketing objectives through a greater application of the prescriptions in the current literature. Specific issues addressed include: functional control, selection, objective setting, implementation, evaluation, and leverage. An assessment of the extent to which this situation is common to the sponsorship of other sports in England is made by reference to studies of professional soccer and horse racing.

scholarly journals Unsatisfiable Core Shrinking for Anytime Answer Set Optimization

2017 ◽  
Author(s):  
Mario Alviano ◽  
Carmine Dodaro
Keyword(s):  
Efficient Algorithms ◽  
Set Optimization ◽  
Core Analysis ◽  
Anytime Algorithm ◽  
Original Algorithm ◽  
Unsatisfiable Core ◽  
Stable Models ◽  
Answer Set

Efficient algorithms for the computation of optimum stable models are based on unsatisfiable core analysis. However, these algorithms essentially run to completion, providing few or even no suboptimal stable models. This drawback can be circumvented by shrinking unsatisfiable cores. Interestingly, the resulting anytime algorithm can solve more instances than the original algorithm.

scholarly journals Finding Still Waters and Green Pastures: Understanding and Reducing Stress in Urban Church Planting

2020 ◽  
Author(s):  
David Robert Dunaetz
Keyword(s):  
Social Support ◽  
Problem Solving ◽  
Empirical Evidence ◽  
Church Planting ◽  
Urban Church ◽  
Short Term ◽  
Church Planters ◽  
Practical Applications ◽  
Reducing Stress

The work of urban church planters is often hindered by high levels of stress. Stress may be viewed as a process that involves stressors and an individual’s perceptions of both the level of threat and his or her ability to deal with the threat. The long term and the short term consequences of stress can be attenuated through appropriate coping strategies such as problem solving, prayer, and seeking social support. Recent empirical evidence indicates that exposure to nature is also very effective, a strategy that might be especially beneficial to urban church planters and their ministries. Several practical applications are suggested.

Sign in / Sign up

Export Citation Format

Share Document