7576 search results - page 303 / 1516 » UNIX as an Application Program |
149
click to vote
ESOP
2005
Springer
16 years 6 days ago
2005
Springer
This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most ...
161
click to vote
LCPC
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. With the fast development of multi-core processors, automatic parallelization becomes increasingly important. In this work, we focus on the parallelization of utility pro...
148
click to vote
TACAS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Weakly-typed languages such as Cobol often force programrepresent distinct data abstractions using the same low-level physical type. In this paper, we describe a techniqu...
194
click to vote
JELIA
2004
Springer
16 years 1 days ago
2004
Springer
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...
219
click to vote
AGP
2010
IEEE
15 years 11 months ago
2010
IEEE
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...