A framework for developing embeddable customized logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2372 LNCS, Issue , 2002, Pages 191-215

  Ferre, Sebastien ^a   Ridoux, Olivier ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; LOGIC PROGRAMMING; SEMANTICS; RECONFIGURABLE HARDWARE;

COMMON OPERATIONS; COMPOSITION LAW; FUNCTORS; SUBLOGICS; THEOREM PROVERS;

COMPUTER CIRCUITS;

EID: 84879496919     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45607-4_11     Document Type: Conference Paper

References (29)

1. M. Alt and F. Martin. Generation of efficient interprocedural analyzers with PAG. In Static Analysis Symp., LNCS 983, pages 33-50, 1995.
2. T. Armstrong, K. Marriott, P. Schachte, and H. Sndergaard. Two classes of boolean functions for dependency analysis. Science of Computer Programming, 31:3-45, 1998.
3. B. Beckert and J. Posegga. leanTAP: Lean, tableau-based deduction. J. Automated Reasoning, 11(1):43-81, 1995.
4. B. Beckert and J. Posegga. Logic programming as a basis for lean automated deduction. J. Logic Programming, 28(3):231-236, 1996.
5. M. Codish, H. Sndergaard, and P.J. Stuckey. Sharing and groundness dependencies in logic programs. ACM TOPLAS, 21(5):948-976, 1999.
6. F. Donini, M. Lenzerini, D. Nardi, and A. Schaerf. Reasoning in description logics. In G. Brewka, editor, Principles of Knowledge Representation and Reasoning, Studies in Logic, Language and Information, pages 193-238. CLSI Publications, 1996.
7. M. Fitting. leanTAP revisited. Journal of Logic and Computation, 8(1):33-47, February 1998.
8. S. Ferre 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.
9. S. Ferre and O. Ridoux. A logical generalization of formal concept analysis. In G. Mineau and B. Ganter, editors, Int. Conf. Conceptual Structures, LNCS 1867, pages 371-384. Springer, 2000.
10. S. Ferre and O. Ridoux. Searching for objects and properties with logical concept analysis. In H. S. Delugach and G. Stumme, editors, Int. Conf. Conceptual Structures, LNCS 2120, pages 187-201. Springer, 2001.
11. S. Ferre and O. Ridoux. Logic functors: a framework for developing embeddable customized logics. Rapport de recherche 4457, INRIA, 2002.
12. J.A. Goguen and R.M. Burstall. Institutions: Abstract model theory for specification and programming. J. ACM, 39(1):95-146, 1992.
13. 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.
14. B. Ganter and R. Wille. Formal Concept Analysis-Mathematical Foundations. Springer, 1999.
15. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. JACM, 40(1):143-184, January 1993.
16. V. Issarny and Ch. Bidan. Aster: A framework for sound customization of distributed runtime systems. In 16th Int. Conf. Distributed Computing Systems, 1996.
17. H. Levesque. All I know: a study in autoepistemic logic. Artificial Intelligence, 42(2), March 1990.
18. J.W. Lloyd. Foundations of Logic Programming. Symbolic computation-Artificial Intelligence. Springer, Berlin, 1987.
19. D.B. MacQueen. An implementation of Standard ML modules. In LISP and Functional Programming, pages 212-223, 1988.
20. K. Marriott and P.J. Stuckey. Programming with Constraints: An Introduction. The MIT Press, 1998.
21. R.A. O'Keefe. The Craft of Prolog. MIT Press, 1990.
22. L. C. Paulson. Isabelle: a generic theorem prover. LNCS 828. Springer, New York, NY, USA, 1994.
23. D. Poole. Representing knowledge for logic-based diagnosis. In Int. Conf. Fifth Generation Computer Systems, pages 1282-1290. Springer, 1988.
24. O. Ridouxand P. Boizumault. Typed static analysis: Application to the groundness analysis of typed prolog. Journal of Functional and Logic Programming, 2001(4), 2001.
25. O. Ridoux, P. Boizumault, and F. Malesieux. Typed static analysis: Application to groundness analysis of Prolog and ?Prolog. In Fuji Int. Symp. Functional and Logic Programming, pages 267-283, 1999.
26. 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.
27. G. Salton and M. J. McGill. Introduction to Modern Information Retrieval. McGraw-Hill, 1983.
28. 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, Dordrecht, NL, 1998.
29. 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.