Approximate well-founded semantics, query answering and generalized normal logic programs over lattices

Annals of Mathematics and Artificial Intelligence

Volumn 55, Issue 3-4, 2009, Pages 389-417

  Loyer, Yann ^a   Straccia, Umberto ^b  

^a UNIVERSITY OF VERSAILLES   (France)

^b CNR   (Italy)

Author keywords

Logic programming; Many valued logic; Nonmonotonic logic

Indexed keywords

EID: 72149113352     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-008-9099-0     Document Type: Article

References (146)

1. Alsinet, T., Godo, L.: Towards an automated deduction system for first-order possibilistic logic programming with fuzzy constants. Int. J. Intell. Syst. 17(9), 887-924 (2002).
2. Alsinet, T., Godo, L., Sandri, S.: On the semantics and automated deduction fo PLFC, a logic of possibilistic uncertainty and fuzzyness. In: Proceedings of the 15th Annual Conference on Uncertainty in Artificial Intelligence (UAI-99). Morgan Kaufmann, San Francisco (1999).
3. Alsinet, T., Godo, L.: A complete calcultis for possibilistic logic programming with fuzzy propositional variables with fuzzy propositional variables. In: Proceedings of the 16th Conference in Uncertainty in Artificial Intelligence (UAI-00), pp. 1-10. Morgan Kaufmann, San Francisco (2000).
4. Baldwin, J. F.: Evidential support of logic programming. Fuzzy Sets Syst. 24(1), 1-26 (1987).
5. Baldwin, J. F.: A theory of mass assignments for artificial intelligence. Lect. Notes Comput. Sci. 833, 22-34 (1994).
6. Baldwin, J. F., Martin, T. P., Pilsworth, B. W.: Fril-Fuzzy and Evidential Reasoning in Artificial Intelligence. Research Studies, Taunton (1995).
7. Baldwin, J. F., Martin, T. P., Pilsworth, B. W.: Applications of fuzzy computation: knowledge based systems: knowledge representation. In: Ruspini, E. H., Bonnissone, P., Pedrycz, W. (eds.) Handbook of Fuzzy Computing. IOP, Bristol (1998).
8. Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J. D.: Magic sets and other strange ways to implement logic programs (extended abstract). In: Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (PODS-86), New York, NY, USA, pp. 1-15. ACM, New York (1986).
9. Baral, C., Gelfond, M., Rushton, N.: Probabilistic reasoning with answer sets. In: Proceedings of the 7th International Conference in Logic Programming and Nonmonotonic Reasoning (LPNMR-04). Lecture Notes in Artificial Intelligence, Fort Lauderdale, FL, USA, No. 2923 pp. 21-33. Springer, Berlin Heidelberg New York (2004).
10. Belnap, N. D.: How a computer should think. In: Ryle, G. (ed.) Contemporary Aspects of Philosophy, pp. 30-56. Oriel, Stocksfield (1977).
11. Bueno, F., Cabeza, D., Carro, M., Hermenegildo, M., López-García, P., Puebla, G.: The Ciao prolog system. Reference manual. Technical Report CLIPS3/97. 1, School of Computer Science, Technical University of Madrid (UPM) (1997). http://www.cliplab.org/Software/Ciao/.
12. Calmet, J., Lu, J., Rodriguez, M., Schü, J.: Signed formula logic programming: operational semantics and applications. In: Rás, Z. W., Michalewicz, M. (eds.) Proceedings of the Ninth International Symposium on Foundations of Intelligent Systems. LNAI, Berlin, vol. 1079, pp. 202-211, 9-13. Springer, Berlin Heidelberg New York (1996).
13. Cao, T. H.: Annotated fuzzy logic programs. Fuzzy Sets Syst. 113(2), 277-298 (2000).
14. Chesnevar, C., Simari, G., Alsinet, T., Godo, L.: A logic programming framework for possibilistic argumentation with vague knowledge. In: Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence (UAI-04), Arlington, Virginia, pp. 76-84. AUAI, Arlington (2004).
15. Chortaras, A., Stamou, G. B., Stafylopatis, A.: Integrated query answering with weighted fuzzy rules. In: 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU-07). Lecture Notes in Computer Science, No. 4724 pp. 767-778. Springer, Berlin Heidelberg New York (2007).
16. Damásio, C. V., Pereira, L. M.: Hybrid probabilistic logic programs as residuated logic programs. Stud. Log. 72(1), 113-138 (2002).
17. Damásio, C. V., Medina, J., Ojeda Aciego, M.: Sorted multi-adjoint logic programs: Termination results and applications. In: Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA-04). Lecture Notes in Computer Science, No. 3229 pp. 252-265. Springer, Berlin Heidelberg New York (2004).
18. Damásio, C. V., Medina, J., Ojeda Aciego, M.: A tabulation proof procedure for residuated logic programming. In: Proceedings of the 6th European Conference on Artificial Intelligence (ECAI-04), Valencia, 22-27 August 2004.
19. Damásio, C. V., Medina, J., Ojeda Aciego, M.: Termination results for sorted multi-adjoint logic programs. In: Proceedings of the 10th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, (IPMU-04), pp. 1879-1886, Perugia, 4-9 July 2004.
20. Damásio, C. V., Pereira, L. M.: A survey of paraconsistent semantics for logic programs. In: Gabbay, D., Smets, P. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems, pp. 241-320. Kluwer, Deventer (1998).
21. Damásio, C. V., Pereira, L. M.: Antitonic logic programs. In: Proceedings of the 6th European Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-01). Lecture Notes in Computer Science, No. 2173. Springer, Berlin Heidelberg New York (2001).
22. Damásio, C. V., Pereira, L. M.: Monotonic and residuated logic programs. In: Benferhat, S., Besnard, P. (eds.) Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 6th European Conference, ECSQARU 2001, Toulouse, France, 19-21 September 2001. Proceedings, Lecture Notes in Computer Science, vol. 2143, pp. 748-759. Springer, Berlin Heidelberg New York (2001).
23. Damásio, C. V., Pereira, L. M.: Sorted monotonic logic programs and their embeddings. In: Proceedings of the 10th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, (IPMU-04), pp. 807-814, Perugia, 4-9 July 2004.
24. Damásio, C. V., Medina, J., Ojeda-Aciego, M.: Termination of logic programs with imperfect information: applications and query procedure. J. Appl. Logic 5(3), 435-458 (2007) September.
25. Damásio, C. V., Medina, M., Ojeda-Aciego, J.: A tabulation procedure for first-order residuated logic programs. In: Proceedings of the 11th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, (IPMU-06), Paris, 2-7 July 2006.
26. Damásio, C. V., Medina, M., Ojeda-Aciego, J.: Termination of logic programs with imperfect information: applications and query procedure. J. Appl. Logic. 7(5), 435-458 (2007).
27. Dekhtyar, A., Dekhtyar, M. I.: Possible worlds semantics for probabilistic logic programs. In: 20th International Conference on Logic Programming. Lecture Notes in Computer Science, vol. 3132, pp. 137-148. Springer, Berlin Heidelberg New York (2004).
28. Dekhtyar, A., Dekhtyar, M. I.: Revisiting the semantics of interval probabilistic logic programs. In: 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-05). Lecture Notes in Computer Science, No. 3662, pp. 330-342. Springer, Berlin Heidelberg New York (2005).
29. Dekhtyar, A., Dekhtyar, M. I., Subrahmanian, V. S.: Temporal probabilistic logic programs. In: De Schreye, D. (ed.) Logic Programming: The 1999 International Conference, pp. 109-123, Las Cruces, 29 November-4 December 1999.
30. Dekhtyar, A., Subrahmanian, V. S.: Hybrid probabilistic programs. J. Log. Program. 43(3), 187-250 (2000).
31. Dekhtyar, M. I., Dekhtyar, A., Subrahmanian, V. S.: Hybrid probabilistic programs: algorithms and complexity. In: Laskey, K. B., Prade, H. (eds.) Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (UAI-99), S. F., Cal., 30- 1 1999, pp. 160-169. Morgan Kaufmann, San Francisco.
32. Denecker, M., Marek, V., Truszczyński, M.: Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. In: Minker, J. (ed.) Logic-Based Artifical Intelligence, pp. 127-144. Kluwer, Deventer (2000).
33. Denecker, M., Pelov, N., Bruynooghe, M.: Ultimate well-founded and stable semantics for logic programs with aggregates. In: Codognet, P. (ed.) Logic Programming, 17th International Conference, ICLP 2001, Paphos, Cyprus, 2001 November 26-December 1. Proceedings, Lecture Notes in Computer Science, vol. 2237. Springer, Berlin Heidelberg New York (2001).
34. Denecker, M., Marek, V. W., Truszczyński, M.: Uniform semantic treatment of default and autoepistemic logics. In: Cohn, A. G., Giunchiglia, F., Selman, B. (eds.) Proceedings of the 7th International Conference on Principles of Knowledge Representation and Reasoning, pp. 74-84. Morgan Kaufman, San Francisco (2000).
35. Denecker, M., Marek, V. W., Truszczyński, M.: Ultimate approximations. Technical Report CW 320, Katholieke Iniversiteit Leuven (2001).
36. Denecker, M., Marek, V. W., Truszczyński, M.: Ultimate approximations in nonmonotonic knowledge representation systems. In: Fensel, D., Giunchiglia, F., McGuinness, D., Williams, M. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the 8th International Conference, pp. 177-188. Morgan Kaufmann, San Francisco (2002).
37. Dong, G., Libkin, L., Wong, L.: Incremental recomputation in local languages. Inf. Comput. 181(2), 88-98 (2003).
38. Dong, G., Su, J., Topor, R. W.: Nonrecursive incremental evaluation of datalog queries. Ann. Math. Artif. Intell. 14(2-4), 187-223 (1995).
39. Dubois, D., Lang, J., Prade, H.: Towards possibilistic logic programming. In: Proc. of the 8th Int. Conf. on Logic Programming (ICLP-91), pp. 581-595. MIT, Cambridge (1991).
40. Dubois, D., Prade, H.: Possibility theory, probability theory and multiple-valued logics: A clarification. Ann. Math. Artif. Intell. 32(1-4), 35-66 (2001).
41. Ebrahim, R.: Fuzzy logic programming. Fuzzy Sets Syst. 117(2), 215-230 (2001).
42. Fitting, M. C.: The family of stable models. J. Logic Program. 17, 197-225 (1993).
43. Fitting, M. C.: Fixpoint semantics for logic programming-a survey. Theor. Comp. Sci. 21(3), 25-51 (2002).
44. Fitting, M.: A Kripke-Kleene-semantics for general logic programs. J. Logic Program. 2, 295-312 (1985).
45. Fitting, M.: Pseudo-Boolean valued Prolog. Stud. Log. XLVII(2), 85-91 (1987).
46. Fitting, M.: Bilattices and the semantics of logic programming. J. Logic Program. 11, 91-116 (1991).
47. Fuhr, N.: Probabilistic Datalog: Implementing logical information retrieval for advanced applications. J. Am. Soc. Inf. Sci. 51(2), 95-110 (2000).
48. Ginsberg, M. L.: Multi-valued logics: a uniform approach to reasoning in artificial intelligence. Comput. Intell. 4, 265-316 (1988).
49. Guller, D.: Procedural semantics for fuzzy disjunctive programs. In: Baaz, M., Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning 9th International Conference, LPAR 2002, Tbilisi, Georgia, 14-18 October 2002. Proceedings, Lecture Notes in Computer Science, vol. 2514, pp. 247-261. Springer, Berlin Heidelberg New York (2002).
50. Guller, D.: Semantics for fuzzy disjunctive programs with weak similarity. In: Abraham, A., Köppen, M. (eds.) Hybrid Information Systems, First International Workshop on Hybrid Intelligent Systems, Adelaide, Australia, 2001 December 11-12, Proceedings, Advances in Soft Computing, pp. 285-299. Physica, Würzburg (2002).
51. Hähnle, R.: Uniform notation of tableaux rules for multiple-valued logics. In: Proc. International Symposium on Multiple-Valued Logic, Victoria, pp. 238-245. IEEE, Los Alamitos (1991).
52. Hinde, C. J.: Fuzzy prolog. Int. J. Man-Mach. Stud. 24, 569-595 (1986).
53. Ishizuka, M., Kanai, N.: Prolog-ELF: incorporating fuzzy logic. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence (IJCAI-85), pp. 701-703, Los Angeles, CA, 18-23 August 1985.
54. Kern-Isberner, G., Lukasiewicz, T.: Combining probabilistic logic programming with the power of maximum entropy. Artif. Intell. 157(1-2), 139-202 (2004).
55. Kersting, K., De Raedt, L.: Bayesian logic programs. In: Cussens, J., Frisch, A. M. (eds.) ILP Work-in-progress reports, 10th International Conference on Inductive Logic Programming, CEUR Workshop Proceedings. CEUR-WS. org (2000).
56. Kersting, K., De Raedt, L.: Bayesian logic programming: Theory and tools. In: Getoor, L., Taskar, B. (eds.) An Introduction to Statistical Relational Learning. MIT, Cambridge (2005).
57. Khamsi, M. A., Misane, D.: Disjunctive signed logic programs. Fundam. Inform. 32, 349-357 (1996).
58. Khamsi, M. A., Misane, D.: Fixed point theorems in logic programming. Ann. Math. Artif. Intell. 21, 231-243 (1997).
59. Kifer, M., Li, A.: On the semantics of rule-based expert systems with uncertainty. In: Proc. of the Int. Conf. on Database Theory (ICDT-88), number 326 in Lecture Notes in Computer Science, pp. 102-117. Springer, Berlin Heidelberg New York (1988).
60. Kifer, M., Subrahmanian, V. S.: Theory of generalized annotated logic programming and its applications. J. Logic Program. 12, 335-367 (1992).
61. Klawonn, F., Kruse, R.: A Łukasiewicz logic based Prolog. Mathw. Soft Comput. 1(1), 5-29 (1994).
62. Krajči, S., Lencses, R., Vojtáš, P.: A comparison of fuzzy and annotated logic programming. Fuzzy Sets Syst. 144, 173-192 (2004).
63. Kulmann, P., Sandri, S.: An annotaded logic theorem prover for an extended possibilistic logic. Fuzzy Sets Syst. 144, 67-91 (2004).
64. Lakshmanan, L.: An epistemic foundation for logic programming with uncertainty. In: Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, no. 880, pp. 89-100. Springer, Berlin Heidelberg New York (1994).
65. Lakshmanan, L. V. S., Sadri, F.: On a theory of probabilistic deductive databases. Theory Pract. Log. Program. 1(1), 5-42 (2001).
66. Lakshmanan, L. V. S., Sadri, F.: Uncertain deductive databases: a hybrid approach. Inf. Syst. 22(8), 483-508 (1997).
67. Lakshmanan, L. V. S., Shiri, N.: Probabilistic deductive databases. In: Int'l. Logic Programming Symposium, pp. 254-268. MIT, Cambridge (1994).
68. Lakshmanan, L. V. S., Shiri, N.: A parametric approach to deductive databases with uncertainty. IEEE Trans. Knowl. Data Eng. 13(4), 554-570 (2001).
69. Leone, N., Rullo, P., Scarcello, F.: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Inf. Comput. 135(2), 69-112 (1997).
70. Libkin, L., Wong, L.: On the power of incremental evaluation in SQL-like languages. Lect. Notes Comput. Sci. 1949, 17-30 (2000).
71. Loyer, Y., Spyratos, N.: Hypothesis-Founded Semantics for Datalog Programs with Negation. In: 27th International Symposium on Mathematical Foundations of Computer Science (MFCS-2002). Lecture Notes in Computer Science, Warsaw, Poland, no. 2420, pp. 483-494. Springer, Berlin Heidelberg New York (2002).
72. Loyer, Y., Spyratos, N., Stamate, D.: Parametrized semantics of logic programs-a unifying framework. Theor. Comput. Sci. 308(1-3), 429-447 (2003).
73. Loyer, Y., Spyratos, N., Stamate, D.: Hypothesis-based semantics of logic programs in multivalued logics. ACM Trans. Comput. Log. 5(3), 508-527 (2004).
74. Loyer, Y., Straccia, U.: Uncertainty and partial non-uniform assumptions in parametric deductive databases. In: Proc. of the 8th European Conference on Logics in Artificial Intelligence (JELIA-02). Lecture Notes in Computer Science, Cosenza, Italy, no. 2424, pp. 271-282. Springer, Berlin Heidelberg New York (2002).
75. Loyer, Y., Straccia, U.: The well-founded semantics in normal logic programs with uncertainty. In: Proc. of the 6th International Symposium on Functional and Logic Programming (FLOPS-2002). Lecture Notes in Computer Science, Aizu, Japan, no. 2441, pp. 152-166. Springer, Berlin Heidelberg New York (2002).
76. Loyer, Y., Straccia, U.: The approximate well-founded semantics for logic programs with uncertainty. In: 28th International Symposium on Mathematical Foundations of Computer Science (MFCS-2003). Lecture Notes in Computer Science, Bratislava, Slovak Republic, no. 2747, pp. 541-550. Springer, Berlin Heidelberg New York (2003).
77. Loyer, Y., Straccia, U.: Default knowledge in logic programs with uncertainty. In: Proc. of the 19th Int. Conf. on Logic Programming (ICLP-03). Lecture Notes in Computer Science, Mumbai, India, no. 2916, pp. 466-480. Springer, Berlin Heidelberg New York (2003).
78. Loyer, Y., Straccia, U.: Epistemic foundation of the well-founded semantics over bilattices. In: 29th International Symposium on Mathematical Foundations of Computer Science (MFCS-2004). Lecture Notes in Computer Science, Bratislava, Slovak Republic, no. 3153, pp. 513-524. Springer, Berlin Heidelberg New York (2004).
79. Loyer, Y., Straccia, U.: Any-world assumptions in logic programming. Theor. Comput. Sci. 342(2-3), 351-381 (2005).
80. Loyer, Y., Straccia, U.: Epistemic foundation of stable model semantics. J. Theor. Pract. Log. Program. 6, 355-393 (2006).
81. Lu, J. J.: Logic programming with signs and annotations. J. Log. Comput. 6(6), 755-778 (1996).
82. Lu, J. J., Calmet, J., Schü, J.: Computing multiple-valued logic programs. Mathw. Soft Comput. 2(4), 129-153 (1997).
83. Lukasiewicz, T.: Many-valued first-order logics with probabilistic semantics. In: Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL'98). Lecture Notes in Computer Science, no. 1584, pp. 415-429. Springer, Berlin Heidelberg New York (1998).
84. Lukasiewicz, T.: Probabilistic logic programming. In: Proc. of the 13th European Conf. on Artificial Intelligence (ECAI-98), Brighton (England), pp. 388-392 (1998, August).
85. Lukasiewicz, T.: Many-valued disjunctive logic programs with probabilistic semantics. In: Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99). Lecture Notes in Computer Science, no. 1730, pp. 277-289. Springer, Berlin Heidelberg New York (1999).
86. Lukasiewicz, T.: Probabilistic and truth-functional many-valued logic programming. In: The IEEE International Symposium on Multiple-Valued Logic, pp. 236-241. IEEE, Piscataway (1999).
87. Lukasiewicz, T.: Fixpoint characterizations for many-valued disjunctive logic programs with probabilistic semantics. In: Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-01). Lecture Notes in Artificial Intelligence, no. 2173, pp. 336-350. Springer, Berlin Heidelberg New York (2001).
88. Lukasiewicz, T.: Probabilistic logic programming under inheritance with overriding. In: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence (UAI-01), San Francisco, CA, USA, pp. 329-336. Morgan Kaufmann, San Francisco (2001).
89. Lukasiewicz, T.: Probabilistic logic programming with conditional constraints. ACM Trans. Comput. 2(3), 289-339 (2001).
90. Lukasiewicz, T., Straccia, U.: Tightly integrated fuzzy description logic programs under the answer semantics for the semantic web. In: Proceedings of the First International Conference on Web Reasoning and Rule Systems (RR-07). Lecture Notes in Computer Science, no. 4524, pp. 289-298. Springer, Berlin Heidelberg New York (2007).
91. Lukasiewicz, T., Straccia, U.: Top-k retrieval in description logic programs under vagueness for the semantic web. In: Proceedings of the 1st International Conference on Scalable Uncertainty Management (SUM-07). Lecture Notes in Computer Science, no. 4772, pp. 16-30. Springer, Berlin Heidelberg New York (2007).
92. Magrez, P., Smets, P.: Fuzzy modus ponens: a new model suitable for applications in knowledge-based systems. Int. J. Intell. Syst. 4, 181-200 (1989).
93. Majkic, Z.: Coalgebraic semantics for logic programs. In: 18th Workshop on (Constraint) Logic Programming ((W(C)LP-05), Ulm, May 2004.
94. Majkic, Z.: Many-valued intuitionistic implication and inference closure in a bilattice-based logic. In: 35th International Symposium on Multiple-Valued Logic (ISMVL-05), no. 214-220, Calgary, 19-21 May 2005.
95. Majkic, Z.: Truth and knowledge fixpoint semantics for many-valued logic programming. In: 19th Workshop on (Constraint) Logic Programming ((W(C)LP-05), no. 76-87, Ulm, 21-25 February 2005.
96. Marek, V. W., Truszczyński, M.: Logic programming with costs. Technical report, University of Kentucky. ftp://al.cs.engr.uky.edu/cs/manuscripts/lp-costs.ps (2000).
97. Martin, T. P., Baldwin, J. F., Pilsworth, B. W.: The implementation of FProlog -a fuzzy prolog interpreter. Fuzzy Sets Syst. 23(1), 119-129 (1987).
98. Martin, T. P.: Soft computing, logic programming and the semantic web. In: Proceedings of the 10th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, (IPMU-04), pp. 815-822, Perugia, 4-9 July 2004.
99. Mateis, C.: Extending disjunctive logic programming by t-norms. In: Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-99). Lecture Notes in Computer Science, no. 1730, pages 290-304. Springer, Berlin Heidelberg New York (1999).
100. Mateis, C.: Quantitative disjunctive logic programming: semantics and computation. AI Commun. 13, 225-248 (2000).
101. Medina, J., Ojeda-Aciego, M.: Multi-adjoint logic programming. In: Proceedings of the 10th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, (IPMU-04), pp. 823-830, Perugia, 4-9 July 2004.
102. Medina, J., Ojeda-Aciego, M., Vojtáš, P.: Multi-adjoint logic programming with continuous semantics. In: Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-01). Lecture Notes in Artificial Intelligence, vol. 2173, pp. 351-364. Springer, Berlin Heidelberg New York (2001).
103. Medina, J., Ojeda-Aciego, M., Vojtáš, P.: A procedural semantics for multi-adjoint logic programming. In: Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving, pp. 290-297. Springer, Berlin Heidelberg New York (2001).
104. Medina, J., Ojeda-Aciego, M., Vojtáš, P.: Similarity-based unification: a multi-adjoint approach. Fuzzy Sets Syst. 1(146), 43-62 (2004).
105. Minker, J.: On indefinite data bases and the closed world assumption. In: Proc. of the 6th Conf. on Automated Deduction (CADE-82). Lecture Notes in Computer Science, no. 138. Springer, Berlin Heidelberg New York (1982).
106. Muggleton, S.: Stochastic logic programs. In: De Raedt, L. (ed.) Proceedings of the 5th International Workshop on Inductive Logic Programming, p. 29. Department of Computer Science, Katholieke Universiteit Leuven (1995).
107. Mukaidono, M.: Foundations of fuzzy logic programming. In: Advances in Fuzzy Systems-Application and Theory, vol. 1. World Scientific, Singapore (1996).
108. Mukaidono, M., Shen, Z., Ding, L.: Fundamentals of fuzzy prolog. Int. J. Approx. Reason. 3(2), 179-193 (1989).
109. Ng, R., Subrahmanian, V. S.: Stable model semantics for probabilistic deductive databases. In: Ras, Z. W., Zemenkova, M. (eds.) Proc. of the 6th Int. Sym. on Methodologies for Intelligent Systems (ISMIS-91). Lecture Notes in Artificial Intelligence, no. 542, pp. 163-171. Springer, Berlin Heidelberg New York (1991).
110. Ng, R., Subrahmanian, V. S.: Probabilistic logic programming. Inf. Comput. 101(2), 150-201 (1993).
111. Ng, R., Subrahmanian, V. S.: Stable model semantics for probabilistic deductive databases. Inf. Comput. 110(1), 42-83 (1994).
112. Ngo, L.: Probabilistic disjunctive logic programming. In: Uncertainty in Artificial Intelligence: Proceedings of the Twelfeth Conference (UAI-1996), San Francisco, CA, pp. 397-404. Morgan Kaufmann, San Francisco (1996).
113. Ngo, L., Haddawy, P.: Answering queries from context-sensitive probabilistic knowledge bases. Theor. Comput. Sci. 171(1-2), 147-177 (1997).
114. Nicolas, P., Garcia, L., Stéphan, I.: Possibilistic stable models. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05), pp. 248-253. Morgan Kaufmann, San Francisco (2005).
115. Paulik, L.: Best possible answer is computable for fuzzy sld-resolution. In: Hajék, P. (ed.) Gödel 96: Logical Foundations of Mathematics, Computer Science, and Physics. Lecture Notes in Logic, no. 6, pp. 257-266. Springer, Berlin Heidelberg New York (1996).
116. Poole, D.: Probabilistic horn abduction and bayesian networks. Artif. Intell. 64(1), 81-129 (1993).
117. Poole, D.: The independent choice logic for modelling multiple agents under uncertainty. Artif. Intell. 94(1-2), 7-56 (1997).
118. Rhodes, P. C., Merad Menani, S.: Towards a fuzzy logic programming system: a clausal form fuzzy logic. Knowl.-Based Syst. 8(4), 174-182 (1995).
119. Rounds, W. C., Zhang, G.-Q.: Clausal logic and logic programming in algebraic domains. Inf. Comput. 171, 183-200 (2001).
120. Schroeder, M., Schweimeier, R.: Fuzzy argumentation and extended logic programming. In: Proceedings of ECSQARU Workshop Adventures in Argumentation, Toulouse, September 2001.
121. Schroeder, M., Schweimeier, R.: Arguments and misunderstandings: Fuzzy unification for negotiating agents. In: Proceedings of the ICLP workshop CLIMA02. Elsevier, Amsterdam (2002).
122. Schroeder, M., Schweimeier, R.: Fuzzy unification and argumentation for well-founded semantics. In: Proceedings of the Conference on Current Trends in Theory and Practice of Informatics (SOFSEM-04). Lecture Notes in Computer Science, no. 2932, pp. 102-121. Springer, Berlin Heidelberg New York (2004).
123. Sessa, M. I.: Approximate reasoning by similarity-based sld resolution. Theor. Comput. Sci. 275, 389-426 (2002).
124. Shapiro, E. Y.: Logic programs with uncertainties: a tool for implementing rule-based systems. In: Proceedings of the 8th International Joint Conference on Artificial Intelligence (IJCAI-83), pp. 529-532, Karlsruhe, 8-12 August 1983.
125. Shen, Z., Ding, L., Mukaidono, L.: A theoretical framework of fuzzy prolog machine. In: Fuzzy Computing, pp. 89-100. Elsevier, Amsterdam (1988).
126. Straccia, U.: Query answering in normal logic programs under uncertainty. In: 8th European Conferences on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU-05). Lecture Notes in Computer Science, Barcelona, Spain, no. 3571, pp. 687-700. Springer, Berlin Heidelberg New York (2005).
127. Straccia, U.: Uncertainty management in logic programming: Simple and effective top-down query answering. In: Khosla, R., Howlett, R. J., Jain, L. C. (eds.) 9th International Conference on Knowledge-Based & Intelligent Information & Engineering Systems (KES-05), Part II. Lecture Notes in Computer Science, Melbourne, Australia, no. 3682, pp. 753-760. Springer, Berlig Heidelberg New York (2005).
128. Straccia, U.: Annotated answer set programming. In: Proceedings of the 11th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, (IPMU-06), pp. 1212-1219. E. D. K., Paris (2006).
129. Straccia, U.: Query answering under the any-world assumption for normal logic programs. In: Proceedings of the 10th International Conference on Principles of Knowledge Representation (KR-06), pp. 329-339. AAAI, Menlo Park (2006).
130. Straccia, U.: Towards top-k query answering in deductive databases. In: Proceedings of the 2006 IEEE International Conference on Systems, Man and Cybernetics (SMC-06), pp. 4873-4879. IEEE, Piscataway (2006).
131. Straccia, U.: A top-down query answering procedure for normal logic programs under the any-world assumption. In: Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU-07). Lecture Notes in Computer Science, no. 4724, pp. 115-127. Springer, Berlin Heidelberg New York (2007).
132. Straccia, U.: Towards vague query answering in logic programming for logic-based information retrieval. In: World Congress of the International Fuzzy Systems Association (IFSA-07). Lecture Notes in Computer Science, Cancun, Mexico, no. 4529, pp. 125-134. Springer, Berlin Heidelberg New York (2007).
133. Subramanian, V. S.: On the semantics of quantitative logic programs. In: Proc. 4th IEEE Symp. on Logic Programming, pp. 173-182. Computer Society Press, Los Angeles (1987).
134. Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5, 285-309 (1955).
135. Turner, H.: Signed logic programs. In: Bruynooghe, M. (ed.) Logic Programming: Proc. of the 1994 International Symposium, pp. 61-75. MIT, Piscataway (1994).
136. Ullman, J. D.: Principles of Database and Knowledge Base Systems, vols. 1, 2. Computer Science Press, Potomac (1989).
137. van Emden, M. H.: Quantitative deduction and its fixpoint theory. J. Log. Program. 4(1), 37-53 (1986).
138. van Gelder, A., Ross, K. A., Schlimpf, J. S.: The well-founded semantics for general logic programs. J. ACM. 38(3), 620-650 (1991).
139. Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: 20th International Conference on Logic Programming (ICLP-04). Lecture Notes in Computer Science, vol. 3132, pp. 431-445. Springer, Berlin Heidelberg New York (2004).
140. Vojtáš, P.: Fuzzy logic programming. Fuzzy Sets Syst. 124, 361-370 (2001).
141. Vojtáš, P., Paulík, L.: Soundness and completeness of non-classical extended SLD-resolution. In: 5th International Workshop on Extensions of Logic Programming (ELP'96). Lecture Notes in Artificial Intelligence, no. 1050, pp. 289-301, Leipzig, 28-30 March 1996.
142. Vojtáš, P., Vomelelová, M.: Transformation of deductive and inductive tasks between models of logic programming with imperfect information. In: Proceedings of the 10th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, (IPMU-04), pp. 839-846, Perugia, 4-9 July 2004.
143. Wagner, G.: Negation in fuzzy and possibilistic logic programs. In: Martin, T., Arcelli, F. (eds.) Logic Programming and Soft Computing. Research Studies, Taunton (1998).
144. Warren, D. S.: Memoing for logic programs. Commun. ACM. 35(3), 93-111 (1992).
145. Wüttrich, B.: Probabilistic knowledge bases. IEEE Trans. Knowl. Data Eng. 7(5), 691-698 (1995).
146. Yasui, H., Hamada, Y., Mukaidono, M.: Fuzzy prolog based on lukasiewicz implication and bounded product. IEEE Trans. Fuzzy Syst. 2, 949-954 (1995).