Filters








5,880 Hits in 5.1 sec

Joint Tabling of Logic Program Abductions and Updates [article]

Ari Saptawijaya, Luís Moniz Pereira
2014 arXiv   pre-print
., tabled abduction and incremental tabling for query-driven propagation of logic program updates. A prototype of the integrated system is implemented in XSB Prolog.  ...  Taking this as a motivation, in this paper we integrate abductive logic programs and logic program updates by jointly exploiting tabling features of logic programming.  ...  Acknowledgements Ari Saptawijaya acknowledges the support of FCT/MEC Portugal, grant SFRH/BD/72795/2010.  ... 
arXiv:1405.2058v1 fatcat:k6cejelv45evfiiibllgovb5de

Demand-Driven Incremental Object Queries [article]

Yanhong A. Liu, Jon Brandvein, Scott D. Stoller, Bo Lin
2016 arXiv   pre-print
Most importantly, it defines invariants for not only the query results, but also all auxiliary values about the objects and sets involved, including those for propagating demand, and incrementally maintains  ...  How to implement object queries efficiently under all possible updates, and furthermore to provide complexity guarantees? This paper describes an automatic method.  ...  We thank Xuetian Weng for help making the JQL implementation work and for experiments using the Zipf distribution.  ... 
arXiv:1511.04583v3 fatcat:55xcn6nvtrasfihrevaw4fctsq

Incremental Model Transformation for the Evolution of Model-Driven Systems [chapter]

David Hearnden, Michael Lawley, Kerry Raymond
2006 Lecture Notes in Computer Science  
Incremental updates are a key execution scenario for transformations in model-based systems, and are especially important for the evolution of such systems.  ...  the efficiency of change propagation.  ...  Recent developments in incremental evaluation of tabled logic programs [9] [10] are also adopting an engine-oriented approach.  ... 
doi:10.1007/11880240_23 fatcat:y3pwgnpqtzb2plkf537zsrganu

Demand-driven incremental object queries

Yanhong A. Liu, Jon Brandvein, Scott D. Stoller, Bo Lin
2016 Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming - PPDP '16  
Most importantly, it defines invariants for not only the query results, but also all auxiliary values about the objects and sets involved, including those for propagating demand, and incrementally maintains  ...  How to implement object queries efficiently under all possible updates, and furthermore to provide complexity guarantees? This paper describes an automatic method.  ...  We thank Xuetian Weng for help making the JQL implementation work and for experiments using the Zipf distribution.  ... 
doi:10.1145/2967973.2968610 dblp:conf/ppdp/LiuBSL16 fatcat:swoukds3wndf7k25hd56biq5be

Reactive model transformation with ATL

Salvador Martínez, Massimo Tisi, Rémi Douence
2017 Science of Computer Programming  
The development of such applications is complicated by the need to reflect on the whole network any runtime update performed on models or transformation logic.  ...  In this paper we propose a reactive paradigm for programming model transformations, and we implement a reactive model-transformation engine.  ...  with incremental queries 2) facilitate the integration between different model-driven operations (transformation, query, etc.) in a source incremental execution scheme directed by trigger events.  ... 
doi:10.1016/j.scico.2016.08.006 fatcat:jfj6yz5vhbcsphwfoofwyq67oe

Forward

Yupeng Fu, Kian Win Ong, Yannis Papakonstantinou, Erick Zamora
2014 Proceedings of the VLDB Endowment  
handcode incremental modifications with trigger-based programming and manual coordination of data dependencies.  ...  It enables FOR-WARD to leverage database techniques, such as incremental view maintenance, updatable views, capability-based component wrappers and cost-based optimization to automate efficient live visualizations  ...  Declarative programming enables the system to leverage database techniques, such as updatable views, capability-based wrappers [6] and cost-based optimization to automatically propagate incremental modifications  ... 
doi:10.14778/2733004.2733052 fatcat:hxomi4nphfhzrjzeyzi7fiyv44

Monitoring Complex Rule Conditions [chapter]

Tore Risch, Martin Sköld
1999 Active Rules in Database Systems  
With incremental evaluation the state of a rule condition is materialized and, after an update, the new state of the condition is defined incrementally in terms of differences to the materialized state  ...  For this several methods have been proposed that are based on the technique of incremental evaluation.  ...  Thus, in difference to active database systems, all the instantiations of all patterns (i.e. all queries) in the current OPS5 program are incrementally maintained, and regular demand driven database queries  ... 
doi:10.1007/978-1-4419-8656-6_5 fatcat:5nwicrnx2zephgbl6k5cxjxdgi

Extending logical attack graphs for efficient vulnerability analysis

Diptikalyan Saha
2008 Proceedings of the 15th ACM conference on Computer and communications security - CCS '08  
Recently, researchers have addressed the problem of scalable generation of attack graph by logical formulation of vulnerability analysis in an existing framework called MulVAL.  ...  Finally, we present an incremental algorithm which efficiently recomputes the attack graph in response to the changes in the inputs of the vulnerability analysis framework.  ...  Note that invalidation phase does not update falsecount for deletion mark propagation.  ... 
doi:10.1145/1455770.1455780 dblp:conf/ccs/Saha08 fatcat:rkvosfbyhbaqplai7w7j6lzrze

