Name
Abstract | ||
|---|---|---|
Let P be an arbitrary theory and let X be any given logic. Let M be a set of atoms. We say that M is a X-stable model of P if M is a classical model of P and P∪¬M~ proves in logic X all atoms in M, this is denoted by P∪¬M~ ⊩xM. We prove that being an X-stable model is an invariant property for disjunctive programmes under a large class of logics. Two kinds of logics are mainly considered: paraconsistent logics and normal modal logics. For modal logics we use a translation proposed by Gelfond that replaces ¬a with ¬□a. As a consequence we prove that several semantics (recently introduced) for non-monotonic reasoning are equivalent for disjunctive programmes. In addition, we show that such semantics can be characterized by a fixed-point operator in terms of classical logic. We also present a simple translation of a disjunctive programme D into a normal programme N, such that the PStable model semantics of N corresponds to the stable semantics of D over the common language. We present the formal proof of this statement. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1093/logcom/exn015 | J. Log. Comput. |
Keywords | Field | DocType |
paraconsistent logic | Discrete mathematics,T-norm fuzzy logics,Łukasiewicz logic,Normal modal logic,Kripke semantics,Paraconsistent logic,Algorithm,Non-monotonic logic,Monoidal t-norm logic,Classical logic,Mathematics | Journal |
Volume | Issue | ISSN |
18 | 6 | 0955-792X |
Citations | PageRank | References |
24 | 1.33 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mauricio Osorio | 1 | 436 | 52.82 |
| José R. Arrazola Ramírez | 2 | 84 | 6.85 |
| José Luis Carballido | 3 | 53 | 12.62 |