Skip Navigation



Journal of Logic and Computation Advance Access published online on April 5, 2008
Journal of Logic and Computation, doi:10.1093/logcom/exn006
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Meghini, C.
Right arrow Articles by Spyratos, N.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original papers

Synthesizing Monadic Predicates

Carlo Meghini

Consiglio Nazionale delle Ricerche, Istituto della Scienza e delle Tecnologie della Informazione, Pisa, Italy E-mail: carlo.meghini{at}isti.cnr.it

Nicolas Spyratos

Université Paris-Sud, Laboratoire de Recherche en Informatique, Orsay Cedex, France E-mail: spyratos{at}lri.fr

Received 8 September 2007.

We study the problem of determining a concise, quantifier-free monadic predicate for a given set of objects in a given interpretation. We address both DNF and CNF predicates, as well as important sub-languages thereof. The problem is formalized as the search of a minimal element in a set of predicates equipped with a binary relation. We show that the problem has always a solution, that finding a minimal solution is always hard, but much harder when neither the given set of objects nor its complement are the extent of a formal concept (in the sense of Formal Concept Analysis).

Keywords: CNF/DNF monadic predicates; complexity; formal concept analysis



References

  1. Adjiman P, Chatalic P, Goasdoué F, Rousset M-C, Simon L. Distributed reasoning in a peer-to-peer setting: Application to the semantic web. In: Journal of Artificial Intelligence Research (2006) 25:269–314.[ISI]
  2. Agrawal R, Srikant R. Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Databases, Septemper 1994: Santiago, Chile. San Francisco, CA: Morgan Kaufmann Publishers.
  3. Candela L, Castelli D, Pagano P. A service for supporting virtual views of large heterogeneous digital libraries. In: Lecture Notes in Computer Science—Koch T, Sølvberg I, eds. Proceedings of the 7th European Conference on Research and Advanced Technology for Digital Libraries, ECDL 2003, August 2003: Trondheim, Norway. Heidelberg: Springer-Verlag. 362–373.
  4. Candela L, Castelli D, Pagano P, Thanos C, Ioannidis Y, Koutrika G, Ross S, Schek Hans-Jrg, Schuldt Heiko. Setting the foundations of digital libraries. In: The DELOS Manifesto. D-Lib Magazine (2007) ;13(3/4).
  5. Candela L, Straccia U. The personalized, Collaborative digital library environment Cyclades and its collections management. In: Multimedia Distributed Information Retrieval—Callan J, Crestani F, Sanderson M, eds. (2004) Heidelberg: Springer Verlag. 156–172. Number 2924 in Lecture Notes in Computer Science.
  6. Carpineto C, Romano G. Information retrieval through hybrid navigation of lattice representations. In: International Journal of Human-Computer Studies (1996) 45:553–578.[CrossRef]
  7. Carpineto C, Romano G. A lattice conceptual clustering system and its application to browsing retrieval. In: Machine Learning (1996) 24:95–122.[ISI]
  8. Carpineto C, Romano G. Effective reformulation of boolean queries with concept lattices. In: Number 1495 in Lecture Notes in Artificial Intelligence. Proceedings of International Conference on Flexible Query Answering Systems, May 1998: Roskilde, Denmark. Heidelberg: Springer Verlag. 83–94.
  9. Carpineto C, Romano G. Order-theoretical ranking. In: Journal of American Society for Information Science (2000) 51:587–601.[CrossRef]
  10. Ganter B, Wille R. Applied lattice theory: Formal concept analysis. Available at: http://www.math.tu.dresden.de/~ganter/psfiles/concept.ps.
  11. Ganter B, Wille R. Formal Concept Analysis: Mathematical Foundations. (1999) Heidelberg: Springer Verlag.
  12. Garey MR, Johnson DS. Computers and Intractability, A Guide to the Theory of NP-Completeness. (1979) New York: W.H. Freeman and Company.
  13. Godin R, Gecsei J, Pichet C. Design of a browsing interface for information retrieval. In: Proceedings of SIGIR89, the Twelfth Annual International ACM Conference on Research and Development in Information Retrieval (1989) Cambridge, MA, USA: ACM. 32–39.
  14. André Gonçalves M, Fox EA, Watson LT, Kipp NA. Stream, structures, spaces, scenarios, societies (5s): A formal model for digital library. In: ACM TOIS (2004) 22:270–312.
  15. Halevy Alon Y. Answering queries using views: a survey. In: VLDB Journal (2001) 10:270–294.[CrossRef][ISI]
  16. Lenzerini M. Data integration: A theoretical perspective. Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 2002: Madison, Wisconsin, USA. Invited tutorial.
  17. Meghini C, Spyratos N. Preference-based query tuning through refinement/enlargement in a formal context. In: Vol. 3861 of Lecture Notes in Computer Science—Hegner S, Dix J, eds. Proceedings of the Fourth International Symposium on Foundations of Information and Knowledge Systems FoIKS 2006, February 2006: Budapest, Hungary. Heidelberg: Springer Verlag. 278–293.
  18. Meghini C, Spyratos N. Computing intensions of digital library collections. In: Vol. 4390 of Lecture Notes in Artificial Intelligence. Proceedings of ICFCA07, the 5th International Conference Formal on Concept Analysis. February 2007: Clermont-Ferrand, France. Heidelberg: Springer Verlag. 66–91.
  19. Pernelle N, Rousset M-C, Soldano H, Ventos V. Zoom: a nested galois lattices-based system for conceptual clustering. In: Journal on Experimental and Theoretical Artificial Intelligence (2002) 14:157–187.[CrossRef]
  20. Priss U. Lattice-based information retrieval. In: Knowledge Organization (2000) 27:132–142.[ISI]
  21. Priss U. Formal concept analysis in information science. In: Annual Review of Information Science and Technology (2006) 40:521–543.[CrossRef][ISI]
  22. Sarawagi S, Thomas S, Agrawal R. Integrating association rule mining with databases: alternatives and implications. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (1998) . Seattle, Washington, USA: ACM Press.
  23. Schewe K-D. A logical treatment of concept theories. In: Information Modelling and Knowledge Bases XIV—Kangassalo H, et al, eds. (2003) Amsterdam, The Netherlands: IOS Press. 1–13.

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Meghini, C.
Right arrow Articles by Spyratos, N.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?