Demand-driven computation of interprocedural data flow

Evelyn Duesterwald, Rajiv Gupta, Mary Lou Soffa
1995 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95  
This paper presents a general framework for deriving demanddriven algorithms for interprocedural data flow analysis of imperative programs.  ...  In our framework, a demand for data flow information is modeled as a set of data flow queries.  ...  Acknowledgements We thank Tom Reps and the referees for their comments on an earlier draft of this paper.  ... 
doi:10.1145/199448.199461 dblp:conf/popl/DuesterwaldGS95 fatcat:hkdu2kkfpbbihfcviiu3cxpohq

A delta-driven execution model for semantic computing

Roly Perera, Jeff Foster
2005 Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '05  
We describe (and demonstrate) the execution model of a computing platform where computation is both incremental and data-driven. We call such an approach delta-driven.  ...  The platform is intended as a delivery vehicle for semantically integrated software, and thus lends itself to the semantic web, domain-driven development, and next-generation software development environments  ...  A reference represents the "selection" -either explicitly, via the user, or implicitly, via the reactive propagation of updates to the program -of a particular argument for some function f.  ... 
doi:10.1145/1094855.1094935 dblp:conf/oopsla/PereraF05a fatcat:xva5akh3enhthopqw3m7qqjfwu

A delta-driven execution model for semantic computing

Roly Perera, Jeff Foster, György Koch
2005 Companion to the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '05  
We describe (and demonstrate) the execution model of a computing platform where computation is both incremental and data-driven. We call such an approach delta-driven.  ...  The platform is intended as a delivery vehicle for semantically integrated software, and thus lends itself to the semantic web, domain-driven development, and next-generation software development environments  ...  A reference represents the "selection" -either explicitly, via the user, or implicitly, via the reactive propagation of updates to the program -of a particular argument for some function f.  ... 
doi:10.1145/1094855.1094871 dblp:conf/oopsla/PereraFK05 fatcat:bi73x7ozrngy7af5m2jgaba3ba

A Flexible Solver for Finite Arithmetic Circuits

Nathaniel Wesley Filardo, Jason Eisner, Marc Herbstritt
2012 International Conference on Logic Programming  
We present a flexible algorithm for efficiently querying node values as they change under updates to the circuit's inputs.  ...  Our algorithm is designed to admit future generalizations, including cyclic and infinite circuits and propagation of delta updates.  ...  Acknowledgements This research was funded in part by the JHU Human Language Technology Center of Excellence.  ... 
doi:10.4230/lipics.iclp.2012.425 dblp:conf/iclp/FilardoE12 fatcat:bmekiz3cevbireiyfrzimhzmgq

Anatomy of the ADO.NET entity framework

Atul Adya, José A. Blakeley, Sergey Melnik, S. Muralidhar
2007 Proceedings of the 2007 ACM SIGMOD international conference on Management of data - SIGMOD '07  
The database system operates on data in the form of rows and tables, while the application operates on data in terms of higher-level programming language constructs (classes, structures etc.).  ...  Microsoft's ADO.NET Entity Framework is a platform for programming against data that raises the level of abstraction from the relational level to the conceptual (entity) level, and thereby significantly  ...  We would like to thank all members of the ADO. NET  ... 
doi:10.1145/1247480.1247580 dblp:conf/sigmod/AdyaBMM07 fatcat:pffnelzhevam5ecbwnhgpngvci

Introduction to the 30th International Conference on Logic Programming Special Issue

MICHAEL LEUSCHEL, TOM SCHRIJVERS
2014 Theory and Practice of Logic Programming  
Following the initiative in 2010 taken by the Association for Logic Programming and Cambridge University Press, the full papers accepted for the International Conference on Logic Programming again appear  ...  The 30th edition of the International Conference of Logic Programming took place in Vienna in July 2014 at the Vienna Summer of Logic - the largest scientific conference in the history of logic.  ...  ., tabled abduction and incremental tabling for query-driven propagation of logic program updates. A prototype of the integrated system is implemented in XSB Prolog.  ... 
doi:10.1017/s1471068414000581 fatcat:6fczd6mhxjcutozkk6t23lvn5e

A practical framework for demand-driven interprocedural data flow analysis

Evelyn Duesterwald, Rajiv Gupta, Mary Lou Soffa
1997 ACM Transactions on Programming Languages and Systems  
The framework includes a generic demand-driven algorithm that determines the response to a query by iteratively applying a system of query propagation rules.  ...  A demand for data flow information is modeled as a set of queries.  ...  ACKNOWLEDGMENTS The authors gratefully thank the anonymous referees for their detailed comments and suggestions, which have helped improve both the contents and presentation of this article.  ... 
doi:10.1145/267959.269970 fatcat:k7nx22lraba3zjejalg324duti
« Previous Showing results 1 — 15 out of 5,880 results