http://publicationslist.org/data/dgm/atom.xml Marcello D'Agostinohttp://publicationslist.org/dgm$basepathfavicon.icoRecent additions to Marcello D'Agostino's PublicationsList.org pagehttp://publicationslist.org/publications.png2011-06-22T10:47:41Z http://publicationslist.org/dgm/refid55 2010-12-21T09:14:37Z

(2010) :<br/>

http://publicationslist.org/dgm/refid17 2010-12-19T10:48:33Z

In this paper we set out to make a contribution towards the solution of the logical omniscience problem. We maintain that the problem can be properly solved by restricting the classical notion of logical consequence rather than by waiving closure of the propositional attitudes under logical consequence. We suggest that an interesting alternative solution could be based on Depth-Bounded Boolean Lo...<br/><br/>M D'Agostino (2010) <i></i> <i>Probability, Uncertainty and Rationality</i> <i></i> 10: 245-275<br/>

http://publicationslist.org/dgm/refid59 2011-03-05T10:16:06Z

We argue that the dream of a ‘perfect language’ – namely, a universal, unambiguous and semantically transparent medium of expression –, whose intriguing story has been told by Umberto Eco (1993), is deeply intertwined with the myth of instant rationality: the idea that a perfect language is one in which all logical relations become immediately visible, so that the language itself “does ...<br/><br/>M Carapezza, M D'Agostino (2010) <i>Logic and Philosophy of Science</i> 8: 1 1-29<br/>

http://publicationslist.org/dgm/refid54 2010-03-09T07:52:19Z

We propose a formal language that allows for transposing biological information precisely and rigorously into machine-readable information. This language, which we call Zsyntax, is grounded on a particular type of non-classical logic, and it can be used to write algorithms and computer programs. We present it as a first step towards a comprehensive formal language for molecular biology in which an...<br/><br/>G. Boniolo, M. D'Agostino, P. Di Fiore (2010) <i>PLoS ONE</i> 5: 3 e9511<br/>

http://publicationslist.org/dgm/refid18 2010-12-19T10:50:31Z

De Finetti suggested that scoring rules -€” namely, loss functions by which a forecaster is virtually charged depending on the degree of inaccuracy of his predictions - could be employed also to provide a compelling argument for probabilism. However, De Finetti'€™s choice of a specific scoring rule for this purpose (Brier'€™s quadratic rule) appears somewhat arbitrary, and the general pr...<br/><br/>M D'Agostino, C Sinigaglia (2010) <i></i> <i>EPSA Epistemology and Methodology of Science</i> <i></i> : 95-105<br/>

http://publicationslist.org/dgm/refid14 2009-08-28T09:26:33Z

In this paper, we provide an application-oriented characterization of a class of distance functions monotonically related to the Euclidean distance in terms of some general properties of distance functions between real-valued vectors. Our analysis hinges upon two fundamental properties of distance functions that we call “value-sensitivity” and “order-sensitivity”. We show how these two gen...<br/><br/>M D'Agostino, V Dardanoni (2009) <i>Social Choice and Welfare</i> 33: 2 211-233<br/>

http://publicationslist.org/dgm/refid13 2010-02-27T15:25:47Z

Deductive inference is usually regarded as being “tautological” or “ana- lytical”: the information conveyed by the conclusion is contained in the information conveyed by the premises. This idea, however, clashes with the undecidability of first- order logic and with the (likely) intractability of Boolean logic. In this article, we address the problem both from the semantic and the...<br/><br/>M D'Agostino, L Floridi (2009) <i>Synthese</i> 167: 2 271-315<br/>

http://publicationslist.org/dgm/refid15 2009-08-28T09:30:29Z

In this paper we investigate the problem of measuring social mobility when the social status of individuals is given by their rank. In order to sensibly represent the rank mobility of subgroups within a given society, we address the problem in terms of partial permutation matrices which include standard (“global”) matrices as a special case. We first provide a characterization of a partial ord...<br/><br/>M D'Agostino, V Dardanoni (2009) <i>Journal of Economic Theory</i> 144: 4 1783-1803<br/>

http://publicationslist.org/dgm/refid16 2009-08-28T09:33:21Z

