Negative Subgoals with Free Variables
نویسنده
چکیده
Prolog systems currently work with the restriction that negative subgoals not contain free variables, although some authors have suggested that this restriction can be lifted by running the theorem prover to exhaustion on the subgoal being considered. We suggest that this approach is likely not to be computationally viable in practice, and describe and formalize a new approach to dealing with quantiied default queries that avoids this diiculty.
منابع مشابه
Optimal CQ Reformulation is NP-Hard
As a consequence of the Subgoal Theorem and the Projection Lemma, we need only consider projection views that are defined in terms of subgoals. Unfortunately, despite these improvements, we show that the optimization problem is still NP-Hard in the number of subgoals and free variables in the input query. Our proof strategy is as follows. First, we prune the space of potential reformulations by...
متن کاملThe Divide - and - Conquer Subgoal - Ordering Algorithmfor Speeding up Logic
It is common to view programs as a combination of logic and control: the logic part deenes what the program must do, the control part { how to do it. The Logic Programming paradigm was developed with the intention of separating the logic from the control. Recently, extensive research has been conducted on automatic generation of control for logic programs. Only a few of these works considered t...
متن کاملThe Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference
It is common to view programs as a combination of logic and control: the logic part de nes what the program must do, the control part { how to do it. The Logic Programming paradigm was developed with the intention of separating the logic from the control. Recently, extensive research has been conducted on automatic generation of control for logic programs. Only a few of these works considered t...
متن کاملInductive Inference of Prolog Programs with Linear Data Dependency from Positive Data
We study inductive inference of Prolog programs from positive examples of a target predicate. Shinohara showed in 1991 that the class of linear Prologs with at most m clauses is identi able in the limit from positive data only about a target predicate. However, linear Prologs are not allowed to have local variables, which are variables occurring in the body but not in the head. In this paper, w...
متن کاملUsing Examples to Generate Instantiations of Set Variables
Examples play a crucial role in automated theorem proving, not only as counterexamples to help prune unproductive subgoals, but also to help guide proof discovery. In this paper we show how examples (interpretations) might be used to help determine Instantiations of set variables. We also discuss the role of piecewise-linear continuous functions, and give some results of computer runs using the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Program.
دوره 11 شماره
صفحات -
تاریخ انتشار 1991