1743 search results - page 11 / 349 » Generalized Modal Satisfiability |
AMAI
2005
Springer
13 years 9 months ago
2005
Springer
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
ICMI
2004
Springer
14 years 3 months ago
2004
Springer
In this paper, we describe the concept of a new modality for interaction with digital maps. We propose using inclination as a means for panning maps on a mobile computing device, ...
AIML
1998
13 years 11 months ago
1998
Generalizing an example from (Fine 1975) and inspired by a theorem in (J
SEFM
2009
IEEE
14 years 4 months ago
2009
IEEE
—Contracts and their composition may be used with different goals in a component-based design flow: on the one hand, a component contract describes the guarantees a component is...
LOGCOM
2010
13 years 8 months ago
2010
Abstract This paper investigates expressivity of modal logics for transition systems, multitransition systems, Markov chains, and Markov processes, as coalgebras of the powerset, ï...