9532 search results - page 36 / 1907 » Logic, Graphs, and Algorithms |
165
click to vote
JGAA
2007
15 years 5 months ago
2007
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
129
Voted
ICCAD
2005
IEEE
16 years 2 months ago
2005
IEEE
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...
131
click to vote
APN
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysi...
142
click to vote
CADE
2001
Springer
16 years 5 months ago
2001
Springer
RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first full-fledged ABox description logic system for a very expressive logic and is based on optimized s...
164
click to vote
CADE
1999
Springer
15 years 9 months ago
1999
Springer
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...