111 search results - page 8 / 23 » The eskolemization of universal quantifiers |
CP
2008
Springer
13 years 9 months ago
2008
Springer
The Quantified Constraint Satisfaction Problem (QCSP) has been introduced to express situations in which we are not able to control the value of some of the variables (the universa...
AUIC
2000
IEEE
14 years 8 days ago
2000
IEEE
In this paper we propose that a metaphor can be used to represent domains that are not easily quantifiable. The metaphor then can be used as an interface to communicate informatio...
APAL
2008
13 years 8 months ago
2008
Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
CAV
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. This paper presents a constraint-based technique for discovering a rich class of inductive invariants (boolean combinations of polynomial inequalities of bounded degree) ...