125 search results - page 15 / 25 » Tabling for Higher-Order Logic Programming |
CADE
2004
Springer
14 years 8 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
CSL
2007
Springer
14 years 2 months ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
POPL
2006
ACM
14 years 8 months ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
JELIA
2010
Springer
13 years 5 months ago
2010
Springer
Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the t...
APIN
2000
13 years 7 months ago
2000
Defeasible logic is a system of reasoning in which rules have exceptions, and when rules conflict, the one that applies most specifically to the situation wins out. This paper repo...