Partial Equilibrium

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

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

Agustín Valverde - One of the best experts on this subject based on the ideXlab platform.

  • Partial Equilibrium logic
    Annals of Mathematics and Artificial Intelligence, 2007
    Co-Authors: Pedro Cabalar, Sergei Odintsov, David Pearce, Agustín Valverde
    Abstract:

    Partial Equilibrium logic (PEL) is a new nonmonotonic reasoning formalism closely aligned with logic programming under well-founded and Partial stable model semantics. In particular it provides a logical foundation for these semantics as well as an extension of the basic syntax of logic programs. In this paper we describe PEL, study some of its logical properties and examine its behaviour on disjunctive and nested logic programs. In addition we consider computational features of PEL and study different approaches to its computation.

  • On the logic and computation of Partial Equilibrium models
    Lecture Notes in Computer Science, 2006
    Co-Authors: Pedro Cabalar, Sergei Odintsov, David Pearce, Agustín Valverde
    Abstract:

    The nonmonotonic formalism of Partial Equilibrium logic (PEL) has recently been proposed as a logical foundation for the Partial stable and well-founded semantics of logic programs [1,2]. We study certain logical properties of PEL and some techniques to compute Partial Equilibrium models.

  • JELIA - On the logic and computation of Partial Equilibrium models
    Logics in Artificial Intelligence, 2006
    Co-Authors: Pedro Cabalar, Sergei Odintsov, David Pearce, Agustín Valverde
    Abstract:

    The nonmonotonic formalism of Partial Equilibrium logic (PEL) has recently been proposed as a logical foundation for the Partial stable and well-founded semantics of logic programs [1,2]. We study certain logical properties of PEL and some techniques to compute Partial Equilibrium models.

  • analysing and extending well founded and Partial stable semantics using Partial Equilibrium logic
    Lecture Notes in Computer Science, 2006
    Co-Authors: Pedro Cabalar, Sergei Odintsov, David Pearce, Agustín Valverde
    Abstract:

    In [4] a nonmonotonic formalism called Partial Equilibrium logic (PEL) was proposed as a logical foundation for the well-founded semantics (WFS) of logic programs. PEL consists in defining a class of minimal models, called Partial Equilibrium (p-Equilibrium), inside a non-classical logic called HT 2 . In [4] it was shown that, on normal logic programs, p-Equilibrium models coincide with Przymusinki's Partial stable (p-stable) models. This paper begins showing that this coincidence still holds for the more general class of disjunctive programs, so that PEL can be seen as a way to extend WFS and p-stable semantics to arbitrary propositional theories. We also study here the problem of strong equivalence for various subclasses of p-Equilibrium models, investigate transformation rules and nonmonotonic inference, and consider a reduction of PEL to Equilibrium logic. In addition we examine the behaviour of PEL on nested logic programs and its complexity in the general case.

  • ICLP - Analysing and extending well-founded and Partial stable semantics using Partial Equilibrium logic
    Logic Programming, 2006
    Co-Authors: Pedro Cabalar, Sergei Odintsov, David Pearce, Agustín Valverde
    Abstract:

    In [4] a nonmonotonic formalism called Partial Equilibrium logic (PEL) was proposed as a logical foundation for the well-founded semantics (WFS) of logic programs. PEL consists in defining a class of minimal models, called Partial Equilibrium (p-Equilibrium), inside a non-classical logic called HT2. In [4] it was shown that, on normal logic programs, p-Equilibrium models coincide with Przymusinki’s Partial stable (p-stable) models. This paper begins showing that this coincidence still holds for the more general class of disjunctive programs, so that PEL can be seen as a way to extend WFS and p-stable semantics to arbitrary propositional theories. We also study here the problem of strong equivalence for various subclasses of p-Equilibrium models, investigate transformation rules and nonmonotonic inference, and consider a reduction of PEL to Equilibrium logic. In addition we examine the behaviour of PEL on nested logic programs and its complexity in the general case.

