Batched evaluation of linear tabled logic programs
نویسندگان
چکیده
منابع مشابه
Batched evaluation of linear tabled logic programs
Logic Programming languages, such as Prolog, provide a highlevel, declarative approach to programming. Despite the power, flexibility and good performance that Prolog systems have achieved, some deficiencies in Prolog’s evaluation strategy SLD resolution limit the potential of the logic programming paradigm. Tabled evaluation is a recognized and powerful technique that overcomes SLD’s susceptib...
متن کاملIncremental Evaluation of Tabled Logic Programs
Tabling has emerged as an important evaluation technique in logic programming. Currently, changes to a program (due to addition/deletion of rules/facts) after query evaluation compromise the completeness and soundness of the answers in the tables. This paper presents incremental algorithms for maintaining the freshness of tables upon addition or deletion of facts. Our algorithms improve on exis...
متن کاملTabled Abduction in Logic Programs
Abduction has been on the back burner in logic programming, as abduction can be too difficult to implement, and costly to perform, in particular if abductive solutions are not tabled for reuse. On the other hand, current Prolog systems, with their tabling mechanisms, are mature enough to facilitate the specific introduction of tabling abductive solutions (tabled abduction) into them. We concept...
متن کاملA Local Algorithm for Incremental Evaluation of Tabled Logic Programs
This paper considers the problem of efficient incremental maintenance of memo tables in a tabled logic programming system when the underlying data are changed. Most existing techniques for incremental evaluation (or materialized view maintenance in deductive databases) consider insertion and deletion of facts as primitive changes, and treat update as deletion of the old version followed by inse...
متن کاملRetroactive Subsumption-Based Tabled Evaluation of Logic Programs
Tabled evaluation is a recognized and powerful implementation technique that overcomes some limitations of traditional Prolog systems in dealing with recursion and redundant sub-computations. Tabling based systems use call similarity to determine if a tabled subgoal will produce their own answers or if it will consume from another subgoal. While call variance has been a very popular approach, c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science and Information Systems
سال: 2013
ISSN: 1820-0214,2406-1018
DOI: 10.2298/csis121129066a