Paper Info
Title
Semantics of Non-montonic Reasoning based on Perfect Model
Abstract
Because of the lack of general semantics for non-monotonic formalisms, the relationship between the major forms of non-monotonic formalisms has not been understood very well. Recently, it has been proposed by C.Przymusinski that perfect model semantics for logic programming is also suitable for some special cases of non-monotonic formalisms. The importance of this result is not only for shedding new light on these two fields, but also for establishing a close relationship between main forms of non-monotonic formalisms. However, these understandings are achieved only in stratified programs. In this paper, we introduce a new class of programs called conditional programs, define its declarative semantics by least exceptional models, show its relation with perfect model semantics and non-monotonic logics, and give a procedure about how to transform a conditional program into a general program. This new semantics of conditional programs shares a lot of common characteristics with logic programming and non-monotonic reasoning, such as priorities between predicates, minimizing extensions of predicates, and minimizing abnormality. A better understanding about the relationship between forms of non-monotonic formalisms can be achieved by least exceptional model semantics of conditional programs.
Year
DOI
Venue
1989
10.1007/3-540-53919-0_3
LP
Keywords
Field
DocType
generic programming
Automated reasoning,Computer science,Theoretical computer science,Non-monotonic logic,Deductive reasoning,Stable model semantics,Logic programming,Reasoning system,Rotation formalisms in three dimensions,Semantics
Conference
Citations 
PageRank 
References 
0
0.34
4
Authors
2
Name
Order
Citations
PageRank
Fangqing Dong1327.97
Hiroshi Nakagawa200.34