3470 search results - page 242 / 694 » Head-Elementary-Set-Free Logic Programs |
158
click to vote
LISP
2008
15 years 6 months ago
2008
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
180
click to vote
LISP
2008
15 years 6 months ago
2008
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
193
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
The recognition of text in everyday scenes is made difficult by viewing conditions, unusual fonts, and lack of linguistic context. Most methods integrate a priori appearance info...
146
click to vote
ESOP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. A goal-independent suspension analysis is presented that infers a class of goals for which a logic program with delays can be executed without suspension. The crucial poi...
186
click to vote
ISSTA
2010
ACM
15 years 8 months ago
2010
ACM
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...