Related papers: Focus on ``only" and ``Not"
Logic programming with fixed-point definitions is a useful extension of traditional logic programming. Fixed-point definitions can capture simple model checking problems and closed-world assumptions. Its operational semantics is typically…
Approximation fixpoint theory (AFT) is an abstract and general algebraic framework for studying the semantics of non-monotonic logics. In recent work, AFT was generalized to non-deterministic operators, i.e.\ operators whose range are sets…
The object of this lecture is to propose a series of conjectures and problems in different fields of analysis. They have been formulated with the aim of introducing some innovative methods in the study of classical topics, as open mappings,…
The idea of using unfolding as a way of computing a program semantics has been applied successfully to logic programs and has shown itself a powerful tool that provides concrete, implementable results, as its outcome is actually source…
We propose a novel framework to facilitate the on-demand design of data-centric systems by exploiting domain knowledge from an existing ontology. Its key ingredient is a process that we call focusing, which allows to obtain a schema for a…
The focus of the papers presented in this volume is on the interplay between syntax and semantics in case of languages, namely the central question of what a program means and how it does define the intended procedure. This is a crucial…
We read Karen Crowther's \emph{Another 100 Years of Quantum Interpretation?} with two practical goals. First, we spell out what she means by interpretation'': an attempt to provide understanding (not just predictions), which may be…
Hilary Putnam once suggested that "the actual existence of sets as 'intangible objects' suffers... from a generalization of a problem first pointed out by Paul Benacerraf... are sets a kind of function or are functions a sort of set?"…
This book is not meant to be another compendium of select inequalities, nor does it claim to contain the latest or the slickest ways of proving them. This project is rather an attempt at describing how most functional inequalities are not…
We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…
We provide a novel notion of what it means to be interpretable, looking past the usual association with human understanding. Our key insight is that interpretability is not an absolute concept and so we define it relative to a target model,…
We present a simple and intuitive Focus-and-eXpand (\fax) method to guide the training process of a neural network towards a specific solution. Optimizing a neural network is a highly non-convex problem. Typically, the space of solutions is…
This position paper suggests that progress with automatic summarising demands a better research methodology and a carefully focussed research strategy. In order to develop effective procedures it is necessary to identify and respond to the…
To analyse and verify the safety and security properties of interactive systems, a formal specification might be necessary. There are many types of formal languages and frameworks. The decision regarding what type of formal specification…
Language sciences rely less and less on formal syntax as their base. The reason is probably its lack of psychological reality, knowingly avoided. Philosophers of science call for a paradigm shift in which explanations are by mechanisms, as…
In David Schmidt's PhD work he explored the use of denotational semantics as a programming language. It was part of an effort to not only treat formal semantics as specifications but also as interpreters and input to compiler generators.…
This paper presents a general framework for unifying functional interpretations. It is based on families of parameters allowing for different degrees of freedom on the design of the interpretation. In this way we are able to generalise…
Centering theory posits a discourse center, a distinguished discourse entity that is the topic of a discourse. A simplified version of this theory is developed in a Dynamic Semantics framework. In the resulting system, the mechanism of…
This text is meant for analysis students who want to learn more about the effects of the axiom of choice on functional analysis, and the things that may go wrong in its absence. As this is a text aimed for analysis students, we will not…
Functional epistemology is about ways to access functional objects by using varieties of methods and procedures. Not all such means are equally capable of reproducing these functions in the desired consistency and resolution. Dyson's…