1032 search results - page 34 / 207 » Extended Computation Tree Logic |
ICML
1989
IEEE
15 years 1 months ago
1989
IEEE
Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out, but first-order Horn logic i...
DAC
2004
ACM
15 years 10 months ago
2004
ACM
We present a set of techniques for placement-coupled, timingdriven logic replication. Two components are at the core of the approach. First is an algorithm for optimal timingdrive...
102
click to vote
ENTCS
2002
14 years 9 months ago
2002
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
SIGGRAPH
2000
ACM
15 years 2 months ago
2000
ACM
Visualization of very complex scenes can be significantly accelerated using occlusion culling. In this paper we present a visibility preprocessing method which efficiently compu...