English
Related papers

Related papers: Permutation Models of Second Order

200 papers

We introduce second-order vector representations of words, induced from nearest neighborhood topological features in pre-trained contextual word embeddings. We then analyze the effects of using second-order embeddings as input features in…

Computation and Language · Computer Science 2017-05-25 Denis Newman-Griffis , Eric Fosler-Lussier

Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always been described only negatively, by the property it does not…

Artificial Intelligence · Computer Science 2007-05-23 Sarit Kraus , Daniel Lehmann , Menachem Magidor

A new class of copulas based on order statistics was introduced by Baker (2008). Here, further properties of the bivariate and multivariate copulas are described, such as that of likelihood ratio dominance (LRD), and further bivariate…

Methodology · Statistics 2014-12-03 Rose Baker

In 1960 Schwinger [J. Schwinger, Proc.Natl.Acad.Sci. 46 (1960) 570- 579] proposed the algorithm for factorization of unitary operators in the finite M dimensional Hilbert space according to a coprime decomposition of M. Using a special…

Quantum Physics · Physics 2010-02-09 B Simkhovich , A Mann , J Zak

In logic programming under the answer set semantics, preferences on rules are used to choose which of the conflicting rules are applied. Many interesting semantics have been proposed. Brewka and Eiter's Principle I expresses the basic…

Logic in Computer Science · Computer Science 2014-04-29 Alexander Šimko

We present results showing an improvement of the accuracy of perturbation theory as applied to cosmological structure formation for a useful range of scales. The Lagrangian theory of gravitational instability of Friedmann--Lema\^\i tre…

Astrophysics · Physics 2009-09-25 A. L. Melott , T. Buchert , A. G. Weiß

The use of Extended Logics to replace ordinary second order definability in Kleene's {\em Ramified Analytical Hierarchy} is investigated. This mirrors a similar investigation of Kennedy, Magidor and V\"a\"an\"anen \cite{KeMaVa2016} where…

Logic · Mathematics 2018-08-14 Philip Welch

We present an encoding of Zermelo-Fraenkel set theory into many-sorted first-order logic, the input language of state-of-the-art SMT solvers. This translation is the main component of a back-end prover based on SMT solvers in the TLA+ Proof…

Logic in Computer Science · Computer Science 2015-08-18 Stephan Merz , Hernán Vanzetto

In default reasoning, usually not all possible ways of resolving conflicts between default rules are acceptable. Criteria expressing acceptable ways of resolving the conflicts may be hardwired in the inference mechanism, for example…

Artificial Intelligence · Computer Science 2011-05-30 J. Rintanen

Good quality explanations strengthen the understanding of language models and data. Feature attribution methods, such as Integrated Gradient, are a type of post-hoc explainer that can provide token-level insights. However, explanations on…

Computation and Language · Computer Science 2026-04-21 Jonathan Kamp , Roos Bakker , Dominique Blok

Drawing on a problem posed by Hertzsprung in 1887, we say that a given permutation $\pi\in\mathcal{S}_n$ contains the Hertzsprung pattern $\sigma\in\mathcal{S}_k$ if there is factor $\pi(d+1)\pi(d+2)\cdots\pi(d+k)$ of $\pi$ such that…

Combinatorics · Mathematics 2021-04-08 Anders Claesson

We consider some fractional extensions of the recursive differential equation governing the Poisson process, by introducing combinations of different fractional time-derivatives. We show that the so-called "Generalized Mittag-Leffler…

Probability · Mathematics 2009-11-02 Luisa Beghin , Enzo Orsingher

The static dependency pair method is a method for proving the termination of higher-order rewrite systems a la Nipkow. It combines the dependency pair method introduced for first-order rewrite systems with the notion of strong computability…

Logic in Computer Science · Computer Science 2011-09-21 Sho Suzuki , Keiichirou Kusakari , Frédéric Blanqui

Fiore and Hur recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a…

Logic in Computer Science · Computer Science 2013-08-27 Marcelo Fiore , Ola Mahmoud

Most of the unsupervised dependency parsers are based on first-order probabilistic generative models that only consider local parent-child information. Inspired by second-order supervised dependency parsing, we proposed a second-order…

Computation and Language · Computer Science 2020-10-29 Songlin Yang , Yong Jiang , Wenjuan Han , Kewei Tu

It was recently shown by van den Broeck at al. that the symmetric weighted first-order model counting problem (WFOMC) for sentences of two-variable logic FO2 is in polynomial time, while it is Sharp-P_1 complete for some FO3-sentences. We…

Logic in Computer Science · Computer Science 2018-04-27 Antti Kuusisto , Carsten Lutz

In this paper we discuss improved estimators for the regression and the dispersion parameters in an extended class of dispersion models (J{\o}rgensen, 1996). This class extends the regular dispersion models by letting the dispersion…

Methodology · Statistics 2010-01-14 Alexandre B. Simas , Andréa V. Rocha , Wagner Barreto-Souza

This paper extends implication-space semantics to include first-order quantification. Implication-space semantics has recently been introduced as an inferentialist formal semantics that can capture nonmonotonic and nontransitive material…

Logic · Mathematics 2026-02-17 Ulf Hlobil

In this article, a posteriori error analysis is developed for mixed finite element Galerkin approximations to a second order linear hyperbolic equation. Based on mixed elliptic reconstructions and an integration tool, which is a variation…

Numerical Analysis · Mathematics 2017-01-10 Samir Karaa , Amiya K. Pani

We present a framework for synthesising formulas in first-order logic (FOL) from examples, which unifies and advances state-of-the-art approaches for inference of transition system invariants. To do so, we study and categorise the existing…

Programming Languages · Computer Science 2026-01-08 Ziyi Yang , George Pîrlea , Ilya Sergey