Instantiation of Existentially Quantified Variables in Inductive Specification Proofs
نویسندگان
چکیده
Fourth International Conference Artificial Intelligence and Symbolic Computation, Plattsburgh, NY, September 1998. LNAI 1476, pp. 247–258, Springer Verlag, 1998. Abstract. We present an automatic approach for instantiating existentially quantified variables in inductive specifications proofs. Our approach uses first-order meta-variables in place of existentially quantified variables and combines logical proof search with rippling techniques. We avoid the non-termination problems which usually occur in the presence of existentially quantified variables. Moreover, we are able to synthesize conditional substitutions for the meta-variables. We illustrate our approach by discussing the specification of the integer square root.
منابع مشابه
A PSPACE-complete Fragment of Second-order Linear Logic
Existentially quantified variables are the source of non-decidability for second-order linear logic without exponentials (MALL2). We present a decision procedure for a fragment of MALL2 based on a canonical instantiation of these variables and using inference permutability in proofs. We also establish that this fragment is PSPACE-complete. @ 1999 Elsevier Science B.V. Ail rights reserved.
متن کاملA Decidable Fragment of Second Order Linear Logic
Existentially quantiied variables are the source of non decid-ability for second order linear logic without exponentials (MALL2). We propose a decision procedure for a fragment of MALL2 based on a canon-ical instantiation of these variables and using inference permutability in proofs.
متن کاملRelational Rippling: A General Approach
We propose a new version of rippling, called relational rippling. Rippling is a heuristic for guiding proof search, especially in the step cases of inductive proofs. Relational rippling is designed for representations in which value passing is by shared existential variables, as op posed to function nesting. Thus relational rip pling can be used to guide reasoning about logic programs or circ...
متن کاملFoundations for Decision Problems in Separation Logic with General Inductive Predicates
We establish foundational results on the computational complexity of deciding entailment in Separation Logic with general inductive predicates whose underlying base language allows for pure formulas, pointers and existentially quantified variables. We show that entailment is in general undecidable, and ExpTime-hard in a fragment recently shown to be decidable by Iosif et al. Moreover, entailmen...
متن کاملNegation as Instantiation
We propose a new negation rule for logic programming which derives existentially closed negative literals, and we de ne a version of completion for which this rule is sound and complete. The rule is called \Negation As Instantiation" (NAI). According to it, a negated atom succeeds whenever all the branches of the SLD-tree for the atom either fail or instantiate the atom. The set of the atoms wh...
متن کامل