Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Lifted inference with tree axioms
We consider the problem of weighted first-order model counting (WFOMC): given a first-
order sentence ϕ and domain size n∈ N, determine the weighted sum of models of ϕ over …
order sentence ϕ and domain size n∈ N, determine the weighted sum of models of ϕ over …
A double team semantics for generalized quantifiers
A Kuusisto - Journal of Logic, Language and Information, 2015 - Springer
We investigate extensions of dependence logic with generalized quantifiers. We also
introduce and investigate the notion of a generalized atom. We define a system of semantics …
introduce and investigate the notion of a generalized atom. We define a system of semantics …
Two-variable logic with counting and trees
We consider the two-variable logic with counting quantifiers (C2) interpreted over finite
structures that contain two forests of ranked trees. This logic is strictly more expressive than …
structures that contain two forests of ranked trees. This logic is strictly more expressive than …
One-dimensional fragment of first-order logic
We introduce a novel decidable fragment of first-order logic. The fragment is one-
dimensional in the sense that quantification is limited to applications of blocks of existential …
dimensional in the sense that quantification is limited to applications of blocks of existential …
[PDF][PDF] A Uniform One-Dimensional Fragment with Alternation of Quantifiers
E Kieroński - arxiv preprint arxiv:2310.00994, 2023 - cgi.cse.unsw.edu.au
The uniform one-dimensional fragment of first-order logic was introduced a few years ago as
a generalization of the two-variable fragment of first-order logic to contexts involving …
a generalization of the two-variable fragment of first-order logic to contexts involving …
Complexity and expressivity of uniform one-dimensional fragment with equality
Uniform one-dimensional fragment UF_1^= is a formalism obtained from first-order logic by
limiting quantification to applications of blocks of existential (universal) quantifiers such that …
limiting quantification to applications of blocks of existential (universal) quantifiers such that …
Two-variable separation logic and its inner circle
Separation logic is a well-known assertion language for Hoare-style proof systems. We
show that first-order separation logic with a unique record field restricted to two quantified …
show that first-order separation logic with a unique record field restricted to two quantified …
On the uniform one-dimensional fragment
A Kuusisto - arxiv preprint arxiv:1604.01673, 2016 - arxiv.org
The uniform one-dimensional fragment of first-order logic, U1, is a formalism that extends
two-variable logic in a natural way to contexts with relations of all arities. We survey …
two-variable logic in a natural way to contexts with relations of all arities. We survey …
Uniform one-dimensional fragments with one equivalence relation
The uniform one-dimensional fragment U1 of first-order logic was introduced recently as a
natural generalization of the two-variable fragment FO2 to contexts with relation symbols of …
natural generalization of the two-variable fragment FO2 to contexts with relation symbols of …
Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable
I Pratt‐Hartmann - Mathematical Logic Quarterly, 2018 - Wiley Online Library
We consider two‐variable, first‐order logic in which a single distinguished predicate is
required to be interpreted as a transitive relation. We show that the finite satisfiability …
required to be interpreted as a transitive relation. We show that the finite satisfiability …