On scrimshaw precursors: a 13th-century carved and engraved sperm whale tooth

In der einschlägigen Forschung zur Walfängervolkskunst des "Scrimshaw" - den seit den 1820er Jahren populär gewordenen Seemannsarbeiten speziell auf und aus Pottwal- und Walroßzahn, Barten und Walknochen - werden künstlerisch bearbeitete Gegenstände anderer Kulturen aus denselben Materialien als "Scrimshaw"-Vorläufer bezeichnet. Aus dem europäischen Mittelalter sind zwar zahlreiche Beispiele von Schnitzereien aus Walroßzahn und Walknochen bekannt, nicht jedoch aus Pottwalzahn, dem beinah stereotypen Werkstoff der "Scrimshander" des 19. und 20. Jahrhunderts. Der "Königsspiegel", ein um 1250/60 in Norwegen geschriebener pädagogischer Text, erwähnt gleichwohl Schnitzereien aus Pottwalzahn. Auch aus dem 16. und 17. Jahrhundert sind textliche Hinweise auf skandinavisches Kunstgewerbe aus den Zähnen dieses Meeressäugers bekannt. Im Anschluß an die Präsentation dieser Quellen wird ein konkretes Beispiel vorgestellt: Es handelt sich um ein beschnitztes und graviertes Salbenhorn aus Pottwalzahn, das sich in der Sammlung christlicher Kunst und Kultur des Museums der Universität Bergen, Norwegen, lnv. MA 437, befindet. Aus dem massiven Dentin wurde ein Greif herausgeschnitzt, der Ausguß wurde wie der Kopf eines gotischen Wasserspeiers gestaltet. Auf einer glatten Seitenfläche wurde später ein kleines Tondo mit Pflanzen- und Vogelmotiv eingraviert. Es trägt eine Inschrift, die vom Bergenser Museum als griechisch, hier aber als russisch identifiziert wurde, deren Sinn aber unklar bleibt. Anlass, die vom Museum vorgenommene Datierung des Zahns in das 13. Jahrhundert zu revidieren, besteht allerdings nicht

Tractable Combinations of Global Constraints

We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used; indeed, they are one of the key reasons for the success of constraint programming in solving real-world problems. Previous work has focused on the development of efficient propagators for individual constraints. In this paper, we identify a new tractable class of constraint problems involving global constraints of unbounded arity. To do so, we combine structural restrictions with the observation that some important types of global constraint do not distinguish between large classes of equivalent solutions.Comment: To appear in proceedings of CP'13, LNCS 8124. arXiv admin note: text overlap with arXiv:1307.179

Computer aided synthesis: a game theoretic approach

In this invited contribution, we propose a comprehensive introduction to game theory applied in computer aided synthesis. In this context, we give some classical results on two-player zero-sum games and then on multi-player non zero-sum games. The simple case of one-player games is strongly related to automata theory on infinite words. All along the article, we focus on general approaches to solve the studied problems, and we provide several illustrative examples as well as intuitions on the proofs.Comment: Invitation contribution for conference "Developments in Language Theory" (DLT 2017

A Graph Based Backtracking Algorithm for Solving General CSPs

Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complete task in general, tractable classes of CSPs have been identified based on the structure of the underlying constraint graphs. Much effort has been spent on exploiting structural properties of the constraint graph to improve the efficiency of finding a solution. These efforts contributed to development of a class of CSP solving algorithms called decomposition algorithms. The strength of CSP decomposition is that its worst-case complexity depends on the structural properties of the constraint graph and is usually better than the worst-case complexity of search methods. Its practical application is limited, however, since it cannot be applied if the CSP is not decomposable. In this paper, we propose a graph based backtracking algorithm called omega-CDBT, which shares merits and overcomes the weaknesses of both decomposition and search approaches

Towards Efficient Reasoning under Guarded-based Disjunctive Existential Rules

International audienceThe complete picture of the complexity of answering (unions of) conjunctive queries under the main guarded-based classes of disjunc- tive existential rules has been recently settled. It has been shown that the problem is very hard, namely 2ExpTime-complete, even for fixed sets of rules expressed in lightweight formalisms. This gives rise to the question whether its complexity can be reduced by restricting the query language. Several subclasses of conjunctive queries have been proposed with the aim of reducing the complexity of classical database problems such as query evaluation and query containment. Three of the most prominent subclasses of this kind are queries of bounded hypertree-width, queries of bounded treewidth and acyclic queries. The central objective of the present paper is to understand whether the above query languages have a positive impact on the complexity of query answering under the main guarded-based classes of disjunctive existential rules. We show that (unions of) conjunctive queries of bounded hypertree- width and of bounded treewidth do not reduce the complexity of our problem, even if we focus on predicates of bounded arity, or on fixed sets of disjunctive existential rules. Regarding acyclic queries, although our problem remains 2ExpTime-complete in general, in some relevant set- tings the complexity reduces to ExpTime-complete; in fact, this requires to bound the arity of the predicates, and for some expressive guarded- based formalisms, to fix the set of rules

The Role of Individual Variables, Organizational Variables and Moral Intensity Dimensions in Libyan Management Accountants’ Ethical Decision Making

This study investigates the association of a broad set of variables with the ethical decision making of management accountants in Libya. Adopting a cross-sectional methodology, a questionnaire including four different ethical scenarios was used to gather data from 229 participants. For each scenario, ethical decision making was examined in terms of the recognition, judgment and intention stages of Rest’s model. A significant relationship was found between ethical recognition and ethical judgment and also between ethical judgment and ethical intention, but ethical recognition did not significantly predict ethical intention—thus providing support for Rest’s model. Organizational variables, age and educational level yielded few significant results. The lack of significance for codes of ethics might reflect their relative lack of development in Libya, in which case Libyan companies should pay attention to their content and how they are supported, especially in the light of the under-development of the accounting profession in Libya. Few significant results were also found for gender, but where they were found, males showed more ethical characteristics than females. This unusual result reinforces the dangers of gender stereotyping in business. Personal moral philosophy and moral intensity dimensions were generally found to be significant predictors of the three stages of ethical decision making studied. One implication of this is to give more attention to ethics in accounting education, making the connections between accounting practice and (in Libya) Islam. Overall, this study not only adds to the available empirical evidence on factors affecting ethical decision making, notably examining three stages of Rest’s model, but also offers rare insights into the ethical views of practising management accountants and provides a benchmark for future studies of ethical decision making in Muslim majority countries and other parts of the developing world

The power of propagation:when GAC is enough

Considerable effort in constraint programming has focused on the development of efficient propagators for individual constraints. In this paper, we consider the combined power of such propagators when applied to collections of more than one constraint. In particular we identify classes of constraint problems where such propagators can decide the existence of a solution on their own, without the need for any additional search. Sporadic examples of such classes have previously been identified, including classes based on restricting the structure of the problem, restricting the constraint types, and some hybrid examples. However, there has previously been no unifying approach which characterises all of these classes: structural, language-based and hybrid. In this paper we develop such a unifying approach and embed all the known classes into a common framework. We then use this framework to identify a further class of problems that can be solved by propagation alone