论文信息 - Well-Founded semantics for Semi-Normal Extended Logic Programs

Well-Founded semantics for Semi-Normal Extended Logic Programs

In this paper we present a new approach for applying well-founded semantics to extended logic programs. The main idea is not to fundamentally change the definition of well-founded semantics (as others have attempted) but rather to define a few restrictions on the content of the extended logic program, that make it possible to apply “traditional” well-founded semantics in a very straightforward way.

Martin Caminada

[1] Henry Prakken,et al. Argument-Based Extended Logic Programming with Defeasible Priorities , 1997, J. Appl. Non Class. Logics.

[2] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.

[3] Michael Gelfond,et al. Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[4] Phan Minh Dung,et al. On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[5] Donald Nute,et al. Defeasible Logic , 1994, INAP.

[6] John L. Pollock,et al. How to Reason Defeasibly , 1992, Artif. Intell..

[7] Guillermo Ricardo Simari,et al. Defeasible logic programming: an argumentative approach , 2003, Theory and Practice of Logic Programming.

[8] Chiaki Sakama,et al. Extended Well-Founded Semantics for Paraconsistent Logic Programs , 1992, FGCS.

[9] Gerhard Brewka. Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences , 1996, J. Artif. Intell. Res..

[10] Martin Caminada,et al. An Axiomatic Account of Formal Argumentation , 2005, BNAIC.

[11] Jürgen Dix,et al. A Classification Theory of Semantics of Normal Logic Programs: II. Weak Properties , 1995, Fundam. Informaticae.

[12] Jürgen Dix,et al. A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties , 1995, Fundam. Informaticae.