1410 search results - page 247 / 282 » Proving theorems by reuse |
114
Voted
CCS
2010
ACM
14 years 12 months ago
2010
ACM
Cross-domain information exchange is a growing problem, as business and governmental organizations increasingly need to integrate their information systems with those of partially...
114
Voted
PPDP
2010
Springer
14 years 11 months ago
2010
Springer
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
112
Voted
FLAIRS
2009
14 years 11 months ago
2009
Belief revision always results in trusting new evidence, so it may admit an unreliable one and discard a more confident one. We therefore use belief change instead of belief revis...
143
Voted
CPC
2010
14 years 11 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
152
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processe...