Bottom-Up Bisimilar Datalog Goals
نویسندگان
چکیده
We introduce the concept of bisimulation between Datalog goals using bottom-up evaluation technique: two Datalog goals are bisimilar with respect to a given Datalog program equipped with a bottom-up evaluation technique when their resolution trees are bisimilar. We define the notion of a resolution tree and we address the problem of deciding whether two given goals are bisimilar with respect to given programs. When the given program is a Datalog program equipped with a bottom-up evaluation technique, this problem is decidable in 2EXPTIME.
منابع مشابه
BIM-Tool: Modeling and Reasoning Support for Strategic Business Models
The BIM-Tool provides graphical modeling and analysis support for the Business Intelligence Model (BIM). BIM-Tool is a standalone application built on top of Eclipse. The tool supports two kinds of automated reasoning: (1) bottom-up “what-if” analysis: given input labels about some elements of a BIM model (for example, success/failure for leaf goals), do these propagate to other elements in the...
متن کاملSafe Stratiied Datalog with Integer Order Does Not Have Syntax
Stratiied Datalog with integer (gap)-order (or Datalog :;<z) is considered. A Datalog :;<z-program is said to be safe ii its bottom-up processing terminates on all valid inputs. We prove that safe Datalog :;<z-programs do not have eeective syntax in the sense that there is no recursively enumerable set S of safe Datalog :;<z-programs such that every safe Datalog :;<z-program is equivalent to a ...
متن کاملTop-Down vs. Bottom-Up Revisited
Ullman ([Ull89a, Ull89b]) has shown that for the evaluation of safe Datalog programs, bottomup evaluation using Magic Sets optimization has time complexity less than or equal to a particular top-down strategy, Queue-based Rule Goal Tree (QRGT) evaluation. This result has sometimes been incorrectly interpreted to mean that bottom-up evaluation beats top-down evaluation for evaluating Datalog pro...
متن کاملCologne: A Declarative Distributed Constraint Optimization Platform
This paper presents Cologne, a declarative optimization platform that enables constraint optimization problems (COPs) to be declaratively specified and incrementally executed in distributed systems. Cologne integrates a declarative networking engine with an off-theshelf constraint solver. We have developed the Colog language that combines distributed Datalog used in declarative networking with ...
متن کاملExtension of a Datalog Reasoner with Top-Down Evaluation
The Integrated Rule Inference System IRIS is a Datalog reasoner capable of different bottom-up evaluation strategies. This thesis focus is on extending the reasoner with three new evaluation strategies which take a very different approach compared to the bottom-up evaluation strategies. The introduced strategies are SLD, SLDNF and OLDT, which are all top-down strategies. It will be elucidated h...
متن کامل