104 search results - page 11 / 21 » Computing interpolants in implicational logics |
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
It is well known that bisimulation on µ-expressions cannot be finitely axiomatised in equational logic. Complete axiomatisations such as those of Milner and Bloom/´Esik necessar...
CF
2008
ACM
13 years 9 months ago
2008
ACM
Using a new exact synthesizer that automatically induces minimal universal boolean function libraries, we introduce two indicators for comparing their expressiveness: the first ba...
SPAA
1998
ACM
13 years 11 months ago
1998
ACM
We present a computation-centric theory of memory models. Unlike traditional processor-centric models, computation-centric models focus on the logical dependencies among instructi...
SEMWEB
2007
Springer
14 years 1 months ago
2007
Springer
Abstract Traditional ontology mapping techniques are not strictly applicable in a dynamic and distributed environment (e.g. P2P and pervasive computing) in which on-the-fly alignm...
AAAI
1998
13 years 8 months ago
1998
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...