Lu#s Moniz Pereira, Jose Julio Alferes, and Joaquim Apar#cio. Contradiction Removal within Well Founded Semantics. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, Logic Programming and Nonmonotonic Reasoning, pages 105--119, Washington, USA, June 1991. MIT Press.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... semantics with a form of explicit negation and constraints [PA92] and showed that the richer language, called WFSX, is appropriate for a spate of knowledge representation and reasoning forms [PAA93, PDA93, ADP95] In particular, the technique of contradiction removal of extended logic programs [PAA91] opens up many avenues in model based diagnosis [PDA93, DNP94, DNPS95, DPS96, SdAMP96, SW96] Definition 4.1 Extended Logic Program An extended logic program is a (possibly infinite) set of rules of the form L 0 L 1 ; Lm ; notLm 1 ; notLn (0 m n) where each L i is an ....

Lu'is Moniz Pereira, Jos'e J'ulio Alferes, and Joaquim Apar'icio. Contradiction Removal within Well Founded Semantics. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, Logic Programming and Nonmonotonic Reasoning, pages 105--119, Washington, USA, June 1991. MIT Press.

....recently established the relationship between Fagin et al. s [ 1983 ] update and default autoepistemic logic, but they do not discuss the issue of updating nonmonotonic theories. There are some proposals for removing inconsistency from logic programs with negation as failure. Those approaches in [ Pereira et al. 1991; Giordano and Martelli, 1990; Witteveen et al. 1994 ] recover consistency by adding some new formulas, while [ Inoue, 1994 ] discards some beliefs to this effect. In contrast to them, our framework performs update by both inserting and deleting hypotheses based on the extended abductive ....

Lu'is Moniz Pereira, Joaquim Nunes Apar'icio, and Jos'e J'ulio Alferes. Contradiction removal within well-founded semantics. In: A. Nerode, W. Marek and V. S. Subrahmanian (eds.), Proceedings of the 1st International Workshop on Logic Programming and Non-monotonic Reasoning, pages 105--119, MIT Press, 1991.

.... semantics with a form of explicit negation and constraints [PA92] and showed that the richer language, called WFSX, is appropriate for a spate of knowledge representation and reasoning forms [PAA93,PDA93,ADP95] In particular, the technique of contradiction removal from extended logic programs [PAA91] opens up many avenues in model based diagnosis [PDA93,DNP94,DNPS95,MA95] Definition 1. Extended Logic Program An extended logic program is a (possibly infinite) set of rules of the form L 0 L 1 ; notL n (0 m n) where each L i is an objective literal (0 i n) An objective ....

Lu#s Moniz Pereira, Jose Julio Alferes, and Joaquim Apar#cio. Contradiction Removal within Well Founded Semantics. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, Logic Programming and Nonmonotonic Reasoning, pages 105--119, Washington, USA, June 1991. MIT Press.

....soundness) of these procedures is discussed. Example derivations are exhibited, as well as a simple Prolog implementation that directly mirrors the procedures. 1 Introduction Well Founded Semantics (WFS) Van Gelder et al. 1990 ] adequately captures various forms of hypothetical reasoning [ Pereira et al. 1991c, Pereira et al. 1991d, Pereira et al. 1991b, Pereira et al. 1991a ] if we interpret the well founded model (WFM) of a program Pi as a (possibly incomplete) core view of the world, the extended stable models (XSMs) specifying alternative complementary consistent views of the world, all of ....

....procedures is discussed. Example derivations are exhibited, as well as a simple Prolog implementation that directly mirrors the procedures. 1 Introduction Well Founded Semantics (WFS) Van Gelder et al. 1990 ] adequately captures various forms of hypothetical reasoning [ Pereira et al. 1991c, Pereira et al. 1991d, Pereira et al. 1991b, Pereira et al. 1991a ] if we interpret the well founded model (WFM) of a program Pi as a (possibly incomplete) core view of the world, the extended stable models (XSMs) specifying alternative complementary consistent views of the world, all of each containing the core ....

[Article contains additional citation context not shown here]

Lu'is M. Pereira, Jos'e J. Alferes, and Joaquim N. Apar'icio. Contradiction removal within Well Founded Semantics. In First Logic Programming and Non-Monotonic Reasoning Workshop. MIT Press, 1991.

.... semantics with a form of explicit negation and constraints [PA92] and showed that the richer language, called WFSX, is appropriate for a spate of knowledge representation and reasoning forms [PAA93, PDA93, ADP95] In particular, the technique of contradiction removal of extended logic programs [PAA91] opens up many avenues in modelbased diagnosis [PDA93, DNP94, DNPS95, DPS96] Definition 1. Extended Logic Program An extended logic program is a (possibly infinite) set of rules of the form L 0 L 1 ; Lm ; notLm 1 ; notLn (0 m n) where each L i is an objective literal (0 ....

Lu'is Moniz Pereira, Jos'e J'ulio Alferes, and Joaquim Apar'icio. Contradiction Removal within Well Founded Semantics. In A. Nerode, W. Marek, and V. S. Subrahmanian, editors, Logic Programming and Nonmonotonic Reasoning, pages 105--119, Washington, USA, June 1991. MIT Press.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC