925 search results - page 70 / 185 » Connectivity on Complete Lattices |
KR
2010
Springer
15 years 1 months ago
2010
Springer
We study logical principles connecting two relations: independence, which is known as nondeducibility in the study of information flow, and functional dependence. Two different e...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k y + k . Over integers, the satisfiability problem for such systems is polynomi...
101
click to vote
ENTCS
2008
14 years 12 months ago
2008
We study the algebraic structure of directed bigraphs, a bigraphical model of computations with locations, connections and resources previously introduced as a unifying generaliza...
EJC
2006
14 years 12 months ago
2006
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
APAL
2005
14 years 11 months ago
2005
A new semantics is presented for the logic of proofs (LP), [1, 2], based on the intuition that it is a logic of explicit knowledge. This semantics is used to give new proofs of se...