52 citations · 137 across the 11 of their papers we have counts for
Showing 2000Show all
2 papers · 1 filter
cs.AI2000★ 1 cited
Consistency Management of Normal Logic Program by Top-down Abductive Proof Procedure
Ken Satoh
This paper presents a method of computing a revision of a function-free normal logic program. If an added rule is inconsistent with a program, that is, if it leads to a situation s…
cs.AI2000
Computing Circumscriptive Databases by Integer Programming: Revisited (Extended Abstract)
Ken Satoh, Hidenori Okamoto
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axioms…