Search the dblp DataBase
Raymond Rolland: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Yves Moinard, Raymond Rolland
Unexpected and Unwanted Results of Circumscription. [Citation Graph (0, 0)][DBLP]
AIMSA, 1990, pp:61-70 [Conf] - Yves Moinard, Raymond Rolland
Smallest Equivalent Sets for Finite Propositional Formula Circumscription. [Citation Graph (0, 0)][DBLP]
Computational Logic, 2000, pp:897-911 [Conf] - Philippe Besnard, Jean Houdebine, Raymond Rolland
A Formula Circumscriptively both Valid and Unprovable. [Citation Graph (0, 0)][DBLP]
ECAI, 1988, pp:516-518 [Conf] - Yves Moinard, Raymond Rolland
Equivalent Sets of Formulas for Circumscriptions. [Citation Graph (0, 0)][DBLP]
ECAI, 2000, pp:479-483 [Conf] - Yves Moinard, Raymond Rolland
Circumscription and Definability. [Citation Graph (0, 0)][DBLP]
IJCAI, 1991, pp:432-437 [Conf] - Yves Moinard, Raymond Rolland
Around a Powerful Property of Circumscriptions. [Citation Graph (0, 0)][DBLP]
JELIA, 1994, pp:34-49 [Conf] - Yves Moinard, Raymond Rolland
Preferential Entailments for Circumscriptions. [Citation Graph (0, 0)][DBLP]
KR, 1994, pp:461-472 [Conf] - Yves Moinard, Raymond Rolland
Characterizations of Preferential Entailments. [Citation Graph (0, 0)][DBLP]
Logic Journal of the IGPL, 2002, v:10, n:3, pp:245-272 [Journal]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002