9781848904422 - depth-bounded reasoning. classical propositional logic von d'agostino, marcello; gabbay, dov; larese, costanza (3 Ergebnisse)
- Softcover
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes KönigreichPBShop.store UK
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 23,58
EUR 4,89 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 23,65
EUR 14,10 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
- Softcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 32,38
EUR 61,79 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Taschenbuch. Zustand: Neu. Neuware - The 'cost of reasoning', i.e., the cognitive or computational effort required by non-ideal, resource-bounded (human or artificial) agents in order to perform non-trivial inferences, is a crucial issue in philosophy, AI, economics and cognitive (neuro)science. Accounting for this fundamental v…ariable in modelling real-world reasoning and decision-making is one of the most important and difficult challenges in the theory of rationality. With this volume, we are launching a series that, under the general title of 'Logic and Bounded Rationality', aims to create a community of researchers from several areas that wish to cooperate towards a systematic logical view of bounded rationality.However, a key stumbling block for any effort in this direction, is that a basic component of many reasoning and decision making tasks, namely deductive reasoning in propositional logic, is computationally hard. Hence, in this first volume of the series we offer a novel view of classical propositional logic. We present an 'informational semantics' for the classical operators whose proof-theoretical presentation is a system of classical natural deduction that, unlike Gentzen's and Prawitz's systems, yields a simple way of measuring the 'depth' of an inference. This approach leads to defining, in a natural way, a sequence of tractable depth-bounded deduction systems. As recent applications in formal argumentation and non-monotonic reasoning suggest, our approach provides a plausible model for representing rational agents with increasing, albeit limited, computational resources.
