DocumentCode :
2175050
Title :
Possibilistic Stratified Minimal Model Semantics
Author :
Nieves, Juan Carlos ; Osorio, Mauricio
Author_Institution :
Software Dept., Univ. Politec. de Catalunya, Barcelona, Spain
fYear :
2009
fDate :
21-25 Sept. 2009
Firstpage :
33
Lastpage :
41
Abstract :
In this paper, we introduce a recursive construction of a possibilistic logic programming semantics that we call Possibilistic Stratified Minimal Model Semantics. We show that this semantics has some interesting properties such as it is always defined and satisfies relevance. One of the main implications of satisfying relevance by this semantics is that it will allow performing top-down queries from a possibilistic knowledge base.
Keywords :
logic programming; nonmonotonic reasoning; possibility theory; programming language semantics; query processing; nonmonotonic reasoning; possibilistic knowledge base; possibilistic logic programming semantics; possibilistic stratified minimal model semantics; semantic relevance; top-down query; Application specific processors; Computer science; Decision making; Fuzzy logic; Fuzzy sets; Logic programming; Rivers; Uncertainty; Minimal Models; Non-monotonic reasoning; Possibilistic Reasoning;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Science (ENC), 2009 Mexican International Conference on
Conference_Location :
Mexico City
Print_ISBN :
978-1-4244-5258-3
Type :
conf
DOI :
10.1109/ENC.2009.14
Filename :
5452467
Link To Document :
بازگشت