Consistency Property of Finite FC-Normal Logic Programs
โ Scribed by Yi-Song Wang; Ming-Yi Zhang; Yu-Ping Shen
- Publisher
- Springer
- Year
- 2007
- Tongue
- English
- Weight
- 856 KB
- Volume
- 22
- Category
- Article
- ISSN
- 1000-9000
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Compositionality of programs is an important concern in knowledge representation and software development. In the context of Logic Programming, up till now, the issue has mostly been studied for deยฎnite programs only. Here, we study compositionality in the context of normal open logic programming. T
This paper relates the Defeasible Logic Programming (DeLP) framework and its semantics SEMDeLP to classical logic programming frameworks. In DeLP, we distinguish between two di erent sorts of rules: strict and defeasible rules. Negative literals (โผ A) in these rules are considered to represent class
Despite the frequent comment that there is no general agreement on the semantics of logic programs, this paper shows that a number of independently proposed extensions to the stable model semantics coincide: the regular model semantics proposed by You and Yuan, the partial stable model semantics by