Constraining the Search Space in Temporal Pattern Mining

Agents in dynamic environments have to deal with complex situations including various temporal interrelations of actions and events. Discovering frequent patterns in such scenes can be useful in order to create prediction rules which can be used to predict future activities or situations. We present the algorithm MiTemP which learns frequent patterns based on a time intervalbased relational representation. Additionally the problem has also been transfered to a pure relational association rule mining task which can be handled by WARMR. The two approaches are compared in a number of experiments. The experiments show the advantage of avoiding the creation of impossible or redundant patterns with MiTemP. While less patterns have to be explored on average with MiTemP more frequent patterns are found at an earlier refinement level

A contribution to the Semantics of Xcerpt, a Web Query and Transformation Language

Xcerpt [1] is a declarative and pattern-based query and transformation languag

Nominal Unification from a Higher-Order Perspective

Nominal Logic is a version of first-order logic with equality, name-binding, renaming via name-swapping and freshness of names. Contrarily to higher-order logic, bindable names, called atoms, and instantiable variables are considered as distinct entities. Moreover, atoms are capturable by instantiations, breaking a fundamental principle of lambda-calculus. Despite these differences, nominal unification can be seen from a higher-order perspective. From this view, we show that nominal unification can be reduced to a particular fragment of higher-order unification problems: Higher-Order Pattern Unification. This reduction proves that nominal unification can be decided in quadratic deterministic time, using the linear algorithm for Higher-Order Pattern Unification. We also prove that the translation preserves most generality of unifiers

The interplay between grand unified and flavour symmetries in a Pati-Salam x S4 model

Both discrete flavour symmetries and Grand Unified symmetries explain apparent structures in the mass sector of the Standard Model. A model that combines both symmetries is therefore very appealing. We construct a model with the $S_4$ flavour symmetry and the Pati-Salam unification. We show that this model can indeed explain many observable relations between the masses of the quarks and leptons and that it is predictive in the neutrino sector. However, the combination of the two symmetries leads to new complications in the Higgs sector and in the running of the renormalisation group equations.Comment: To appear in the proceedings of PASCOS 2010, the 16th International Symposium on Particles, Strings and Cosmology, Valencia, Spai

Hierarchy Theory of Evolution and the Extended Evolutionary Synthesis: Some Epistemic Bridges, Some Conceptual Rifts

Contemporary evolutionary biology comprises a plural landscape of multiple co-existent conceptual frameworks and strenuous voices that disagree on the nature and scope of evolutionary theory. Since the mid-eighties, some of these conceptual frameworks have denounced the ontologies of the Modern Synthesis and of the updated Standard Theory of Evolution as unfinished or even flawed. In this paper, we analyze and compare two of those conceptual frameworks, namely Niles Eldredge’s Hierarchy Theory of Evolution (with its extended ontology of evolutionary entities) and the Extended Evolutionary Synthesis (with its proposal of an extended ontology of evolutionary processes), in an attempt to map some epistemic bridges (e.g. compatible views of causation; niche construction) and some conceptual rifts (e.g. extra-genetic inheritance; different perspectives on macroevolution; contrasting standpoints held in the “externalism–internalism” debate) that exist between them. This paper seeks to encourage theoretical, philosophical and historiographical discussions about pluralism or the possible unification of contemporary evolutionary biology

Constraint Handling Rules with Binders, Patterns and Generic Quantification

Constraint Handling Rules provide descriptions for constraint solvers. However, they fall short when those constraints specify some binding structure, like higher-rank types in a constraint-based type inference algorithm. In this paper, the term syntax of constraints is replaced by $\lambda$-tree syntax, in which binding is explicit; and a new $\nabla$ generic quantifier is introduced, which is used to create new fresh constants.Comment: Paper presented at the 33nd International Conference on Logic Programming (ICLP 2017), Melbourne, Australia, August 28 to September 1, 2017 16 pages, LaTeX, no PDF figure

Developments in Supergravity Unified Models

A review is given of developments in supergravity unified models proposed in 1982 and their implications for current and future experiment are discussed.Comment: 24 pages, 1 figure. To appear in "Perspectives on Supersymmetry II"", edited by Gordon Kan

Newton's Idea and Practice of Unification

In this paper I try to capture Newton's notion and practice of unification (I will mainly focus on the Principia). I will use contemporary theories on unification in philosophy of science as analytic tools (Kitcher, Schurz and Salmon). I will argue that Salmon's later work on the topic provides a good starting point to characterize Newton's notion and practice. However, in order to fully grasp Newton's idea and practice of unification, Salmon's model needs to be fleshed out and extended