Sciweavers

276 search results - page 34 / 56
» Extremely Low-Power Logic
Sort
View
CADE
1992
Springer
13 years 11 months ago
Caching and Lemmaizing in Model Elimination Theorem Provers
Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we repor...
Owen L. Astrachan, Mark E. Stickel
ET
2002
122views more  ET 2002»
13 years 7 months ago
Using At-Speed BIST to Test LVDS Serializer/Deserializer Function
LVDS is the acronym for Low-Voltage-DifferentialSignaling and is described in both the ANSI/TIA/EIA644 and IEEE 1596.3 standards. High performance yet Low Power and EMI have made ...
Magnus Eckersand, Fredrik Franzon, Ken Filliter
DLOG
1998
13 years 9 months ago
Comparing Subsumption Optimizations
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...
Ian Horrocks, Peter F. Patel-Schneider
CONCUR
2010
Springer
13 years 8 months ago
Reasoning about Optimistic Concurrency Using a Program Logic for History
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...
Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, Yu Zhang
ICLP
1995
Springer
13 years 11 months ago
Using Attributed Variables in the Implementation of Concurrent and Parallel Logic Programming Systems
Incorporating the possibility of attaching attributes to variables in a logic programming system has been shown to allow the addition of general constraint solving capabilities to...
Manuel V. Hermenegildo, Daniel Cabeza Gras, Manuel...