The Experts below are selected from a list of 324 Experts worldwide ranked by ideXlab platform

Kentaro Kikuchi - One of the best experts on this subject based on the ideXlab platform.

Silvia Likavec - One of the best experts on this subject based on the ideXlab platform.

  • strong normalization of the dual classical sequent Calculus
    International Conference on Logic Programming, 2005
    Co-Authors: Daniel J Dougherty, Silvia Ghilezan, Pierre Lescanne, Silvia Likavec
    Abstract:

    We investigate some syntactic properties of Wadler’s dual Calculus, a term Calculus which corresponds to classical sequent logic in the same way that Parigot’s λμ Calculus corresponds to classical natural deduction. Our main result is strong normalization theorem for reduction in the dual Calculus; we also prove some confluence results for the typed and untyped versions of the system.

  • LPAR - Strong normalization of the dual classical sequent Calculus
    Logic for Programming Artificial Intelligence and Reasoning, 2005
    Co-Authors: Daniel J Dougherty, Silvia Ghilezan, Pierre Lescanne, Silvia Likavec
    Abstract:

    We investigate some syntactic properties of Wadler’s dual Calculus, a term Calculus which corresponds to classical sequent logic in the same way that Parigot’s λμ Calculus corresponds to classical natural deduction. Our main result is strong normalization theorem for reduction in the dual Calculus; we also prove some confluence results for the typed and untyped versions of the system.

Ravi Palla - One of the best experts on this subject based on the ideXlab platform.

  • reformulating the situation Calculus and the event Calculus in the general theory of stable models and in answer set programming
    Journal of Artificial Intelligence Research, 2012
    Co-Authors: Ravi Palla
    Abstract:

    Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action formalisms, such as the situation Calculus, the event Calculus and temporal action logics; the latter has served as a basis of a family of action languages, such as language A and several of its descendants. Based on the discovery that circumscription and the stable model semantics coincide on a class of canonical formulas, we reformulate the situation Calculus and the event Calculus in the general theory of stable models. We also present a translation that turns the reformulations further into answer set programs, so that efficient answer set solvers can be applied to compute the situation Calculus and the event Calculus.

Yoshihiko Kakutani - One of the best experts on this subject based on the ideXlab platform.

  • Classical Natural Deduction for S4 Modal Logic
    New Generation Computing, 2011
    Co-Authors: Daisuke Kimura, Yoshihiko Kakutani
    Abstract:

    This paper proposes a natural deduction system CND S4 for classical S4 modal logic with necessity and possibility modalities. This new system is an extension of Parigot’s Classical Natural Deduction with dualcontext to formulate S4 modal logic. The modal λ μ -Calculus is also introduced as a computational extraction of CND S4 . It is an extension of both the λ μ -Calculus and the modal λ-Calculus. Subject reduction, confluency, and strong normalization of the modal λ μ -Calculus are shown. Finally, the computational interpretation of the modal λ μ -Calculus, especially the computational meaning of the modal possibility operator, is discussed.

  • APLAS - Classical Natural Deduction for S4 Modal Logic
    Programming Languages and Systems, 2009
    Co-Authors: Daisuke Kimura, Yoshihiko Kakutani
    Abstract:

    This paper proposes a natural deduction system CNDS4 for classical S4 modal logic with necessity and possibility modalities. This new system is an extension of Parigot's Classical Natural Deduction with dual-context to formulate S4 modal logic. The modal ***μ -Calculus is also introduced as a computational extraction of CNDS4. It is an extension of both the ***μ -Calculus and the modal *** -Calculus. Subject reduction, confluency, and strong normalization of the modal ***μ -Calculus are shown. Finally, the computational interpretation of the modal ***μ -Calculus, especially the computational meaning of the modal possibility operator, is discussed.

Daniel J Dougherty - One of the best experts on this subject based on the ideXlab platform.

  • strong normalization of the dual classical sequent Calculus
    International Conference on Logic Programming, 2005
    Co-Authors: Daniel J Dougherty, Silvia Ghilezan, Pierre Lescanne, Silvia Likavec
    Abstract:

    We investigate some syntactic properties of Wadler’s dual Calculus, a term Calculus which corresponds to classical sequent logic in the same way that Parigot’s λμ Calculus corresponds to classical natural deduction. Our main result is strong normalization theorem for reduction in the dual Calculus; we also prove some confluence results for the typed and untyped versions of the system.

  • LPAR - Strong normalization of the dual classical sequent Calculus
    Logic for Programming Artificial Intelligence and Reasoning, 2005
    Co-Authors: Daniel J Dougherty, Silvia Ghilezan, Pierre Lescanne, Silvia Likavec
    Abstract:

    We investigate some syntactic properties of Wadler’s dual Calculus, a term Calculus which corresponds to classical sequent logic in the same way that Parigot’s λμ Calculus corresponds to classical natural deduction. Our main result is strong normalization theorem for reduction in the dual Calculus; we also prove some confluence results for the typed and untyped versions of the system.