3 search results - page 1 / 1 » Extensionality and Restriction in Naive Set Theory |
SLOGICA
2010
13 years 4 months ago
2010
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
EDBT
2010
ACM
14 years 17 days ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
CAV
1999
Springer
13 years 10 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...