99 search results - page 5 / 20 » Temporal Decomposition for Logic Optimization |
LPAR
2004
Springer
15 years 3 months ago
2004
Springer
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
104
click to vote
SEMWEB
2009
Springer
15 years 2 months ago
2009
Springer
Scalable query answering over Description Logic (DL) based ontologies plays an important role for the success of the Semantic Web. Towards tackling the scalability problem, we prop...
DAC
1996
ACM
15 years 1 months ago
1996
ACM
Technology mapping requires the unmapped logic network to be represented in terms of base functions, usually two-input NORs and inverters. Technology decomposition is the step tha...
FORMATS
2006
Springer
15 years 1 months ago
2006
Springer
We add freeze quantifiers to the game logic ATL in order to specify real-time objectives for games played on timed structures. We define the semantics of the resulting logic TATL b...
DAC
2009
ACM
15 years 10 months ago
2009
ACM
This paper describes a function-based timing-driven optimization technique for the synthesis of multi-level logic circuits. Motivated by the principles of parallel prefix computat...