1188 search results - page 141 / 238 » Extended Graph Unification |
131
click to vote
LPAR
2007
Springer
15 years 4 months ago
2007
Springer
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
CAV
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
VLDB
1999
ACM
15 years 2 months ago
1999
ACM
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
ATVA
2004
Springer
15 years 1 months ago
2004
Springer
In this paper, we describe a first-order linear time temporal logic (LTL) model checker based on multiway decision graphs (MDG). We developed a first-order temporal language, LMDG ...
IPCO
2010
14 years 11 months ago
2010
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...