1076 search results - page 58 / 216 » Operations on proofs and labels |
80
Voted
ENTCS
2007
15 years 21 days ago
2007
This paper proposes an extension to theorem proving interfaces for use with proofdirected debugging and other disproof-based applications. The extension is based around tracking a...
89
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
101
Voted
LICS
2000
IEEE
15 years 5 months ago
2000
IEEE
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats ...
89
Voted
ACCV
1998
Springer
15 years 5 months ago
1998
Springer
We present an object recognition system based on symbolic graphs with object corners as vertices and outlines as edges. Corners are determined in a robust way by a multiscale combi...
115
Voted
COLING
1990
15 years 1 months ago
1990
: This paper outlines a framework for connectionist representation based on the composition of connectionist states under vector space operators. The framework is used to specify a...