Pedro Cabalar - One of the best experts on this subject based on the ideXlab platform.

  • Partial Equilibrium logic
    Annals of Mathematics and Artificial Intelligence, 2007
    Co-Authors: Pedro Cabalar, Sergei Odintsov, David Pearce, Agustín Valverde
    Abstract:

    Partial Equilibrium logic (PEL) is a new nonmonotonic reasoning formalism closely aligned with logic programming under well-founded and Partial stable model semantics. In particular it provides a logical foundation for these semantics as well as an extension of the basic syntax of logic programs. In this paper we describe PEL, study some of its logical properties and examine its behaviour on disjunctive and nested logic programs. In addition we consider computational features of PEL and study different approaches to its computation.

  • On the logic and computation of Partial Equilibrium models
    Lecture Notes in Computer Science, 2006
    Co-Authors: Pedro Cabalar, Sergei Odintsov, David Pearce, Agustín Valverde
    Abstract:

    The nonmonotonic formalism of Partial Equilibrium logic (PEL) has recently been proposed as a logical foundation for the Partial stable and well-founded semantics of logic programs [1,2]. We study certain logical properties of PEL and some techniques to compute Partial Equilibrium models.

  • JELIA - On the logic and computation of Partial Equilibrium models
    Logics in Artificial Intelligence, 2006
    Co-Authors: Pedro Cabalar, Sergei Odintsov, David Pearce, Agustín Valverde
    Abstract:

    The nonmonotonic formalism of Partial Equilibrium logic (PEL) has recently been proposed as a logical foundation for the Partial stable and well-founded semantics of logic programs [1,2]. We study certain logical properties of PEL and some techniques to compute Partial Equilibrium models.

  • analysing and extending well founded and Partial stable semantics using Partial Equilibrium logic
    Lecture Notes in Computer Science, 2006
    Co-Authors: Pedro Cabalar, Sergei Odintsov, David Pearce, Agustín Valverde
    Abstract:

    In [4] a nonmonotonic formalism called Partial Equilibrium logic (PEL) was proposed as a logical foundation for the well-founded semantics (WFS) of logic programs. PEL consists in defining a class of minimal models, called Partial Equilibrium (p-Equilibrium), inside a non-classical logic called HT 2 . In [4] it was shown that, on normal logic programs, p-Equilibrium models coincide with Przymusinki's Partial stable (p-stable) models. This paper begins showing that this coincidence still holds for the more general class of disjunctive programs, so that PEL can be seen as a way to extend WFS and p-stable semantics to arbitrary propositional theories. We also study here the problem of strong equivalence for various subclasses of p-Equilibrium models, investigate transformation rules and nonmonotonic inference, and consider a reduction of PEL to Equilibrium logic. In addition we examine the behaviour of PEL on nested logic programs and its complexity in the general case.

  • ICLP - Analysing and extending well-founded and Partial stable semantics using Partial Equilibrium logic
    Logic Programming, 2006
    Co-Authors: Pedro Cabalar, Sergei Odintsov, David Pearce, Agustín Valverde
    Abstract:

    In [4] a nonmonotonic formalism called Partial Equilibrium logic (PEL) was proposed as a logical foundation for the well-founded semantics (WFS) of logic programs. PEL consists in defining a class of minimal models, called Partial Equilibrium (p-Equilibrium), inside a non-classical logic called HT2. In [4] it was shown that, on normal logic programs, p-Equilibrium models coincide with Przymusinki’s Partial stable (p-stable) models. This paper begins showing that this coincidence still holds for the more general class of disjunctive programs, so that PEL can be seen as a way to extend WFS and p-stable semantics to arbitrary propositional theories. We also study here the problem of strong equivalence for various subclasses of p-Equilibrium models, investigate transformation rules and nonmonotonic inference, and consider a reduction of PEL to Equilibrium logic. In addition we examine the behaviour of PEL on nested logic programs and its complexity in the general case.

Dionisios G. Vlachos - One of the best experts on this subject based on the ideXlab platform.

  • Overcoming stiffness in stochastic simulation stemming from Partial Equilibrium: A multiscale Monte Carlo algorithm
    The Journal of chemical physics, 2005
    Co-Authors: A. Samant, Dionisios G. Vlachos
    Abstract:

    In this paper the problem of stiffness in stochastic simulation of singularly perturbed systems is discussed. Such stiffness arises often from Partial Equilibrium or quasi-steady-state type of conditions. A multiscale Monte Carlo method is discussed that first assesses whether Partial Equilibrium is established using a simple criterion. The exact stochastic simulation algorithm (SSA) is next employed to sample among fast reactions over short time intervals (microscopic time steps) in order to compute numerically the proper probability distribution function for sampling the slow reactions. Subsequently, the SSA is used to sample among slow reactions and advance the time by large (macroscopic) time steps. Numerical examples indicate that not only long times can be simulated but also fluctuations are properly captured and substantial computational savings result.

Pierre Six - One of the best experts on this subject based on the ideXlab platform.

  • A Partial Equilibrium Model of the Convenience Yield Risk Premium of Storable Commodities
    2014
    Co-Authors: Vincent Lacoste, Pierre Six
    Abstract:

    This paper develops a Partial Equilibrium model of the convenience yield risk premium when commodities are storable. Contrary to the previous literature, the risk premium is computed explicitly and endogenously. We provide a decomposition of the convenience yield risk premium in terms of the volatility of the convenience yield as well as in terms of the sensitivity of the marginal utility of investors to the movements of the convenience yield. This decomposition enables us to assess the impact of the risk aversion and investment horizon of investors on the futures contracts’ basis and on the term structure of volatility. Our illustrations are carried out in the case of copper, gold, and oil markets.

  • A Partial Equilibrium for the convenience yield risk premium
    2011
    Co-Authors: Sami Attaoui, Vincent Lacoste, Pierre Six
    Abstract:

    This papers develops a Partial Equilibrium model of the convenience yield risk premium. Contrary to the previous literature, the risk premium is computed explicitely and endogenously. We provide a decomposition of the convenience yield risk premium in terms of the volatility of the convenience yield as well as in terms of the sensitivity of the marginal utility of investors to the movements of the convenience yield. This decomposition enables us to assess the impact of the risk aversion and investment horizon of investors on the futures contracts' basis and on the term structure of volatility for our illustration carried out in the case of the copper market.

  • A Partial Equilibrium Model for the Convenience Yield Risk Premium
    SSRN Electronic Journal, 2011
    Co-Authors: Sami Attaoui, Vincent Lacoste, Pierre Six
    Abstract:

    This papers develops a Partial Equilibrium model of the convenience yield risk premium. Contrary to the previous literature, the risk premium is computed explicitely and endogenously. We provide a decomposition of the convenience yield risk premium in terms of the volatility of the convenience yield as well as in terms of the sensitivity of the marginal utility of investors to the movements of the convenience yield. This decomposition enables us to assess the impact of the risk aversion and investment horizon of investors on the futures contracts' basis and on the term structure of volatility for our illustration carried out in the case of the copper market.

