Existential quantification

Known as: ∃E, Existential operator,  
In predicate logic, an existential quantification is a type of quantifier, a logical constant which is interpreted as "there exists", "there is at… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
In this paper, we review different memristive threshold logic (MTL) circuits that are inspired from the synaptic action of the… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Review
2017
Review
2017
As a paradigm to recover the sparse signal from a small set of linear measurements, compressed sensing (CS) has stimulated a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2017
Review
2017
Vast collections of documents available in image format need to be indexed for information retrieval purposes. In this framework… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
2013
2013
HEX-programs extend ASP by external sources. In this paper, we present domain-specific existential quantifiers on top of HEX… (More)
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Temporal verification of universal (i.e., valid for all computation paths) properties of various kinds of programs, e.g… (More)
  • table 1
Is this relevant?
2011
2011
This paper presents an elegant algorithm for existential quantifier elimination using incremental SAT solving. This approach… (More)
  • table 1
  • table 2
  • figure 1
Is this relevant?
2009
2009
Ownership types characterize the topology of objects in the heap, through a characterization of the context to which an object… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula φ expressed as a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Most of the work regarding complexity results for concept languages consider subsumption as the prototypical inference. However… (More)
  • table 1
Is this relevant?
1992
1992
Much of the research on concept languages, also called terminological languages, has focused on t he computational complexity of… (More)
Is this relevant?