AbstractIn order to express incomplete knowledge, extended logic programs have been proposed as logic programs with classical negation along with negation as failure. This paper discusses ways to deal with a broad class of common sense knowledge by using extended logic programs. For this purpose, we present a uniform approach for dealing with both incomplete and contradictory programs, as a simple framework of hypothetical reasoning in which some rules are dealt with as candidate hypotheses that can be used to augment the background theory. This theory formation framework can be used for default reasoning, contradiction removals, the closed world assumption, and abduction. We also show a translation of the theory formation framework to an e...
AbstractLogic programs are considered as abductive programs with negative literals as abductive hypo...
AbstractOur purpose is to exhibit a modular systematic method of representing non-monotonic reasonin...
Abstract: Well Founded Semantics is shown adequate to capture hypothetical reasoning if we interpret...
This paper deals with contradictory information in common-sense reasoning. It is often the case that...
This paper describes the logical and philosophical background of an extension of logic programming w...
AbstractWe introduce a logic programming language which supports hypothetical and counterfactual rea...
In this dissertation, we investigate how commonsense reasoning can be formalized by using extended l...
We introduce a fixpoint semantics for logic programs with two kinds of negation: an explicit negatio...
Logic programming has been explored ad recognized as a language suitable for knowledge representatio...
In this chapter, it is discussed to which extent hypothetical reasoning can be modeled by formal log...
The purpose of this paper is to expand the syntax and semantics of logic programs and disjunctive da...
In this paper, it is discussed to which extent hypothetical reasoning can be modeled by formal logic...
An important limitation of traditional logic programming as a knowledge representation tool, in comp...
AbstractThis paper deals with logic programs containing two kinds of negation: negation as failure a...
Logic programming has been introduced as programming in the Horn clause subset of first-order logic....
AbstractLogic programs are considered as abductive programs with negative literals as abductive hypo...
AbstractOur purpose is to exhibit a modular systematic method of representing non-monotonic reasonin...
Abstract: Well Founded Semantics is shown adequate to capture hypothetical reasoning if we interpret...
This paper deals with contradictory information in common-sense reasoning. It is often the case that...
This paper describes the logical and philosophical background of an extension of logic programming w...
AbstractWe introduce a logic programming language which supports hypothetical and counterfactual rea...
In this dissertation, we investigate how commonsense reasoning can be formalized by using extended l...
We introduce a fixpoint semantics for logic programs with two kinds of negation: an explicit negatio...
Logic programming has been explored ad recognized as a language suitable for knowledge representatio...
In this chapter, it is discussed to which extent hypothetical reasoning can be modeled by formal log...
The purpose of this paper is to expand the syntax and semantics of logic programs and disjunctive da...
In this paper, it is discussed to which extent hypothetical reasoning can be modeled by formal logic...
An important limitation of traditional logic programming as a knowledge representation tool, in comp...
AbstractThis paper deals with logic programs containing two kinds of negation: negation as failure a...
Logic programming has been introduced as programming in the Horn clause subset of first-order logic....
AbstractLogic programs are considered as abductive programs with negative literals as abductive hypo...
AbstractOur purpose is to exhibit a modular systematic method of representing non-monotonic reasonin...
Abstract: Well Founded Semantics is shown adequate to capture hypothetical reasoning if we interpret...