11 found
Sort by:
  1. Régis Alenda & Nicola Olivetti (2012). Preferential Semantics for the Logic of Comparative Similarity Over Triangular and Metric Models. In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer 1--13.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  2. Nicola Olivetti & Gian Luca Pozzato (2008). Theorem Proving for Conditional Logics: CondLean and GOALD U CK. Journal of Applied Non-Classical Logics 18 (4):427-473.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  3. Nicola Olivetti & Gian Luca Pozzato (2007). Automated Reasoning for Conditional Logics: The Theorem Prover Condlean 3.1. In Jean-Yves Béziau & Alexandre Costa-Leite (eds.), Perspectives on Universal Logic.
  4. George Metcalfe, Nicola Olivetti & Dov Gabbay (2005). Łukasiewicz Logic: From Proof Systems To Logic Programming. Logic Journal of the Igpl 13 (5):561-585.
    We present logic programming style “goal-directed” proof methods for Łukasiewicz logic Ł that both have a logical interpretation, and provide a suitable basis for implementation. We introduce a basic version, similar to goal-directed calculi for other logics, and make refinements to improve efficiency and obtain termination. We then provide an algorithm for fuzzy logic programming in Rational Pavelka logic RPL, an extension of Ł with rational constants.
    Direct download  
     
    My bibliography  
     
    Export citation  
  5. George Metcalfe, Nicola Olivetti & Dov Gabbay (2004). Analytic Calculi for Product Logics. Archive for Mathematical Logic 43 (7):859-889.
    Product logic Π is an important t-norm based fuzzy logic with conjunction interpreted as multiplication on the real unit interval [0,1], while Cancellative hoop logic CHL is a related logic with connectives interpreted as for Π but on the real unit interval with 0 removed (0,1]. Here we present several analytic proof systems for Π and CHL, including hypersequent calculi, co-NP labelled calculi and sequent calculi.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  6. Nicola Olivetti (2003). Tableaux for Łukasiewicz Infinite-Valued Logic. Studia Logica 73 (1):81 - 111.
    In this work we propose a labelled tableau method for ukasiewicz infinite-valued logic L . The method is based on the Kripke semantics of this logic developed by Urquhart [25] and Scott [24]. On the one hand, our method falls under the general paradigm of labelled deduction [8] and it is rather close to the tableau systems for sub-structural logics proposed in [4]. On the other hand, it provides a CoNP decision procedure for L validity by reducing the check of (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  7. Laura Giordano, Valentina Gliozzi & Nicola Olivetti (2002). Iterated Belief Revision and Conditional Logic. Studia Logica 70 (1):23-47.
    In this paper we propose a conditional logic called IBC to represent iterated belief revision systems. We propose a set of postulates for iterated revision which are a small variant of Darwiche and Pearl''s ones. The conditional logic IBC has a standard semantics in terms of selection function models and provides a natural representation of epistemic states. We establish a correspondence between iterated belief revision systems and IBC-models. Our representation theorem does not entail Gärdenfors'' Triviality Result.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  8. Nicola Olivetti & Conditional Logic (2002). Laura Giordano Iterated Belief Revision. Studia Logica 70:23-47.
    Direct download  
     
    My bibliography  
     
    Export citation  
  9. Dov M. Gabbay & Nicola Olivetti (1998). Algorithmic Proof Methods and Cut Elimination for Implicational Logics Part I: Modal Implication. Studia Logica 61 (2):237-280.
    In this work we develop goal-directed deduction methods for the implicational fragment of several modal logics. We give sound and complete procedures for strict implication of K, T, K4, S4, K5, K45, KB, KTB, S5, G and for some intuitionistic variants. In order to achieve a uniform and concise presentation, we first develop our methods in the framework of Labelled Deductive Systems [Gabbay 96]. The proof systems we present are strongly analytical and satisfy a basic property of cut admissibility. We (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  10. Dov Gabbay, Laura Giordano, Alberto Martelli & Nicola Olivetti (1996). A Language For Handling Hypothetical Updates And Inconsistency. Logic Journal of the Igpl 4 (3):385-416.
    In this paper we propoee a logic programming language which supports hypothetical updates together with integrity constraints. The language makes use of a revision mechanism, which is needed to restore consistency when an update violates some integrity constraint. The revision policy adopted is based on the simple idea that more recent information is preferred to earlier one. We show how this language can be used to represent and perform several types of defeasible reasoning. We develop a logical characterization of the (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  11. Nicola Olivetti & Lea Terracini (1992). N-Prolog and Equivalence of Logic Programs. Journal of Logic, Language and Information 1 (4):253-340.
    The aim of this work is to develop a declarative semantics for N-Prolog with negation as failure. N-Prolog is an extension of Prolog proposed by Gabbay and Reyle (1984, 1985), which allows for occurrences of nested implications in both goals and clauses. Our starting point is an operational semantics of the language defined by means of top-down derivation trees. Negation as finite failure can be naturally introduced in this context. A goal-G (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation