Filters








25,217 Hits in 6.9 sec

A technique for doing lazy evaluation in logic

Sanjai Narain
1986 The Journal of Logic Programming  
We develop a natural technique for defining functions in logic, i.e. PROLOG, which directly yields lazy evaluation. Its use does not require any change to the PROLOG interpreter.  ...  We analyze this technique and develop a precise definition of lazy evaluation for lists.  ...  SUMMARY AND DIRECTIONS FOR FUTURE WORE We have presented a natural and efficient technique for defining functions in logic that directly yields lazy evaluation.  ... 
doi:10.1016/0743-1066(86)90016-6 fatcat:lgnref5xgngpvnppqt5cnkaobi

IndLog — Induction in Logic [chapter]

Rui Camacho
2004 Lecture Notes in Computer Science  
IndLog is applicable in numerical domains using the lazy evaluation of literals technique and Model Validation and Model Selection statistical-based techniques.  ...  IndLog is a general purpose Prolog-based Inductive Logic Programming (ILP) system.  ...  Ind-Log uses lazy evaluation of literals [5] as a basic technique to handle numerical domains.  ... 
doi:10.1007/978-3-540-30227-8_65 fatcat:z6wuikxwabbp7gghasoduiy4na

A Technique to Build Debugging Tools for Lazy Functional Logic Languages

Bernd Braßel
2009 Electronical Notes in Theoretical Computer Science  
The technique has already been successfully employed to construct a debugger for lazy functional languages. This paper extends the technique to include also lazy functional logic languages.  ...  This paper is based on a recently developed technique to build debugging tools for lazy functional programming languages.  ...  This technique has first been developed to build a debugger for lazy functional languages [8] . This work describes the extension to the broader setting of functional logic languages.  ... 
doi:10.1016/j.entcs.2009.07.014 fatcat:zqdfs4c37rb5djpcairhlnpwhy

Improving the Efficiency of ILP Systems [chapter]

Rui Camacho
2003 Lecture Notes in Computer Science  
Inductive Logic Programming (ILP) is a promising technology for knowledge extraction applications. ILP has produced intelligible solutions for a wide variety of domains where it has been applied.  ...  The techniques were evaluated using the IndLog system on ILP datasets referenced in the literature.  ...  Except for the small (number of examples) datasets there is significant gain in using the lazy evaluation technique.  ... 
doi:10.1007/978-3-540-24580-3_29 fatcat:kue6egex5ra3hptydcxcnnvyju

From Functional Logic Programs to Purely Functional Programs Preserving Laziness [chapter]

Bernd Braßel, Sebastian Fischer
2011 Lecture Notes in Computer Science  
Most existing approaches to simulate logic features in functional languages do not preserve laziness, i.e., they can only model strict logic programming like in Prolog.  ...  The impact of this reduction is a general scheme for compiling functional logic programs to lazy functional programs without side effects.  ...  Libraries for logic programming in Haskell all share the same drawback in comparison to our approach: they do not preserve laziness for logic operations.  ... 
doi:10.1007/978-3-642-24452-0_2 fatcat:puky3uofxjfxrfxjdigrxwylgq

Declarative Diagnosis of Wrong Answers in Constraint Functional-Logic Programming [chapter]

Rafael Caballero, Mario Rodríguez Artalejo, Rafael del Vado Vírseda
2006 Lecture Notes in Computer Science  
Declarative programming paradigms involving complex operational details, such as constraint solving and lazy evaluation, do not fit well to traditional debugging techniques relying on the inspection of  ...  Declarative diagnosis was first proposed in the field of logic programming [10], and it has been successfully extended to other declarative programming paradigms, including lazy functional programming  ...  Declarative programming paradigms involving complex operational details, such as constraint solving and lazy evaluation, do not fit well to traditional debugging techniques relying on the inspection of  ... 
doi:10.1007/11799573_31 fatcat:da7cb2rq7ff4vmjwvles6b5ug4

Lazy and Enforceable Assertions for Functional Logic Programs [chapter]

Michael Hanus
2011 Lecture Notes in Computer Science  
Assertions or contracts are an important technique to improve the quality of software. Thus, assertions are also desirable for functional logic programming.  ...  Unfortunately, there is no established meaning of assertions in languages with a demand-driven evaluation strategy.  ...  The author is grateful to the participants of WFLP 2010 and the anonymous referees for helpful comments and suggestions to improve this paper.  ... 
doi:10.1007/978-3-642-20775-4_5 fatcat:ezagyqe2vrhsnckteznbffzg6i

Smoke

