This paper presents a proof language based on the work of Sacerdoti Coen [1,2], Kirchner [3] and Autexier [4] on λ̄μμ̃, a calculus introduced by Curien and Herbelin [5,6]. Just as λ̄μμ̃ preserves several proof structures that are identified by the λ-calculus, the proof language presented here aims to preserve as much proof structure as reasonable; we call that property being logically saturated. Th...

How can we prove that some fragment of a given logic has the power to define precisely all structural properties that satisfy some characteristic semantic preservation condition? This issue is a fundamental one for classical model theory and applications in non-classical settings alike. While methods differ greatly, and while the classical methods can usually not be matched for instance in the ...

This paper proposes an example driven approach to improve the quality of MT system outputs. Specifically, We extend the system combination method in SMT to combine the examples by two strategies: 1) estimating the confidence of examples by the similarity between source input and the source part of examples; 2) approximating target word posterior probability by the word alignments of the bilingu...

Logic Programming, and the language Prolog in particular, has been proven to be very useful for the implementation of applications from various fields of Artificial Intelligence (e.g. Expert Systems, Machine Learning, Search, Reasoning, Planning, Natural Language Processing, Deductive Databases, Data Mining, etc) [1], [5]. One of the most dynamic programming paradigms nowadays is undoubtedly th...

Conditionals play a central part in knowledge representation and reasoning. Describing certain relationships between antecedents and consequences by \if{then{sentences" their range of expressiveness includes commonsense knowledge as well as scientiic statements. In this paper, we present the principles of maximum entropy resp. of minimum cross-entropy (ME-principles) as a logically sound and pr...

We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindström quantifiers. An important instance of our result concerns first-order definable tree languages. Our characterization relies on the usage of preclones, an algebraic structure introduced by the authors in a previous paper, and of the block product operation on preclones. Our re...