Name: Depth-Bounded Reasoning. Classical Propositional Logic de dov Gabbay Costanza Larese(College Publications) (en Inglés)
Price: 33.48 USD
Availability: InStock
Author: D'agostino Marcello,Gabbay Dov,Larese Costanza
ISBN: 9781848904422

portada Depth-Bounded Reasoning. Classical Propositional Logic de dov Gabbay Costanza Larese(College Publications) (en Inglés)

Depth-Bounded Reasoning. Classical Propositional Logic de dov Gabbay Costanza Larese(College Publications) (en Inglés)

Formato

Libro Físico

Editorial

College Publications

Autor

D'agostino Marcello,Gabbay Dov,Larese Costanza

Idioma

Inglés

Encuadernación

Tapa Blanda

ISBN13

9781848904422

Depth-Bounded Reasoning. Classical Propositional Logic de dov Gabbay Costanza Larese(College Publications) (en Inglés)

D'agostino Marcello,Gabbay Dov,Larese Costanza (Autor) · College Publications · Tapa Blanda

Libro Nuevo Importado

Envío: 18 a 25 días háb.

$ 60.88$ 33.48

-45%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan 50 unidades

$ 33.48

Llega entre el 17 Jul y el 30 Jul a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Depth-Bounded Reasoning. Classical Propositional Logic de dov Gabbay Costanza Larese(College Publications) (en Inglés)"

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 variable 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.