Sciweavers

1320 search results - page 12 / 264
» Efficient Implementation of a Linear Logic Programming Langu...
Sort
View
LICS
1994
IEEE
13 years 10 months ago
A Multiple-Conclusion Meta-Logic
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
Dale Miller
CORR
2000
Springer
120views Education» more  CORR 2000»
13 years 6 months ago
Scaling Up Inductive Logic Programming by Learning from Interpretations
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart ...
FOIKS
2004
Springer
14 years 3 days ago
Implementing Ordered Choice Logic Programming using Answer Set Solvers
Abstract. Ordered Choice Logic Programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This com...
Marina De Vos
ICFP
2010
ACM
13 years 7 months ago
Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation
Partial evaluation aims to improve the efficiency of a program by specialising it with respect to some known inputs. In this paper, we show that partial evaluation can be an effec...
Edwin Brady, Kevin Hammond
POPL
2003
ACM
14 years 7 months ago
Static prediction of heap space usage for first-order functional programs
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
Martin Hofmann, Steffen Jost