Sciweavers

87 search results - page 14 / 18
» Maintenance of Transitive Closures and Transitive Reductions...
Sort
View
AML
2005
101views more  AML 2005»
13 years 7 months ago
Forcing and antifoundation
It is proved that the forcing apparatus can be built and set to work in ZFCA (=ZFC minus foundation plus the antifoundation axiom AFA). The key tools for this construction are gre...
Athanassios Tzouvaras
ICCAD
1999
IEEE
125views Hardware» more  ICCAD 1999»
13 years 11 months ago
Direct synthesis of timed asynchronous circuits
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
Sung Tae Jung, Chris J. Myers
ODBIS
2007
Springer
115views Database» more  ODBIS 2007»
14 years 1 months ago
On the Synthetic Generation of Semantic Web Schemas
In order to cope with the expected size of the Semantic Web (SW) in the coming years, we need to benchmark existing SW tools (e.g., query language interpreters) in a credible manne...
Yannis Theoharis, George Georgakopoulos, Vassilis ...
LPAR
2010
Springer
13 years 6 months ago
Clause Elimination Procedures for CNF Formulas
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
Marijn Heule, Matti Järvisalo, Armin Biere
SIGSOFT
2006
ACM
14 years 8 months ago
Lightweight extraction of syntactic specifications
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
Mana Taghdiri, Robert Seater, Daniel Jackson