Katsumi Inoue

Learn More
Representing and reasoning with priorities are important in commonsense reasoning. This paper introduces a framework of prioritized logic programming (PLP), which has a mechanism of explicit representation of priority information in a program. When a program contains incomplete or indefinite information, PLP is useful for specifying preference to reduce(More)
In this paper, we study a new semantics of logic programming and deductive databases. Thepossible model semantics is introduced as a declarative semantics of disjunctive logic programs. The possible model semantics is an alternative theoretical framework to the classical minimal model semantics and provides a flexible inference mechanism for inferring(More)
Reasoning with priorities is a central topic in knowledge representation. A number of techniques for prioritized reasoning have been developed in the eld of AI, but existing logic programming lacks the mechanism of explicit representation of priorities in a program. In this paper, we introduce a framework for representing priorities in logic programming.(More)
A program is regarded as the constraints to be satisfied by solutions. Each solution is obtained by computing an answer set of the program. a Programs P 1 and P 2 are strongly equivalent if for any program R, P 1 ∪ R and P 2 ∪ R have the same answer sets. a Strong equivalence can be used to simplify a part of logic program without looking at the other part.(More)
The class of logic programs with negation as failure in the head is a subset of the logic of MBNF introduced by Lifschitz and is an extension of the class of extended disjunctive programs. An interesting feature of such programs is that the minimality of answer sets does not hold. This paper considers the class of general extended disjunctive programs(More)