Sciweavers

62 search results - page 10 / 13
» On the logical definability of certain graph and poset langu...
Sort
View
ICALP
2009
Springer
14 years 7 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald
JSYML
2010
107views more  JSYML 2010»
13 years 6 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
CLIMA
2004
13 years 9 months ago
Weighted Multi Dimensional Logic Programs
Abstract. We introduce a logical framework suitable to formalize structures of epistemic agents. Such a framework is based on the notion of weighted directed acyclic graphs (WDAGs)...
Pierangelo Dell'Acqua
ACTA
2005
87views more  ACTA 2005»
13 years 7 months ago
Hybrid networks of evolutionary processors are computationally complete
A hybrid network of evolutionary processors (an HNEP) consists of several language processors which are located in the nodes of a virtual graph and able to perform only one type o...
Erzsébet Csuhaj-Varjú, Carlos Mart&i...
ICFCA
2009
Springer
14 years 2 months ago
The Advent of Formal Diagrammatic Reasoning Systems
In knowledge representation and reasoning systems, diagrams have many practical applications and are used in numerous settings. Indeed, it is widely accepted that diagrams are a va...
Frithjof Dau