30 search results - page 1 / 6 » Constructing the Least Models for Positive Modal Logic Progr... |
FUIN
2000
13 years 4 months ago
2000
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
IGPL
2008
2008
Constructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics
13 years 4 months ago
ENTCS
2010
13 years 1 months ago
2010
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...
POPL
2010
ACM
14 years 1 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
POPL
2007
ACM
14 years 4 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...