3470 search results - page 378 / 694 » Head-Elementary-Set-Free Logic Programs |
285
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
185
click to vote
PEPM
2009
ACM
16 years 3 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
166
click to vote
ITC
1999
IEEE
15 years 11 months ago
1999
IEEE
A new synthesis technique for designing finite state machines with on-line parity checking is presented. The output logic and the next-state logic of the finite state machines are...
220
click to vote
FLOPS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
135
click to vote
KR
2000
Springer
15 years 10 months ago
2000
Springer
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...