2911 search results - page 276 / 583 » A Logic of Graph Constraints |
140
click to vote
AML
2005
15 years 6 months ago
2005
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...
165
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
171
click to vote
ICDAR
2009
IEEE
16 years 1 months ago
2009
IEEE
There are a number of established products on the market for wrapping—semi-automatic navigation and extraction of data—from web pages. These solutions make use of the inherent...
203
click to vote
APN
2008
Springer
15 years 8 months ago
2008
Springer
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...
166
click to vote
FORTE
1994
15 years 8 months ago
1994
We discuss four issues concerning the semantics of Message Flow Graphs (MFGs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence...