Embedding negation as failure into a model generation theorem prover

Katsumi Inoue, Miyuki Koshimura, Ryuzo Hasegawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

48 Citations (Scopus)


Here, for the first time, we give an implementation which computes answer sets of every class of (function-free) logic programs and deductive databases containing both negation as failure and classical negation. The proposal is based on bottom-up, incremental, backtrack-free computation of the minimal models of positive disjunctive programs, together with integrity constraints over beliefs and disbeliefs. Our translation method not only provides a simple fixpoint characterization of answer sets, but also is very helpful to understand under what conditions each model is “stable” or “unstable”. The procedure has been implemented on top of the model generation theorem prover MGTP on a parallel inference machine, and has been applied to a legal reasoning system.

Original languageEnglish
Title of host publicationAutomated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings
EditorsDeepak Kapur
PublisherSpringer Verlag
Number of pages16
ISBN (Print)9783540556022
Publication statusPublished - 1992
Externally publishedYes
Event11th International Conference on Automated Deduction, CADE, 1992 - Saratoga Springs, United States
Duration: Jun 15 1992Jun 18 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume607 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other11th International Conference on Automated Deduction, CADE, 1992
Country/TerritoryUnited States
CitySaratoga Springs

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Embedding negation as failure into a model generation theorem prover'. Together they form a unique fingerprint.

Cite this