Fotis Psallidas, Eugene Wu
2018 Proceedings of the VLDB Endowment  
To do so, SMOKE tightly integrates the lineage capture logic into physical database operators; stores lineage in efficient lineage representations; and employs optimizations if future lineage queries are  ...  Data lineage describes the relationship between individual input and output data items of a workflow and is an integral ingredient for both traditional (e.g., debugging or auditing) and emergent (e.g.,  ...  We thank Molham Aref, Boris Glavic, Goetze Graefe, Joe Hellerstein, Christoph Koch, Sanjay Krishnan, Neokli Polyzoti, Thibault Sellam, Val Tannen, and Yifan Wu for many useful discussions.  ... 
doi:10.14778/3199517.3199522 fatcat:5gildqyqezeeromcftyvmoghu4

Lazy evaluation of transactions in database systems

Jose M. Faleiro, Alexander Thomson, Daniel J. Abadi
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
We introduce a lazy transaction execution engine, in which a transaction may be considered durably completed after only partial execution, while the bulk of its operations (notably all reads from the database  ...  However, we find that certain queries suffer increased latency, and therefore lazy database systems may not be appropriate for read-latency sensitive applications.  ...  Acknowledgments This work was sponsored by the NSF under grants IIS-1249722 and IIS-1422205, and by a Sloan Research Fellowship.  ... 
doi:10.1145/2588555.2610529 dblp:conf/sigmod/FaleiroTA14 fatcat:rcqea7ptcbf75bi4u4anc62wvy

Smoke: Fine-grained Lineage at Interactive Speed [article]

Fotis Psallidas, Eugene Wu
2018 arXiv   pre-print
As a result, applications, that in principle can express their logic declaratively in lineage terms, resort to hand-tuned implementations.  ...  To do so, Smoke introduces tight integration of the lineage capture logic into physical database operators; efficient, write-optimized lineage representations for storage; and optimizations when future  ...  evaluation techniques without using data cubes: (a) Lazy re-evaluates the group-by aggregation queries with a shared selection scan on the base table, (b) BT uses an index scan on the rids of the backward  ... 
arXiv:1801.07237v1 fatcat:mgxaqqmfdrffdl4atpsfss72wu

Spartacus: A Tableau Prover for Hybrid Logic

Daniel Götzmann, Mark Kaminski, Gert Smolka
2010 Electronical Notes in Theoretical Computer Science  
We evaluate the practical impact of pattern-based blocking and lazy branching for the basic modal logic K and observe high effectiveness of both techniques.  ...  We evaluate the effects of pattern-based blocking and lazy branching, and compare the performance of Spartacus with that of other reasoners for modal and description logics.  ...  For an evaluation of Spartacus on H(E, @), see [12] ; a more detailed evaluation is reserved for future work.  ... 
doi:10.1016/j.entcs.2010.04.010 fatcat:bejggi6htndn3gw4hb3vr74i7m

Symbolic execution of programs with heap inputs

Pietro Braione, Giovanni Denaro, Mauro Pezzè
2015 Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2015  
This is a main challenge for symbolic testing and analysis techniques that work well when dealing with numeric inputs, but do not satisfactorily cope with heap data structures yet.  ...  In this paper we propose a language HEX to specify invariants of partially initialized data structures, and a decision procedure that supports the incremental evaluation of structural properties in HEX  ...  In detail, our experiments consider the following set (T ) of techniques: Lazy: The plain lazy initialization algorithm, outlined in Section 2, without techniques for dealing with constraints.  ... 
doi:10.1145/2786805.2786842 dblp:conf/sigsoft/BraioneDP15 fatcat:jb6dwutvtrajteiyyxuh2fm65i

Higher Order Support in Logic Specification Languages for Data Mining Applications

Matthias van der Hallen
2015 International Conference on Logic Programming  
In this paper, we introduce our work on our doctorate with title "Higher Order Support in Logic Specification Languages for Data Mining Applications".  ...  We provide a background of the current techniques that might be of interest when implementing these higher order abstractions, such as lazy grounding and oracles.  ...  We expect to publish at least one summary of the devised methods and their evaluation to be written for publication, as well as an IDP release with full support for lazy grounding.  ... 
dblp:conf/iclp/Hallen15 fatcat:at73p4zcgbguzhkijqsslghtau

Extending constructive negation for partial functions in lazy functional-logic languages [chapter]

Juan José Moreno-Navarro
1996 Lecture Notes in Computer Science  
In this paper the mechanism of Default Rules for narrowingbased languages proposed in 24] is adapted to lazy narrowing. Every partial de nition of a function can be completed with a default rule.  ...  The main advantage is that the coroutining implementation technique described in 5], which is the basis for an e cient implementation, can be fully formalized in our framework.  ...  Acknowledgements This research was supported in part by the spanish project TIC/93-0737-C02-02.  ... 
doi:10.1007/3-540-60983-0_15 fatcat:66f3bhxubzdhhnndp6ypukjfyu

The integration of functions into logic programming: From theory to practice

Michael Hanus
1994 The Journal of Logic Programming  
The author is grateful to Herbert Kuchen, Rita Loogen, and an anonymous referee for their detailed comments on a previous version of this paper.  ...  in a systematic way: he has shown how functional logic programs can be translated into low-level instructions using partial evaluation techniques. 3.2.2.  ...  There are also other lazy evaluation strategies for functional logic programs which are slightly different from lazy narrowing presented so far.  ... 
doi:10.1016/0743-1066(94)90034-5 fatcat:fp45iy6ne5chhg6q2z4wwcktu4
« Previous Showing results 1 — 15 out of 25,217 results