2490 search results - page 353 / 498 » Complexity of Contextual Reasoning |
120
click to vote
ISQED
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— Reliability enhancements are traditionally implemented through redundancies at the system level or through the use of harden-cell-designs at the circuit level. Reliabil...
116
click to vote
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
132
click to vote
TPHOL
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract. How close are we to a world where every paper on programming languages is accompanied by an electronic appendix with machinechecked proofs? We propose an initial set of b...
105
click to vote
GRAPHITE
2005
ACM
15 years 9 months ago
2005
ACM
The computational requirements of full global illumination rendering are such that it is still not possible to achieve high-fidelity graphics of very complex scenes in a reasonab...
161
click to vote
HASKELL
2005
ACM
15 years 9 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...