Abstract
We propose a new approach to modelling abductive reasoning by means of an abductive question-answer system. We introduce the concept of an abductive question which is the starting point of abductive reasoning. The result of applying the question processing procedure is a question, which is simpler than the initial one. \(\mathsf {AQAS}\) generates abductive hypotheses that fulfil certain criteria in one step, i.e. processes of generation and evaluation of abductive hypotheses are integrated.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Urbański and Wiśniewski [20] proposed a mechanism which enables to obtain abductive hypotheses in the form of law-like statements. The basis of the mechanism is similar as we use here. However, the two approaches differ when results of the abductive procedures are concerned. What is more, Urbański and Wiśniewski put it explicitly at the beginning of their article that they will not consider problem of the evaluation of abductive hypotheses.
- 2.
However some remarks should be made at this point. In the well-known Abductive Logic Programming (\(\mathsf {ALP}\)) framework (on the propositional level) it is assumed that the set of abductive hypotheses (the set of abducibles) is known before abductive reasoning is triggered. Then, using integrity constraints and information from the knowledge base it can be figured out which hypotheses are good. Moreover, abductive hypotheses can be only of the form of atomic formulas. In \(\mathsf {AQAS}\) the set of abductive hypotheses is not known before the initial question is transformed and abductive hypotheses can be literals as well as formulas of the form of implication. We think that the novelty of our approach lays in the fact that the concept of abductive hypothesis is defined in a more general way.
- 3.
\(\alpha , \beta \)-notation was introduced by Smullyan in [17] to simplify metalogical considerations.
- 4.
A version of this calculus was introduced by Wiśniewski in [21]. In his approach only one formula can occur in the consequent of the sequent.
- 5.
References
Aliseda, A.: Abductive Reasoning. Logical Investigations into Discovery and Explanation. Springer, Dordrecht (2006). doi:10.1007/1-4020-3907-7
Chlebowski, S., Leszczyńska-Jasion, D.: Dual erotetic calculi and the minimal LFI. Studia Logica 103(6), 1245–1278 (2015). doi:10.1007/s11225-015-9617-0
Ciardelli, I., Roelofsen, F.: Inquisitive logic. J. Philos. Log. 40, 55–94 (2011). doi:10.1007/s10992-010-9142-6
Ciardelli, I., Groenendijk, J., Roelofsen, F.: On the semantics and logic of declaratives and interrogatives. Synthese (2013). doi:10.1007/s11229-s013-0352-7
Denecker, M., Kakas, A.: Abduction in logic programming. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS, vol. 2407, pp. 402–436. Springer, Heidelberg (2002). doi:10.1007/3-540-45628-7_16
Fitting, M.: First-Order Logic and Automated Theorem Proving. Springer, New York (1996). doi:10.1007/978-1-4612-2360-3
Hintikka, J.: What is abduction? The fundamental problem of contemporary epistemology. In: Inquiry as Inquiry: A Logic of Scientific Discovery, pp. 91–113. Springer, Dordrecht (1999). doi:10.1007/978-94-015-9313-7_4
Hintikka, J.: Socratic Epistemology: Explorations of Knowledge-Seeking by Questioning. Cambridge University Press, Cambridge (2007). ISBN: 9780521616515
Kakas, A.C., Kowalski, R.A., Toni, F.: Abductive logic programming. J. Log. Comput. 2(6), 719–770 (1992)
Komosiński, M., Kupś, A., Leszczyńska-Jasion, D., Urbański, M.: Identifying efficient abductive hypotheses using multi-criteria dominance relation. ACM Trans. Comput. Log. (TOCL) 15(4), 28:1–28:20 (2014). doi:10.1145/2629669
Leszczyńska-Jasion, D.: Socratic proofs for some normal modal propositional logics. Logique et Analyse 47(185–188), 259–285 (2004)
Magnani, L.: Abductive Cognition. The Epistemological and Eco-cognitive Dimensions of Hypothetical Reasoning. Springer, Dordrecht (2009). doi:10.1007/s10838-011-9146-0
Mayer, M.C., Pirri, F.: Propositional abduction in modal logic. Log. J. IGPL 3(6), 907–919 (1995). doi:10.1093/jigpal/3.6.907
Meheus, J., Batens, D.: A formal logic of abductive reasoning. Log. J. IGPL 14(2), 221–236 (2006). doi:10.1093/jigpal/jzk015
Peirce, C.S.: Collected Works. Harvard University Press, Cambridge (1931). Republished in 1958
Sintonen, M.: Reasoning to hypotheses: where do questions come? Found. Sci. 9(3), 249–266 (2004). doi:10.1023/B:FODA.0000042842.55251.c1
Smullyan, R.M.: First-Order Logic. Springer, Heidelberg (1968)
Thagard, P.: Abductive inference: from philosophical analysis to neural mechanisms. In: Feeney, A., Heit, E. (eds.) Inductive Reasoning: Cognitive, Mathematical, and Neuroscientific Approaches, pp. 226–247. Cambridge University Press, Cambridge (2007). doi:10.1017/CBO9780511619304.010
Urbański, M.: Rozumowania abdukcyjne. Wydawnictwo Naukowe UAM, Poznań (2009)
Urbański, M., Wiśniewski, A.: On search for law-like statements as abductive hypotheses by socratic transformations. In: Baskent, C. (ed.) Perspectives on Interrogative Models of Inquiry. Developments in Inquiry and Questions, vol. 8, pp. 111–127. Springer, Cham (2016). doi:10.1007/978-3-319-20762-9_7
Wiśniewski, A.: Socratic proofs. J. Philos. Log. 33(3), 299–326 (2004). doi:10.1023/B:LOGI.0000031374.60945.6e
Wiśniewski, A.: Questions, Inferences, and Scenarios. Studies in Logic, vol. 46. College Publications, London (2013)
Wiśniewski, A.: The Posing of Questions: Logical Foundations of Erotetic Inferences. Kluwer, Dordrecht (1995)
Acknowledgements
This work has been supported by the Polish National Science Center, grant no. 2012/04/A/HS1/00715 (first author) and DEC-2013/10/E/HS1/00172 (second author).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Chlebowski, S., Gajda, A. (2017). Abductive Question-Answer System (\(\mathsf {AQAS}\)) for Classical Propositional Logic. In: Christiansen, H., Jaudoin, H., Chountas, P., Andreasen, T., Legind Larsen, H. (eds) Flexible Query Answering Systems. FQAS 2017. Lecture Notes in Computer Science(), vol 10333. Springer, Cham. https://doi.org/10.1007/978-3-319-59692-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-59692-1_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59691-4
Online ISBN: 978-3-319-59692-1
eBook Packages: Computer ScienceComputer Science (R0)