Skip Navigation


Logic Journal of IGPL Advance Access originally published online on September 26, 2007
Logic Journal of IGPL 2007 15(5-6):457-474; doi:10.1093/jigpal/jzm035
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
15/5-6/457    most recent
jzm035v1
Right arrow References
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 do Amaral, F. N.
Right arrow Articles by Haeusler, E. H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

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

Using the Internal Logic of a Topos to Model Search Spaces for Problems

Fernando Náufel do Amaral

Dept. of Science and Technology, PURO, UFF, Rio das Ostras, RJ, Brazil. E-mail: fnaufel{at}ic.uff.br

Edward Hermann Haeusler

Dept. of Informatics, PUC-Rio, Rio de Janeiro, RJ, Brazil. E-mail: hermann{at}inf.puc-rio.br


  Abstract

We present a structural model for (meta)heuristic search strategies for solving computational problems. The model is defined through the use of topos-theoretical tools and techniques, which provide an appropriate internal logic (with the language of local set theory) where objects of interest can be represented.

Key Words: topos theory • internal logic • local set theory • search • heuristics • metaheuristics

Received for publication 15 September 2006.
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.