nach oben

Erschienen in:

2017 | OriginalPaper | Buchkapitel

Abductive Question-Answer System (\(\mathsf {AQAS}\)) for Classical Propositional Logic

verfasst von : Szymon Chlebowski, Andrzej Gajda

Erschienen in: Flexible Query Answering Systems

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Nächstes Kapitel Querying with Vague Quantifiers Using Probabilistic Semantics

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.

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.

\(\alpha , \beta \)-notation was introduced by Smullyan in [17] to simplify metalogical considerations.

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.

Similar constraints are also defined in [1, p. 74] (Aliseda describes those two criteria as constituting the consistent and the explanatory Abductive Explanatory Styles respectively) and as properties of the abduction for Abductive Logic Programming in [5].

Aliseda, A.: Abductive Reasoning. Logical Investigations into Discovery and Explanation. Springer, Dordrecht (2006). doi:10.1007/1-4020-3907-7 MATH

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 MathSciNetCrossRefMATH

Ciardelli, I., Roelofsen, F.: Inquisitive logic. J. Philos. Log. 40, 55–94 (2011). doi:10.1007/s10992-010-9142-6 MathSciNetCrossRefMATH

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 CrossRef

Fitting, M.: First-Order Logic and Automated Theorem Proving. Springer, New York (1996). doi:10.1007/978-1-4612-2360-3 CrossRefMATH

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: 9780521616515CrossRef

Kakas, A.C., Kowalski, R.A., Toni, F.: Abductive logic programming. J. Log. Comput. 2(6), 719–770 (1992)MathSciNetCrossRefMATH

10.

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 MATH

11.

Leszczyńska-Jasion, D.: Socratic proofs for some normal modal propositional logics. Logique et Analyse 47(185–188), 259–285 (2004)MathSciNetMATH

12.

Magnani, L.: Abductive Cognition. The Epistemological and Eco-cognitive Dimensions of Hypothetical Reasoning. Springer, Dordrecht (2009). doi:10.1007/s10838-011-9146-0 MATH

13.

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 MathSciNetCrossRefMATH

14.

Meheus, J., Batens, D.: A formal logic of abductive reasoning. Log. J. IGPL 14(2), 221–236 (2006). doi:10.1093/jigpal/jzk015 MathSciNetCrossRefMATH

15.

Peirce, C.S.: Collected Works. Harvard University Press, Cambridge (1931). Republished in 1958

16.

Sintonen, M.: Reasoning to hypotheses: where do questions come? Found. Sci. 9(3), 249–266 (2004). doi:10.1023/B:FODA.0000042842.55251.c1 CrossRef

17.

Smullyan, R.M.: First-Order Logic. Springer, Heidelberg (1968)CrossRefMATH

18.

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 CrossRef

19.

Urbański, M.: Rozumowania abdukcyjne. Wydawnictwo Naukowe UAM, Poznań (2009)

20.

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 CrossRef

21.

Wiśniewski, A.: Socratic proofs. J. Philos. Log. 33(3), 299–326 (2004). doi:10.1023/B:LOGI.0000031374.60945.6e MathSciNetCrossRefMATH

22.

Wiśniewski, A.: Questions, Inferences, and Scenarios. Studies in Logic, vol. 46. College Publications, London (2013)MATH

23.

Wiśniewski, A.: The Posing of Questions: Logical Foundations of Erotetic Inferences. Kluwer, Dordrecht (1995)CrossRef

Titel: Abductive Question-Answer System () for Classical Propositional Logic
verfasst von: Szymon Chlebowski
Andrzej Gajda
Verlag: Springer International Publishing
Buch: Flexible Query Answering Systems
Print ISBN: 978-3-319-59691-4

Electronic ISBN: 978-3-319-59692-1

Copyright-Jahr: 2017
DOI: https://doi.org/10.1007/978-3-319-59692-1_1

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Premium Partner