×

Semantics for possibilistic disjunctive programs. (English) Zbl 1272.68081

Summary: In this paper, a possibilistic disjunctive logic programming approach for modeling uncertain, incomplete, and inconsistent information is defined. This approach introduces the use of possibilistic disjunctive clauses, which are able to capture incomplete information and states of a knowledge base at the same time. By considering a possibilistic logic program as a possibilistic logic theory, a construction of a possibilistic logic programming semantic based on answer sets and the proof theory of possibilistic logic is defined. It shows that this possibilistic semantics for disjunctive logic programs can be characterized by a fixed-point operator.
It is also shown that the suggested possibilistic semantics can be computed by a resolution algorithm and the consideration of optimal refutations from a possibilistic logic theory. In order to manage inconsistent possibilistic logic programs, a preference criterion between inconsistent possibilistic models is defined. In addition, the approach of cuts for restoring consistency of an inconsistent possibilistic knowledge base is adopted. The approach is illustrated in a medical scenario.

MSC:

68N17 Logic programming
03B70 Logic in computer science
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Costantini, Answer Set Programming: Advances in Theory and Implementation pp 271– (2007)
[2] DOI: 10.1016/0743-1066(86)90003-8 · Zbl 0609.68068 · doi:10.1016/0743-1066(86)90003-8
[3] Baral, Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-07) pp 315– (2007) · Zbl 1149.68337 · doi:10.1007/978-3-540-72200-7_32
[4] DOI: 10.1023/A:1005952908693 · Zbl 0893.68026 · doi:10.1023/A:1005952908693
[5] DOI: 10.1016/S0743-1066(96)00115-X · Zbl 0883.68082 · doi:10.1016/S0743-1066(96)00115-X
[6] DOI: 10.1007/s10472-006-9029-y · Zbl 1105.68104 · doi:10.1007/s10472-006-9029-y
[7] Angulo, Proceedings of 10th International Conference of the CCIA pp 11– (2007)
[8] DOI: 10.1017/S1471068408003645 · Zbl 1170.68003 · doi:10.1017/S1471068408003645
[9] DOI: 10.1016/0890-5401(92)90061-J · Zbl 0781.68038 · doi:10.1016/0890-5401(92)90061-J
[10] Knowledge Representation, Reasoning and Declarative Problem Solving (2003) · Zbl 1056.68139
[11] AI Communications 13 pp 225– (2000)
[12] DOI: 10.1016/0165-0114(87)90110-2 · Zbl 0639.68105 · doi:10.1016/0165-0114(87)90110-2
[13] 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR) pp 336– (2001)
[14] DOI: 10.1002/int.10069 · Zbl 1021.68022 · doi:10.1002/int.10069
[15] 13th European Conference on Artificial Intelligence, (ECAI) pp 388– (1998)
[16] Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence pp 1– (2000)
[17] Proceedings of XVI International Congress of the Transplantation Society pp 1607– (1997)
[18] DOI: 10.1016/j.fss.2007.12.013 · Zbl 1187.68601 · doi:10.1016/j.fss.2007.12.013
[19] Clinical Transplantation, Blackwell Munksgaard 17 pp 308– (2003) · doi:10.1034/j.1399-0012.2003.00119.x
[20] DOI: 10.1016/0743-1066(92)90007-P · doi:10.1016/0743-1066(92)90007-P
[21] DOI: 10.1016/j.artint.2004.04.003 · Zbl 1085.68170 · doi:10.1016/j.artint.2004.04.003
[22] DOI: 10.1007/BF03037535 · Zbl 0973.68028 · doi:10.1007/BF03037535
[23] DOI: 10.1007/BF03037169 · doi:10.1007/BF03037169
[24] Kowalski, 5th Conference on Logic Programming pp 1070– (1988)
[25] Handbook of Knowledge Representation pp 285– (2008)
[26] Hitchcock, Arguing on the Toulmin Model: New Essays on Argument Analysis and Evaluation pp 273– (2006) · doi:10.1007/978-1-4020-4938-5_18
[27] Safe and Sound: Artificial Intelligence in Hazardous Applications (2000)
[28] DOI: 10.1016/0743-1066(91)90014-G · Zbl 0757.68028 · doi:10.1016/0743-1066(91)90014-G
[29] DOI: 10.1016/j.fss.2003.10.011 · Zbl 1076.68084 · doi:10.1016/j.fss.2003.10.011
[30] Gabbay, Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3: Nonmonotonic Reasoning and Uncertain Reasoning pp 439– (1994)
[31] Furukawa, International Conference on Logic Programming (ICLP) pp 581– (1991)
[32] DOI: 10.1007/s10472-007-9080-3 · Zbl 1125.68118 · doi:10.1007/s10472-007-9080-3
[33] DOI: 10.1016/S0168-0072(00)00044-0 · Zbl 0980.68069 · doi:10.1016/S0168-0072(00)00044-0
[34] Fundamenta Informaticae 22 pp 257– (1995)
[35] Logic and Structure (1994) · doi:10.1007/978-3-662-02962-6
[36] Fundamenta Informaticae 22 pp 227– (1995)
[37] Judgment Under Uncertainty: Heuristics and Biases pp 3– (1982) · doi:10.1017/CBO9780511809477.002
[38] Introduction to Lattices and Order (2002) · Zbl 1002.06001 · doi:10.1017/CBO9780511809088
[39] DOI: 10.2140/pjm.1955.5.285 · Zbl 0064.26004 · doi:10.2140/pjm.1955.5.285
[40] FoIKS pp 133– (2010)
[41] Garrigue, 9th International Symposium, FLOPS pp 272– (2008)
[42] Knowledge and Inquiry: Essays on the Pragmatism of Isaac Levi pp 70– (2006) · doi:10.1017/CBO9780511584312.007
[43] DOI: 10.1016/S0743-1066(98)10015-8 · Zbl 0911.68136 · doi:10.1016/S0743-1066(98)10015-8
[44] Theory and Practice of Logic Programming (TPLP) 4 pp 225– (2004)
[45] Journal of Logic Programming 38 pp 167– (1999)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.