227 search results - page 30 / 46 » Second-order logic on equivalence relations |
218
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract. We present a categorical denotational semantics for a database mapping, based on views, in the most general framework of a database integration/exchange. Developed databa...
304
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
205
click to vote
ACL2
2006
ACM
16 years 21 days ago
2006
ACM
Several users have had problems using equivalence-based rewriting in ACL2 because the ACL2 rewriter caches its results. We describe this problem in some detail, together with a pa...
182
click to vote
ICCS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Conceptual graphs (CGs) share with FOL a fundamental expressiveness limitation: only higher-order logics allow assertions of properties on predicates. This paper intends ...
165
Voted
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...