2148 search results - page 42 / 430 » From process logic to program logic |
147
click to vote
XSYM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Recently it was shown that existing general-purpose inductive logic programming systems are useful for learning wrappers (known as L-wrappers) to extract data from HTML d...
130
click to vote
ITC
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper discusses practical issues involved in applying logic built-in self-test (BIST) to four large industrial designs. These multi-clock designs, ranging in size from 200K t...
136
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
248
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
129
click to vote
EUROCOLT
1999
Springer
15 years 8 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...