Switch to: References

Add citations

You must login to add citations.
  1. Disjunctive logic programs, answer sets, and the cut rule.Éric Martin - 2022 - Archive for Mathematical Logic 61 (7):903-937.
    In Minker and Rajasekar (J Log Program 9(1):45–74, 1990), Minker proposed a semantics for negation-free disjunctive logic programs that offers a natural generalisation of the fixed point semantics for definite logic programs. We show that this semantics can be further generalised for disjunctive logic programs with classical negation, in a constructive modal-theoretic framework where rules are built from _claims_ and _hypotheses_, namely, formulas of the form \(\Box \varphi \) and \(\Diamond \Box \varphi \) where \(\varphi \) is a literal, respectively, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Nonmonotonicity in the Framework of Parametric Logic.Éric Martin - 2019 - Studia Logica 107 (5):1025-1077.
    Parametric logic is a framework that generalises classical first-order logic. A generalised notion of logical consequence—a form of preferential entailment based on a closed world assumption—is defined as a function of some parameters. A concept of possible knowledge base—the counterpart to the consistent theories of first-order logic—is introduced. The notion of compactness is weakened. The degree of weakening is quantified by a nonnull ordinal—the larger the ordinal, the more significant the weakening. For every possible knowledge base T, a hierarchy of (...)
    Download  
     
    Export citation  
     
    Bookmark