Add to ORKGWe study possible algorithmic models for the picture verification task with double-quantified sentences of the form ‘Some X are connected with every Y’. We show that the ordering of quantifiers, either Some ◦ Every or Every ◦ Some, influences the cognitive difficulty of the task. We discuss how computational modeling can account for the varying cognitive load in quantifier verification
The automata-theoretic approach to the problem of program verification requires efficient minimizati...
This work shows that for each i ∈ ω there exists a Σ1i-hard ω-word language definable in Monadic Sec...
We consider constraint satisfaction problems parameterized by the set of allowed constraint predicat...
We study possible algorithmic models for the picture verification task with double-quantified senten...
We examine the verification of simple quantifiers in natural language from a computational model per...
How do semantic theories fit into the psychology of language more generally? A number of recent theo...
The paper explores the cognitive mechanisms involved in the verification of sentences with proportio...
We study the computational complexity of polyadic quantifiers in natural language. This type of quan...
Strategies used by people to verify quantified sentences, like `Most cars are white', have been a po...
The present dissertation is concerned with the processing difficulty of quantified sentences and how...
The semantic complexity of a quantifier can be defined as the computational complexity of the finite...
In three experiments, we investigated the computational complexity of German reciprocal sentences wi...
In this paper we study if semantic complexity can influence the distribution of generalized quantifi...
In this paper, we explore the computational complexity of the conjunctive fragment of the first-orde...
Automatic structures are infinite structures that are finitely represented by synchronized finite-st...
The automata-theoretic approach to the problem of program verification requires efficient minimizati...
This work shows that for each i ∈ ω there exists a Σ1i-hard ω-word language definable in Monadic Sec...
We consider constraint satisfaction problems parameterized by the set of allowed constraint predicat...
We study possible algorithmic models for the picture verification task with double-quantified senten...
We examine the verification of simple quantifiers in natural language from a computational model per...
How do semantic theories fit into the psychology of language more generally? A number of recent theo...
The paper explores the cognitive mechanisms involved in the verification of sentences with proportio...
We study the computational complexity of polyadic quantifiers in natural language. This type of quan...
Strategies used by people to verify quantified sentences, like `Most cars are white', have been a po...
The present dissertation is concerned with the processing difficulty of quantified sentences and how...
The semantic complexity of a quantifier can be defined as the computational complexity of the finite...
In three experiments, we investigated the computational complexity of German reciprocal sentences wi...
In this paper we study if semantic complexity can influence the distribution of generalized quantifi...
In this paper, we explore the computational complexity of the conjunctive fragment of the first-orde...
Automatic structures are infinite structures that are finitely represented by synchronized finite-st...
The automata-theoretic approach to the problem of program verification requires efficient minimizati...
This work shows that for each i ∈ ω there exists a Σ1i-hard ω-word language definable in Monadic Sec...
We consider constraint satisfaction problems parameterized by the set of allowed constraint predicat...