http://tinf2.vub.ac.be/~dvermeir/courses/thesis/argumentation_frameworks.pdf

On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n -person games

https://pure.mpg.de/pubman/item/item_1819068_3/component/file_1840695/MPI-I-2007-5-003.pdf

YAGO: A Large Ontology from Wikipedia and WordNet

The work reported here introduces Defeasible Logic Programming (DeLP), a formalism that combines results of Logic Programming and Defeasible Argumentation. DeLP provides the possibility of representing information in the form of weak rules in a declarative manner, and a defeasible argumentation inference mechanism for warranting the entailed conclusions. In DeLP an argumentation formalism will be used for deciding between contradictory goals. Queries will be supported by arguments that could be defeated by other arguments. A query $q$ will succeed when there is an argument ${\mathcal A}$ for $q$ that is warranted, i.e. the argument ${\mathcal A}$ that supports $q$ is found undefeated by a warrant procedure that implements a dialectical analysis. The defeasible argumentation basis of DeLP allows to build applications that deal with incomplete and contradictory information in dynamic domains. Thus, the resulting approach is suitable for representing agent's knowledge and for providing an argumentation based reasoning mechanism to agents.

/pdf/defeasible-logic-programming-an-argumentative-approach-4dhoye3g1q.pdf

Defeasible logic programming: an argumentative approach

In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs We demonstrate that inherent features of stable model semantics naturally lead to a logic programming system that offers an interesting alternative to more traditional logic programming styles of Horn logic programming, stratified logic programming and logic programming with well-founded semantics The proposed approach is based on the interpretation of program clauses as constraints In this setting, a program does not describe a single intended model, but a family of its stable models These stable models encode solutions to the constraint satisfaction problem described by the program Our approach imposes restrictions on the syntax of logic programs In particular, function symbols are eliminated from the language We argue that the resulting logic programming system is well-attuned to problems in the class NP, has a well-defined domain of applications, and an emerging methodology of programming We point out that what makes the whole approach viable is recent progress in implementations of algorithms to compute stable models of propositional logic programs

/pdf/stable-models-and-an-alternative-logic-programming-paradigm-4iahvmu876.pdf

Stable Models and an Alternative Logic Programming Paradigm

This article surveys various complexity and expressiveness results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results on plain logic programming (pure Horn clause programs), more recent results on various important extensions of logic programming are surveyed. These include logic programming with different forms of negation, disjunctive logic programming, logic programming with equality, and constraint logic programming.

/pdf/complexity-and-expressive-power-of-logic-programming-334cjkp9dg.pdf

Complexity and expressive power of logic programming

In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow default negation not only in rule bodies but also in their heads. We start by introducing the notion of an update P U of one logic program P by another logic program U. Subsequently, we provide a precise semantic characterization of P U , and study some basic properties of program updates. In particular, we show that our update programs generalize the notion of interpretation update. We then extend this notion to compositional sequences of logic programs updates P1 P2 ; defining a dynamic program update, and thereby introducing the paradigm of dynamic logic programming. This paradigm significantly facilitates modularization of logic programming, and thus modularization of non-monotonic reasoning as a whole. Specifically, suppose that we are given a set of logic program modules, each describing a diAerent state of our knowledge of the world. DiAerent states may represent diAerent time points or diAerent sets of priorities or perhaps even diAerent viewpoints. Consequently, program modules may contain mutually contradictory as well as overlapping information. The role of the dynamic program update is to employ the mutual relationships existing between diAerent modules to precisely determine, at any given module composition stage, the declarative as well as the procedural semantics of the combined program resulting from the modules. ” 2000 Elsevier Science Inc. All rights reserved.

Dynamic updates of non-monotonic knowledge bases

/pdf/well-founded-semantics-for-logic-programs-with-explicit-3ocz7t4jtc.pdf

Well founded semantics for logic programs with explicit negation

Normal logic programs.- Extended logic programs.- Why a new semantics for extended programs?.- WFSX - A well founded semantics for extended logic programs.- WFSX, LP semantics with two negations, and autoepistemic logics.- WFSX and default logic.- WFSX and hypotheses abduction.- Dealing with contradiction.- Further properties and comparisons.- Top-down derivation procedures for WFSX.- Application to classical nonmonotonic reasoning problems.- Application to diagnosis and debugging.

Reasoning with Logic Programming

Logic programming has often been considered less than adequate for modelling the dynamics of knowledge changing over time. In this paper we describe a simple though quite powerful approach to modelling the updates of knowledge bases expressed by generalized logic programs, by means of a new language, hereby christened EVOLP (after EVOlving Logic Programs). The approach was first sparked by a critical analysis of previous efforts and results in this direction [1,2,7,11], and aims to provide a simpler, and at once more general, formulation of logic program updating, which runs closer to traditional logic programming (LP) doctrine. From the syntactical point of view, evolving programs are just generalized logic programs (i.e. normal LPs plus default negation also in rule heads), extended with (possibly nested) assertions, whether in heads or bodies of rules. From the semantics viewpoint, a model-theoretic characterization is offered of the possible evolutions of such programs. These evolutions arise both from self (or internal) updating, and from external updating too, originating in the environment. This formulation sets evolving programs on a firm basis in which to express, implement, and reason about dynamic knowledge bases, and opens up a number of interesting research topics that we brush on.

/pdf/evolving-logic-programs-1k2ndwwfte.pdf

Evolving Logic Programs

https://corescholar.libraries.wright.edu/cgi/viewcontent.cgi?article=1116&context=cse

José Júlio Alferes

Papers

Dynamic updates of non-monotonic knowledge bases

Well founded semantics for logic programs with explicit negation

Reasoning with Logic Programming

Evolving Logic Programs

Local closed world reasoning with description logics under the well-founded semantics