12,316 research outputs found
Composition and Relative Counting
According to the so-called strong variant of Composition as Identity (CAI), the Principle of Indiscernibility of Identicals can be extended to composition, by resorting to broadly Fregean relativizations of cardinality ascriptions. In this paper we analyze various ways in which this relativization could be achieved. According to one broad variety of relativization, cardinality ascriptions are about objects, while concepts occupy an additional argument place. It should be possible to paraphrase the cardinality ascriptions in plural logic and, as a consequence, relative counting requires the relativization either of quantifiers, or of identity, or of the is one of relation. However, some of these relativizations do not deliver the expected results, and others rely on problematic assumptions. In another broad variety of relativization, cardinality ascriptions are about concepts or sets. The most promising development of this approach is prima facie connected with a violation of the so-called Coreferentiality Constraint, according to which an identity statement is true only if its terms have the same referent. Moreover - even provided that the problem with coreferentiality can be fixed - the resulting analysis of cardinality ascriptions meets several difficulties
Fixed-parameter tractability, definability, and model checking
In this article, we study parameterized complexity theory from the
perspective of logic, or more specifically, descriptive complexity theory.
We propose to consider parameterized model-checking problems for various
fragments of first-order logic as generic parameterized problems and show how
this approach can be useful in studying both fixed-parameter tractability and
intractability. For example, we establish the equivalence between the
model-checking for existential first-order logic, the homomorphism problem for
relational structures, and the substructure isomorphism problem. Our main
tractability result shows that model-checking for first-order formulas is
fixed-parameter tractable when restricted to a class of input structures with
an excluded minor. On the intractability side, for every t >= 0 we prove an
equivalence between model-checking for first-order formulas with t quantifier
alternations and the parameterized halting problem for alternating Turing
machines with t alternations. We discuss the close connection between this
alternation hierarchy and Downey and Fellows' W-hierarchy.
On a more abstract level, we consider two forms of definability, called Fagin
definability and slicewise definability, that are appropriate for describing
parameterized problems. We give a characterization of the class FPT of all
fixed-parameter tractable problems in terms of slicewise definability in finite
variable least fixed-point logic, which is reminiscent of the Immerman-Vardi
Theorem characterizing the class PTIME in terms of definability in least
fixed-point logic.Comment: To appear in SIAM Journal on Computin
Unpaired Image Captioning via Scene Graph Alignments
Most of current image captioning models heavily rely on paired image-caption
datasets. However, getting large scale image-caption paired data is
labor-intensive and time-consuming. In this paper, we present a scene
graph-based approach for unpaired image captioning. Our framework comprises an
image scene graph generator, a sentence scene graph generator, a scene graph
encoder, and a sentence decoder. Specifically, we first train the scene graph
encoder and the sentence decoder on the text modality. To align the scene
graphs between images and sentences, we propose an unsupervised feature
alignment method that maps the scene graph features from the image to the
sentence modality. Experimental results show that our proposed model can
generate quite promising results without using any image-caption training
pairs, outperforming existing methods by a wide margin.Comment: Accepted in ICCV 201
- …