111 search results - page 1 / 23 » The eskolemization of universal quantifiers |
APAL
2010
13 years 2 months ago
2010
This paper is a sequel to the papers [4, 6] in which an alternative skolemization method called ekolemization was introduced that, when applied to the strong existential quantifie...
ECAI
2004
Springer
13 years 8 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
CSL
2009
Springer
13 years 8 months ago
2009
Springer
The aim of this paper is to understand the interplay between intersection, universally quantified, and reference types. Putting together the standard typing rules for intersection,...
SAGA
2009
Springer
13 years 11 months ago
2009
Springer