5084 search results - page 244 / 1017 » Proving Possibility Properties |
148
click to vote
APAL
2005
15 years 6 months ago
2005
Systems of explicit mathematics provide an axiomatic framework to represent programs and to prove properties of them. We introduce such a system with a new form of power types usi...
163
click to vote
JCT
2007
15 years 6 months ago
2007
An induced subgraph is called homogeneous if it is either a clique or an independent set. Let hom(G) denote the size of the largest homogeneous subgraph of a graph G. In this shor...
140
click to vote
JOT
2007
15 years 6 months ago
2007
ome this restriction, we develop so-called loose domains which abstract over several precise domains. Similar to the relation between supertypes and subtypes, we get a relation bet...
187
click to vote
ASE
2004
15 years 6 months ago
2004
In this paper, we develop model checking procedures for three ways of combining (temporal) logics: temporalization, independent combination, and join. We prove that they are termin...
161
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper boun...