Abstract | ||
---|---|---|
We define what we call 'possibilistic intermediate logic (PIL)'; we present results analogous to those of the well-known intermediate logic, such as a deduction theorem, a generalised version of the deduction theorem, a cut rule, a weak version of a refutation theorem, a substitution theorem and Glivenko's theorem. Also, we present a definition for 'possibilistic safe beliefs'. This definition allows us to establish a relation between safe beliefs, as presented on 'applications of intuitionistic logic in answer set programming' by Osorio et al., and our version for possibilistic intermediate logic (PILX). We also present a characterisation of possibilistic safe beliefs for possibilistic normal logic programs. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1504/IJAIP.2012.048143 | IJAIP |
Keywords | Field | DocType |
possibilistic intermediate logic,present result,intuitionistic logic,well-known intermediate logic,substitution theorem,possibilistic normal logic program,deduction theorem,generalised version,refutation theorem,possibilistic safe belief,intermediate logic | Intuitionistic logic,Deduction theorem,Second-order logic,Computer science,Cut rule,Algorithm,Artificial intelligence,Possibilistic logic,Answer set programming,Intermediate logic,Calculus,Machine learning | Journal |
Volume | Issue | Citations |
4 | 2 | 2 |
PageRank | References | Authors |
0.49 | 8 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Oscar Hernán Estrada-Estrada | 1 | 2 | 0.49 |
José Ramón Enrique Arrazola-Ramírez | 2 | 2 | 0.49 |
Mauricio Osorio | 3 | 436 | 52.82 |