References

[AM95]

M. Alt and F. Martin. Generation of efficient interprocedural analyzers with PAG. In Static Analysis Symp., LNCS 983, pages 33–50, 1995.

[AMSS98]

T. Armstrong, K. Marriott, P. Schachte, and H. Søndergaard. Two classes of boolean functions for dependency analysis. Science of Computer Programming, 31:3–45, 1998.

[BP95]

B. Beckert and J. Posegga. leanTAP: Lean, tableau-based deduction. J. Automated Reasoning, 11(1):43–81, 1995.

[CLN98]

D. Calvanese, M. Lenzerini, and D. Nardi. Description logics for conceptual data modeling. In J. Chomicki and G. Saake, editors, Logics for Databases and Information Systems, pages 229–263. Kluwer, 1998.

[CSS99]

M. Codish, H. Søndergaard, and P.J. Stuckey. Sharing and groundness dependencies in logic programs. ACM TOPLAS, 21(5):948–976, 1999.

[dCFG⁺01]

L. Fariñas del Cerro, D. Fauthoux, O. Gasquet, A. Herzig, D. Longin, and F. Massacci. Lotrec: The generic tableau prover for modal and description logics. In R. Goré, A. Leitsch, and T. Nipkow, editors, IJCAR, LNAI 2083. Springer, 2001.

[DNR97]

F. M. Donini, D. Nardi, and R. Rosati. Autoepistemic description logics. In IJCAI, 1997.

[DP90]

B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.

[Fer02]

S. Ferré. Systèmes d'information logiques : un paradigme logico-contextuel pour interroger, naviguer et apprendre. Thèse d'université, Université de Rennes 1, October 2002. Accessible en ligne à l'adresse http://www.irisa.fr/bibli/publi/theses/theses02.html.

[Fer06]

S. Ferré. Negation, opposition, and possibility in logical concept analysis. In Rokia Missaoui and Jürg Schmid, editors, Int. Conf. Formal Concept Analysis, LNCS 3874, pages 130–145. Springer, 2006.

[Fit98]

M. Fitting. leanTAP revisited. Journal of Logic and Computation, 8(1):33–47, February 1998.

[FK05]

S. Ferré and R. D. King. A dichotomic search algorithm for mining and learning in domain-specific logics. Fundamenta Informaticae – Special Issue on Advances in Mining Graphs, Trees and Sequences, 66(1-2):1–32, 2005.

[FR00]

S. Ferré and O. Ridoux. A file system based on concept analysis. In Y. Sagiv, editor, Int. Conf. Rules and Objects in Databases, LNCS 1861, pages 1033–1047. Springer, 2000.

[FR04]

S. Ferré and O. Ridoux. An introduction to logical information systems. Information Processing & Management, 40(3):383–419, 2004.

[GB92]

J.A. Goguen and R.M. Burstall. Institutions: Abstract model theory for specification and programming. J. ACM, 39(1):95–146, 1992.

[GPT96]

F. Giunchiglia, P. Pecchiari, and C. Talcott. Reasoning theories - towards an architecture for open mechanized reasoning systems. In F. Baader and K. U. Schulz, editors, 1st Int. Workshop: Frontiers of Combining Systems, pages 157–174. Kluwer Academic Publishers, March 1996.

[GW99]

B. Ganter and R. Wille. Formal Concept Analysis — Mathematical Foundations. Springer, 1999.

[HHP93]

R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. JACM, 40(1):143–184, January 1993.

[HS01]

I. Horrocks and U. Sattler. Ontology reasoning in the shoq(d) description logic. In Int. J. Conf. Artificial Intelligence, volume 17, pages 199–204. Lawrence Erlbaum Associates Ltd, 2001.

[IB96]

V. Issarny and Ch. Bidan. Aster: A framework for sound customization of distributed runtime systems. In 16th Int. Conf. Distributed Computing Systems, 1996.

[LCVH92]

B Le Charlier and P. Van Hentenryck. A universal top-down fixpoint algorithm. Technical Report CS-92-25, Brown University, Rhode Island, 1992.

[Lev90]

H. Levesque. All I know: a study in autoepistemic logic. Artificial Intelligence, 42(2), March 1990.

[Llo87]

J.W. Lloyd. Foundations of Logic Programming. Symbolic computation — Artificial Intelligence. Springer, Berlin, 1987.

[LS00]

C. Lutz and U. Sattler. Mary likes all cats. In F. Baader and U. Sattler, editors, 2000 Int. Workshop in Description Logics (DL2000), number 33 in CEUR-WS, pages 213–226, Aachen, Germany, August 2000. RWTH Aachen.

[Mac88a]

D.B. MacQueen. An implementation of Standard ML modules. In LISP and Functional Programming, pages 212–223, 1988.

[Mac88b]

D.B. MacQueen. An implementation of Standard ML modules. In LISP and Functional Programming, pages 212–223, 1988.

[MS98]

K. Marriott and P.J. Stuckey. Programming with Constraints: An Introduction. The MIT Press, 1998.

[Pau94]

L. C. Paulson. Isabelle: a generic theorem prover. LNCS 828. Springer, New York, NY, USA, 1994.

[Poo88]

D. Poole. Representing knowledge for logic-based diagnosis. In Int. Conf. Fifth Generation Computer Systems, pages 1282–1290. Springer, 1988.

[SFRW98]

M. Sagiv, N. Francez, M. Rodeh, and R. Wilhelm. A logic-based approach to program flow analysis. Acta Informatica, 35(6):457–504, June 1998.

[SM83]

G. Salton and M. J. McGill. Introduction to Modern Information Retrieval. McGraw-Hill, 1983.

[vRCL98]

C.J. van Rijsbergen, F. Crestani, and M. Lalmas, editors. Information Retrieval: Uncertainty and Logics. Advanced models for the representation and retrieval of information. Kluwer Academic Publishing, 1998.

[Wen97]

M. Wenzel. Type classes and overloading in higher-order logic. In E.L. Gunter and A. Felty, editors, Theorem proving in higher-order logics, LNCS 1275, pages 307–322. Springer-Verlag, 1997.