An abductive framework for computing knowledge base updates

Sakama, Chiaki; Inoue, Katsumi

doi:10.1017/s1471068403001716

Cited by 56 publications

(72 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Representative work includes [31,2,20,14,26,30,11]. Strictly speaking, however, such approaches generally do not address "update," at least insofar as the term is understood in the belief revision community, but rather general change to a logic program.…”

Section: Belief Change In Logic Programmingmentioning

confidence: 99%

AGM-Style Belief Revision of Logic Programs under Answer Set Semantics

Delgrande

Peppas

Woltran

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In the past few years, several approaches for revision (and update) of logic programs have been studied. None of these however matched the generality and elegance of the original AGM approach to revision in classical logic. One particular obstacle is the underlying nonmonotonicity of the semantics of logic programs. Recently however, specific revision operators based on the monotonic concept of SE-models (which underlies the answer-set semantics of logic programs) have been proposed. Basing revision of logic programs on sets of SEmodels has the drawback that arbitrary sets of SE-models may not necessarily be expressed via a logic program. This situation is similar to the emerging topic of revision in fragments of classical logic. In this paper we show how nonetheless classical AGM-style revision can be extended to various classes of logic programs using the concept of SE-models. That is, we rephrase the AGM postulates in terms of logic programs, provide a semantic construction for revision operators, and then in a representation result show that these approaches coincide. This work is interesting because, on the one hand it shows how the AGM approach can be extended to a seemingly nonmonotonic framework, while on the other hand the formal characterization may provide guiding principles for the development of specific revision operators.

show abstract

Section: Belief Change In Logic Programmingmentioning

confidence: 99%

AGM-Style Belief Revision of Logic Programs under Answer Set Semantics

Delgrande

Peppas

Woltran

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This definition follows the ideas of abductive programs introduced in [14]. Hence, by considering this definition an abductive argument is defined as follows:…”

Section: B Abductive Argumentation Frameworkmentioning

confidence: 99%

Merging Deductive and Abductive Knowledge Bases: An Argumentation Context Approach

Nieves¹,

Lindgren²

2013

Polibits

View full text Add to dashboard Cite

Abstract-The consideration of heterogenous knowledge sources for supporting decision making is key to accomplish informed decisions, e.g., about medical diagnosis. Consequently, merging different data from different knowledge bases is a key issue for providing support for decision-making. In this paper, we explore an argumentation context approach, which follows how medical professionals typically reason, in order to merge two basic kinds of reasoning approaches based on logic programs: deductive and abductive inferences. In this setting, we introduce two kinds of argumentation frameworks: deductive argumentation frameworks and abductive argumentation frameworks. For merging these argumentation frameworks, we follow an approach based on argumentation context systems. We illustrate the approach by considering two different declarative specifications of evidence-based medical knowledge into logic programs in order to support informed medical decisions.

show abstract

“…The rule (14) represents that if a HDD with 200G is unavailable under the budget, the buyer would have an option of downgrading the specification. The rule (15) represents that the original request is withdrawn if the specification changes. P b has two answer sets: Several studies use logic-based abduction or abductive logic programming [7] as a representation language of negotiating agents [9,14,16].…”

Section: Computing Proposalsmentioning

confidence: 99%

Inductive Negotiation in Answer Set Programming

Sakama

2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. This paper provides a logical framework of negotiating agents who have capabilities of evaluating and building proposals. Given a proposal, an agent decides whether it is acceptable or not. If the proposal is unacceptable as it is, the agent seeks conditions to accept it. This attitude is captured as a process of making hypotheses by induction. If an agent fails to find a hypothesis, it would concede by giving up some of its current belief. This attitude is characterized using default reasoning. We provide a logical framework of such think-act cycle of an agent, and develop a method for computing proposals using answer set programming.

show abstract

An abductive framework for computing knowledge base updates

Cited by 56 publications

References 54 publications

AGM-Style Belief Revision of Logic Programs under Answer Set Semantics

AGM-Style Belief Revision of Logic Programs under Answer Set Semantics

Merging Deductive and Abductive Knowledge Bases: An Argumentation Context Approach

Inductive Negotiation in Answer Set Programming

Contact Info

Product

Resources

About