相关论文: A proof of strong normalisation using domain theor…

We consider Proof Complexity in light of the unusual binary encoding of certain combinatorial principles. We contrast this Proof Complexity with the normal unary encoding in several refutation systems, based on Resolution and Integer Linear…

The success of software model checking depends on finding an appropriate abstraction of the subject program. The choice of the abstract domain and the analysis configuration is currently left to the user, who may not be familiar with the…

We prove a result about reducibility behaviour of Thue polynomials over the rationals that was conjectured by M\"uller. More precisely, we show that, apart from few explicitly given exceptions, these polynomials have only finitely many…

We propose a general method to break down a main complex task into a set of intermediary easier sub-tasks, which are formulated in natural language as binary questions related to the final target task. Our method allows for representing…

In universal algebra, it is well known that varieties admitting a majority term admit several Mal'tsev-type characterizations. The main aim of this paper is to establish categorical counterparts of some of these characterizations for…

Domain adaptation in natural language generation (NLG) remains challenging because of the high complexity of input semantics across domains and limited data of a target domain. This is particularly the case for dialogue systems, where we…

Reasoning using negation is known to be difficult for transformer-based language models. While previous studies have used the tools of psycholinguistics to probe a transformer's ability to reason over negation, none have focused on the…

We extend the Brauer-Siegel theorem to new families of number fields, both in the classical setting of asymptotically bad families and in the more general framework due to Tsfasman and Vl\u{a}du\c{t} of asymptotically exact families. We…

We construct a continuous domain for temporal discretization of differential equations. By using this domain, and the domain of Lipschitz maps, we formulate a generalization of the Euler operator, which exhibits second-order convergence. We…

We show that the Euler system associated to Rankin--Selberg convolutions of modular forms, introduced in our earlier works with Lei and Kings, varies analytically as the modular forms vary in $p$-adic Coleman families. We prove an explicit…

Neural language models trained with a predictive or masked objective have proven successful at capturing short and long distance syntactic dependencies. Here, we focus on verb argument structure in German, which has the interesting property…

Most natural language processing systems based on machine learning are not robust to domain shift. For example, a state-of-the-art syntactic dependency parser trained on Wall Street Journal sentences has an absolute drop in performance of…

Felty and Miller have described what they claim to be a faithful encoding of the dependently typed lambda calculus LF in the logic of hereditary Harrop formulas, a sublogic of an intuitionistic variant of Church's Simple Theory of Types.…

We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or classical. Proofs of strong propositions must be…

In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the last two authors presented a combined language made of a (strongly normalizing) algebraic rewrite system and a typed lambda-calculus enriched by pattern-matching…

We thoroughly analyse the double-layer potential's role in approaches to spectral sets in the spirit of Delyon--Delyon, Crouzeix and Crouzeix--Palencia. While the potential is well-studied, we aim to clarify on several of its aspects in…

Several formal systems, such as resolution and minimal model semantics, provide a framework for logic programming. In this paper, we will survey the use of structural proof theory as an alternative foundation. Researchers have been using…

We consider prescriptive type systems for logic programs (as in Goedel or Mercury). In such systems, the typing is static, but it guarantees an operational property: if a program is "well-typed", then all derivations starting in a…

Abductive logic programming offers a formalism to declaratively express and solve problems in areas such as diagnosis, planning, belief revision and hypothetical reasoning. Tabled logic programming offers a computational mechanism that…

We classify localising subcategories of the stable module category of a finite group that are closed under tensor product with simple (or, equivalently all) modules. One application is a proof of the telescope conjecture in this context.…