Conservative query normalization on parallel circumscription

  • Kouji Iwanuma
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 814)


In this paper, we study a deductive computation for parallel circumscription based on query normalization. At first, we give two fundamental transformation rules M-resolution and V-resolution. M-resolution is an equivalent transformation rule for computing negative information upon circumscribed predicates occurring in queries. V-resolution is for computing variable predicates, and nearly conserves the satisfiability of queries. Next, we give Conservative Query (CQ) transformation rule by integrating M-resolution and V-resolution. CQ-transformation takes a general form of Negation as Failure rule in logic programming. It is applicable to parallel circumscription over an arbitrary first-order clausal theory. After we extend CQ-transformation by incorporating it with Robinson's resolution procedure, we discuss fundamental properties for high-speed execution based on compilation of CQ-transformation.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Etherington, Reasoning with Incomplete Information, (Pitman Pub., 1988).Google Scholar
  2. 2.
    M.L. Ginsberg, A circumscriptive theorem prover, Artif. Intell. 39 (1989) 209–230.Google Scholar
  3. 3.
    M. Gelfond and V. Lifschitz, Compiling Circumscriptive Theories into Logic Programs, Lect. Notes in Artif. Intell. 346 (1988) 74–99.Google Scholar
  4. 4.
    D. Gabbay and H.J. Ohlbach, Quantifier elimination in second-order predicate logic, KR '92, (1992) 425–435Google Scholar
  5. 5.
    N. Helft, K. Inoue and D. Poole, Query Answering in Circumscription, IJCAI '91 (1991) 426–431Google Scholar
  6. 6.
    B. H. Hou, A. Togashi and S. Noguchi, A Partial Translation of Default Logic to Circumscription, J. Infor. Proc. 12 (4) (1990) 343–353.Google Scholar
  7. 7.
    K. Iwanuma, M. Harao and S. Noguchi, A query transformation for computing predicate circumscription, Pacific Rim Inter. Conf. on Artificial Intelligence '90, Nagoya, Japan (1990) 351–356.Google Scholar
  8. 8.
    P.G. Kolaitis and C.H. Papadimitriou, Some computational aspects of circumscription, J. ACM 37 (1) (1990) 1–14.Google Scholar
  9. 9.
    V. Lifschitz, Computing Circumscription, IJCAI '85 (1985) 121–127.Google Scholar
  10. 10.
    V. Lifschitz, Pointwise circumscription, in: M.L. Ginsberg ed., Readings in Nonmonotonic Reasoning (Morgan Kaufmann Pub., 1988), 179–193.Google Scholar
  11. 11.
    J.W. Lloyd, Foundations of Logic Programming (Springer-Verlag, 2nd Ed., 1987).Google Scholar
  12. 12.
    J. McCarthy, Circumscription: A Form of Nonmonotonic Reasoning, Artif. Intell. 13 (1980) 27–39.Google Scholar
  13. 13.
    T. C. Przymusinski, On the Relationship Between Logic Programming and Nonmonotonic Reasoning, AAAI-88 (1988) 444–448.Google Scholar
  14. 14.
    T. C. Przymusinski, An Algorithm to Compute Circumscription, Artif. Intell., 38 (1989) 49–73.Google Scholar
  15. 15.
    M.E. Stickel, A prolog technology theorem prover: a new exposition and implementation in prolog, Theoret. Comput. Sci. 104 (1992) 109–128.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Kouji Iwanuma
    • 1
  1. 1.Department of Electrical Engineering and Computer ScienceYamanashi UniversityYamanashiJapan

Personalised recommendations