In this paper we explore a generalization of traditional abduction which can simultaneously perform two different tasks: (i) given an unprovable sequent G, find a sentence H such that , H G is provable (hypothesis generation); (ii) given a provable sequent G, find a sentence H such that H and the proof of , H G is simpler than the proof of G (lemma generation). We argue that the two task...<br/><br/>M D'Agostino, M Finger, DM Gabbay (2008) <i>Logic Journal of the IGPL</i> 16: 6 537-560<br/>

http://publicationslist.org/dgm/refid39 2010-12-19T10:54:29Z

M D’Agostino, K Broda, M Mondadori (2006) <i></i> <i>Popper Philosopher of Science</i> <i></i> : 147-168<br/>

http://publicationslist.org/dgm/refid35 2010-09-05T09:48:05Z

Gentzen introduced his sequent calculi LK and LJ, as well as his natural deduction systems NK and NJ, in his celebrated “Investigations into Logical Deduction” (1935). As far as classical logic is concerned both the natural deduction calculus NK and the sequent calculus LK run into serious difficulties from the computational viewpoint. In this work we argue that the origin of such computationa...<br/><br/>Marcello D’Agostino (2005) <i></i> <i>We Will Show Them! (1)</i> <i></i> : 429-468<br/>

http://publicationslist.org/dgm/refid43 2010-04-27T08:38:46Z

D'Agostino (2005) <i></i> <i>L’Eredità  di Alan Turing. 50 Anni di Intelligenza Artificiale</i> <i></i> : 79-100<br/>

http://publicationslist.org/dgm/refid45 2010-12-19T11:09:31Z

M D’Agostino, V Dardanoni, V Peragine (2003) <i>Filosofia e Questioni Pubbliche</i> <i></i> <i></i> : 131-148<br/>

http://publicationslist.org/dgm/refid46 2010-02-27T15:21:53Z

M D’Agostino, G Giorello, S Veca (2002) <i></i> <i></i> <i></i> : <br/>

http://publicationslist.org/dgm/refid47 2010-02-27T15:30:54Z

D Checchi, M D’Agostino, V Dardanoni (2001) <i></i> <i>Stato o Mercato? : Proceedings of the SIEP Conference</i> <i></i> 1: 1089-1114<br/>

http://publicationslist.org/dgm/refid48 2010-03-09T07:28:38Z

D Basin, M D’Agostino, D M Gabbay, S Matthews, L Viganò (2000) <i></i> <i></i> <i></i> : <br/>

http://publicationslist.org/dgm/refid50 2010-02-27T15:27:11Z

Krysia Broda, Marcello D’Agostino, Alessandra Russo (1999) <i></i> <i>Logic, Language and Reasoning. Essays in Honour of Dov Gabbay</i> <i>http://pubs.doc.ic.ac.uk/TransformationMethods1999/</i> : 335-376<br/>

http://publicationslist.org/dgm/refid58 2011-02-08T08:11:19Z

M. D'Agostino, M. Mondadori (1999) <i>Saggi in onore di Franco Crispini</i> <br/>

http://publicationslist.org/dgm/refid40 2010-12-19T10:57:08Z

Marcello D’Agostino (1999) <i></i> <i>Handbook of Tableau Methods</i> <i></i> : 45-123<br/>

http://publicationslist.org/dgm/refid38 2010-02-27T12:16:20Z

M D’Agostino, D M Gabbay, R Hähnle, J Posegga (1999) <i></i> <i></i> <i></i> : <br/>

http://publicationslist.org/dgm/refid41 2010-12-19T10:57:44Z

M D'Agostino, D M Gabbay, K Broda (1999) <i></i> <i>Handbook of Tableau Methods</i> <i></i> : 397-467<br/>

http://publicationslist.org/dgm/refid60 2011-06-22T10:38:46Z

M. D'Agostino, U. Endriss, D. Gabbay, M. Mondadori, J. Pitt. (1998) <i>Intelligent Tutoring Systems, 4th International Conference, ITS'98</i> <br/>

http://publicationslist.org/dgm/refid61 2011-06-22T10:47:37Z

M. D'Agostino, U. Endriss (1998) <i>Proceedings of the First International Workshop on Labelled Deduction</i> <br/>

http://publicationslist.org/dgm/refid51 2010-02-27T15:38:00Z

