3470 search results - page 309 / 694 » Head-Elementary-Set-Free Logic Programs |
225
click to vote
ISSTA
2012
ACM
13 years 9 months ago
2012
ACM
A static analysis design is sufficient if it can prove the property of interest with an acceptable number of false alarms. Ultimately, the only way to confirm that an analysis d...
190
click to vote
PEPM
2010
ACM
16 years 3 months ago
2010
ACM
We present two tools which together allow reasoning about (a substantial subset of) Haskell programs. One is the code generator of the proof assistant Isabelle, which turns speci...
174
Voted
ATAL
2000
Springer
15 years 11 months ago
2000
Springer
This paper presents a programmable logic-based agent control system that interleaves planning, plan execution and perception. In this system, a program is a collection of logical f...
193
click to vote
ICSM
2002
IEEE
15 years 11 months ago
2002
IEEE
Component recovery and remodularization is a means to get back control on large and complex legacy systems suffering from ad-hoc changes by recovering logical components and restr...
160
click to vote
CADE
1999
Springer
15 years 11 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...