David Pearce - One of the best experts on this subject based on the ideXlab platform.

  • Partial Equilibrium logic
    Annals of Mathematics and Artificial Intelligence, 2007
    Co-Authors: Pedro Cabalar, Sergei Odintsov, David Pearce, Agustín Valverde
    Abstract:

    Partial Equilibrium logic (PEL) is a new nonmonotonic reasoning formalism closely aligned with logic programming under well-founded and Partial stable model semantics. In particular it provides a logical foundation for these semantics as well as an extension of the basic syntax of logic programs. In this paper we describe PEL, study some of its logical properties and examine its behaviour on disjunctive and nested logic programs. In addition we consider computational features of PEL and study different approaches to its computation.

  • On the logic and computation of Partial Equilibrium models
    Lecture Notes in Computer Science, 2006
    Co-Authors: Pedro Cabalar, Sergei Odintsov, David Pearce, Agustín Valverde
    Abstract:

    The nonmonotonic formalism of Partial Equilibrium logic (PEL) has recently been proposed as a logical foundation for the Partial stable and well-founded semantics of logic programs [1,2]. We study certain logical properties of PEL and some techniques to compute Partial Equilibrium models.

  • JELIA - On the logic and computation of Partial Equilibrium models
    Logics in Artificial Intelligence, 2006
    Co-Authors: Pedro Cabalar, Sergei Odintsov, David Pearce, Agustín Valverde
    Abstract:

    The nonmonotonic formalism of Partial Equilibrium logic (PEL) has recently been proposed as a logical foundation for the Partial stable and well-founded semantics of logic programs [1,2]. We study certain logical properties of PEL and some techniques to compute Partial Equilibrium models.

  • analysing and extending well founded and Partial stable semantics using Partial Equilibrium logic
    Lecture Notes in Computer Science, 2006
    Co-Authors: Pedro Cabalar, Sergei Odintsov, David Pearce, Agustín Valverde
    Abstract:

    In [4] a nonmonotonic formalism called Partial Equilibrium logic (PEL) was proposed as a logical foundation for the well-founded semantics (WFS) of logic programs. PEL consists in defining a class of minimal models, called Partial Equilibrium (p-Equilibrium), inside a non-classical logic called HT 2 . In [4] it was shown that, on normal logic programs, p-Equilibrium models coincide with Przymusinki's Partial stable (p-stable) models. This paper begins showing that this coincidence still holds for the more general class of disjunctive programs, so that PEL can be seen as a way to extend WFS and p-stable semantics to arbitrary propositional theories. We also study here the problem of strong equivalence for various subclasses of p-Equilibrium models, investigate transformation rules and nonmonotonic inference, and consider a reduction of PEL to Equilibrium logic. In addition we examine the behaviour of PEL on nested logic programs and its complexity in the general case.

  • ICLP - Analysing and extending well-founded and Partial stable semantics using Partial Equilibrium logic
    Logic Programming, 2006
    Co-Authors: Pedro Cabalar, Sergei Odintsov, David Pearce, Agustín Valverde
    Abstract:

    In [4] a nonmonotonic formalism called Partial Equilibrium logic (PEL) was proposed as a logical foundation for the well-founded semantics (WFS) of logic programs. PEL consists in defining a class of minimal models, called Partial Equilibrium (p-Equilibrium), inside a non-classical logic called HT2. In [4] it was shown that, on normal logic programs, p-Equilibrium models coincide with Przymusinki’s Partial stable (p-stable) models. This paper begins showing that this coincidence still holds for the more general class of disjunctive programs, so that PEL can be seen as a way to extend WFS and p-stable semantics to arbitrary propositional theories. We also study here the problem of strong equivalence for various subclasses of p-Equilibrium models, investigate transformation rules and nonmonotonic inference, and consider a reduction of PEL to Equilibrium logic. In addition we examine the behaviour of PEL on nested logic programs and its complexity in the general case.