9532 search results - page 1820 / 1907 » Logic, Graphs, and Algorithms |
164
Voted
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
205
click to vote
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
189
click to vote
ALT
1995
Springer
15 years 10 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
178
click to vote
TACAS
2000
Springer
15 years 10 months ago
2000
Springer
This note describes Proof General, a tool for developing machine proofs with an interactive proof assistant. Interaction is based around a proof script, which is the target of a pr...
218
click to vote
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...