Sciweavers

11862 search results - page 126 / 2373
» Relative information completeness
Sort
View
ENTCS
2006
146views more  ENTCS 2006»
13 years 10 months ago
Relating State-Based and Process-Based Concurrency through Linear Logic
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...
Iliano Cervesato, Andre Scedrov
DAGSTUHL
1996
13 years 11 months ago
Specialization of Imperative Programs Through Analysis of Relational Expressions
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
Alexander Sakharov
COLING
2010
13 years 5 months ago
Self-Annotation for fine-grained geospatial relation extraction
A great deal of information on the Web is represented in both textual and structured form. The structured form is machinereadable and can be used to augment the textual data. We c...
André Blessing, Hinrich Schütze
ARSCOM
2007
191views more  ARSCOM 2007»
13 years 10 months ago
Binomial Identities Generated by Counting Spanning Trees
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
Thomas Dale Porter
IGPL
2008
116views more  IGPL 2008»
13 years 10 months ago
Modal Matters for Interpretability Logics
This paper is the first in a series of three related papers on modal methods in interpretability logics and applications. In this first paper the fundaments are laid for later res...
Evan Goris, Joost J. Joosten