M Mondadori, M D’Agostino (1997) <i></i> <i></i> <i></i> : <br/>

http://publicationslist.org/dgm/refid49 2010-02-27T15:31:23Z

M D’Agostino, U Endriss, D M Gabbay, M Mondadori, J Pitt (1997) <i></i> <i>L’Uomo e la Macchina : Trent’anni Dopo. Atti della Conferenza della Società  Filosofica Italiana</i> <i></i> : <br/>

http://publicationslist.org/dgm/refid53 2010-02-27T15:44:00Z

We investigate the semantics of the logical systems obtained by introducing the modalities and into the family of substructural implication logics (including relevant, linear and intuitionistic implication). Then, in the spirit of the LDS (Labelled Deductive Systems) methodology, we "import" this semantics into the classical proof system KE. This leads to the formulation of a uniform labelled refu...<br/><br/>D’Agostino M , Gabbay DM, Russo A (1997) <i>Studia Logica</i> <i></i> <i>http://dx.medra.org/10.1023/A:1004947400860</i> 59: 65-102<br/>

http://publicationslist.org/dgm/refid56 2011-02-08T07:57:34Z

We investigate the notion of fibred tableaux which naturally arises from the idea of fibred semantics. Different implication operators peacefully cohabit and co-operate within the same labelled tableau method. <br/><br/>M. D'Agostino, D.M. Gabbay (1996) <i>Theorem Proving with Analytic Tableaux and Related Methods. 5th International Workshop Tableaux '96.</i> 16-35<br/>

http://publicationslist.org/dgm/refid57 2011-02-08T08:04:35Z

We investigate the logical systems which result from introducing the modalities L and M into the family of substructural implication logics (including relevant, linear and intuitionistic implication). Our results lead to the formulation of a uniform labelled refutation system for these logics.<br/><br/>M. D'Agostino, D.M. Gabbay, A. Russo (1996) <i>Mathware and Soft Computing</i> 3: 1-2 67-82<br/>

http://publicationslist.org/dgm/refid32 2010-02-27T15:29:48Z

The method of analytic tableaux is a direct descendant of Gentzen’s cut-free sequent calculus and is regarded as a paradigm of the notion of analytic deduction in classical logic. However, cut-free systems are anomalous from the proof-theoretical, the semantical and the computational point of view. Firstly, they cannot represent the use of auxiliary lemmas in proofs. Secondly, they cannot expres...<br/><br/>D’AGOSTINO M , MONDADORI M (1994) <i>Journal of Logic and Computation</i> <i></i> <i></i> 4: 285-319<br/>

http://publicationslist.org/dgm/refid33 2010-02-27T14:45:34Z

In this series of papers we set out to generalize the notion of classical analytic deduction (i.e., deduction via elimination rules) by combining the methodology of labelled deductive systems (LDS) with the classical systemKE. LDS is a unifying framework for the study of logics and of their interactions. In the LDS approach the basic units of logical derivation are not just formulae butlabelled fo...<br/><br/>D’AGOSTINO M , GABBAY DM (1994) <i>Journal of Automated Reasoning</i> <i></i> <i>http://dx.medra.org/10.1007/BF00881958</i> 13: 243-281<br/>

http://publicationslist.org/dgm/refid34 2010-02-27T15:29:21Z

We show that Smullyan’s analytic tableaux cannot p-simulate the truth-tables. We identify the cause of this computational breakdown and relate it to an underlying semantic difficulty which is common to the whole tradition originating in Gentzen’s sequent calculus, namely the dissonance between cut-free proofs and the Principle of Bivalence. Finally we discuss some ways in which this principle ...<br/><br/>D’AGOSTINO M (1992) <i>Journal of Logic, Language and Information</i> <i></i> <i>http://dx.medra.org/10.1007/BF00156916</i> 1: 235-252<br/>

http://publicationslist.org/dgm/refid52 2010-02-27T15:40:07Z

M D’Agostino (1990) <i></i> <i></i> <i></i> : <br/>

http://publicationslist.org/dgm/refid44 2010-12-19T11:05:32Z

M D’Agostino, V Dardanoni, V Peragine () <i></i> <i>Diritti, Regole, Mercato. Economia Pubblica e Analisi Economica del Diritto</i> <i></i> : <br/>