Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
Publications
[go: Go Back, main page]

Menu:

Address:

Vítor Santos Costa
Professor Auxiliar

Departamento de Ciência de Computadores
Faculdade de Ciências
Universidade do Porto
Rua do Campo Alegre, 1021/1055
4169 - 007 PORTO
Portugal

Phone: +351 220 402 945
Fax: +351 220 402 950

E-Mail:
vsc AT dcc.fc.up.pt

Books

[1] E. Pontelli and V. Santos Costa, eds., Practical Aspects of Declarative Languages. No. 1753 in Lecture Notes in Computer Science, Springer Verlag, 2000. [ bib | html ]
[2] I. C. Dutra, M. Carro, G. Gupta, E. Pontelli, V. Santos Costa, and F. S. (eds.), eds., Parallelism and Implementation of (Constraint) Logic Programming. Nova Science, 1999. [ bib ]

Journal papers

[1] J. S. Bernardes, A. M. Davila, V. Santos Costa, and G. Zaverucha, “Improving Model Construction of Profile HMMs for Remote Homology Detection Through Structural Alignment,” BMC Bioinformatics, 2007. [ bib | html ]
[2] A. F. da Silva and V. Santos Costa, “Our experiences with optimizations in sun's java just-in-time compilers,” J. UCS, vol. 12, no. 7, pp. 788-810, 2006. [ bib | pdf ]
[3] A. F. da Silva and V. Santos Costa, “The design of the yap compiler: An optimizing compiler for logic programming languages.,” J. UCS, vol. 12, no. 7, pp. 764-787, 2006. [ bib | pdf ]
[4] A. F. da Silva and V. Santos Costa, “An experimental evaluation of java jit technology.,” J. UCS, vol. 11, no. 7, pp. 1291-1309, 2005. [ bib | pdf ]
[5] R. Rocha, F. Silva, and V. Santos Costa, “On Applying Or-Parallelism and Tabling to Logic Programs,” Theory and Practice of Logic Programming Systems, vol. 5, no. 1-2, pp. 161-205, 2005. [ bib | pdf | html ]
[6] V. Santos Costa, A. Srinivasan, R. Camacho, H. Blockeel, B. Demoen, G. Janssens, J. Struyf, H. Vandecasteele, and W. Van Laer, “Query Transformations for Improving the Efficiency of ILP Systems,” Journal of Machine Learning Research, vol. 4, pp. 465-491, August 2003. [ bib | html ]
[7] V. Santos Costa, R. Bianchini, and I. C. Dutra, “Parallel Logic Programming Systems on Scalable Architectures,” Journal of Parallel and Distributed Computing, vol. 60, pp. 835-852, July 2000. [ bib | html | .ps.gz ]
[8] K. Shen, V. Santos Costa, and A. King, “Distance: a New Metric for Controlling Granularity for Parallel Execution,” Journal of Functional and Logic Programming, vol. 1999, April 1999. [ bib | pdf | html ]
[9] G. Gupta and V. Santos Costa, “Cuts and Side-Effects in And-Or Parallel Prolog,” Journal of Logic Programming, vol. 27, pp. 45-71, April 1996. [ bib | pdf | html ]
[10] V. Santos Costa, D. H. D. Warren, and R. Yang, “Andorra-I Compilation,” New Generation Computing, vol. 14, no. 1, pp. 3-30, 1996. [ bib | pdf ]
[11] M. E. Correia, F. Silva, and V. Santos Costa, “Aurora vs. Muse; A Portability Study of Two Or-Parallel Prolog Systems,” Computing Systems in Engineering, vol. 6, no. 4/5, pp. 345-349, 1995. [ bib | pdf | html ]
[12] R. Bahgat, V. Santos Costa, and R. Yang, “ARCH: A Parallel Execution Model that Minimises the Search Space of Logic Programs,” The Egyptian Computer Journal, vol. 23, no. 2, 1995. [ bib ]
[13] G. Gupta and V. Santos Costa, “Optimal implementation of and-or parallel Prolog,” Future Generation Computer Systems, vol. 14, no. 10, pp. 71-92, 1994. [ bib | pdf ]
[14] G. Gupta, M. V. Hermenegildo, and V. Santos Costa, “And-Or Parallel Prolog: A Recomputation based Approach,” New Generation Computing, vol. 11, no. 3,4, pp. 770-782, 1993. [ bib | pdf ]

Book Chapters

[1] V. Santos Costa, C. D. Page, and J. Cussens, Probabilistic Inductive Logic Programming, ch. CLP(BN): Constraint Logic Programming for Probabilistic Knowledge. Springer-Verlag, 2007. (to appear). [ bib | pdf ]
[2] J. Davis, D. Page, E. Burnside, I. Dutra, R. Ramakrishnan, J. Shavlik, and V. Santos Costa, Introduction to Statistical Relational Learning, ch. Learning a New View of a Database: With an Application in Mammography. MIT Press, 2007. [ bib ]
[3] R. J. Mooney, P. Melville, R. L. Tang, J. Shavlik, I. Dutra, D. Page, and V. Santos Costa, Data Mining: Next Generation Challenges and Future Directions, ch. Relational Data Mining with Inductive Logic Programming for Link Discovery, pp. 239-254. AAAI Press, 2004. [ bib ]
[4] V. Santos Costa, Encyclopedia of Computer Science and Technology, vol. 42, ch. Parallelism and Implementation Technology for Logic Programming Languages, pp. 197-237. Marcel Dekker Inc, 2000. [ bib | pdf ]
[5] R. Lopes and V. Santos Costa, Parallelism and Implementation of Logic and Constraint Logic Programming, ch. The BEAM: Towards a first EAM Implementation, pp. 87-106. Nova Science, Inc., 1999. [ bib ]
[6] R. Lopes and V. Santos Costa, Parallelism and Implementation of Logic and Constraint Logic Programming, ch. The YAIL: An Intermediate Language for Native Compilation of Prolog Programs, pp. 313-328. Nova Science, Inc., 1999. [ bib ]
[7] V. Santos Costa, “Um sistema capaz de executar programs prolog em paralelo,” in Prémio Científico IBM, de 1990 a 1996, pp. 95-115, IBM Portugal, December 1997. [ bib ]
[8] S. Konstantopoulos, R. Camacho, N. Fonseca, and V. Santos Costa, Artificial Intelligence for Advanced Problem Solving Techniques, ch. Induction as a Search Procedure. Idea Group Inc., (to appear). [ bib | pdf ]

Conference papers

[1] N. A. Fonseca, R. Camacho, V. Santos Costa, and R. Rocha, “k-RNN: k-Relational Nearest Neighbour Algorithm,” in Proceedings of 2008 ACM Symposium on Applied Computing (SAC 2008), ACM, March 2008. (in press). [ bib ]
[2] V. Santos Costa, K. Sagonas, and R. Lopes, “Demand-driven indexing of prolog clauses,” in Proceedings of the 23rd International Conference on Logic Programming (V. Dahl and I. Niemelä, eds.), vol. 4670 of Lecture Notes in Computer Science, pp. 305-409, Springer, 2007. [ bib ]
[3] A. F. d. Silva and V. Santos Costa, “Design, implementation, and evaluation of an dynamic compilation framework for the yap system,” in Proceedings of the 23rd International Conference on Logic Programming (V. Dahl and I. Niemelä, eds.), vol. 4670 of Lecture Notes in Computer Science, Springer, 2007. [ bib ]
[4] J. Davis, V. Santos Costa, S. Ray, and D. Page, “An integrated approach to feature invention and model construction for drug activity prediction,” in Proceedings of the 24th International Conference on Machine Learning (Z. Ghahramani, ed.), pp. 217-224, 2007. [ bib ]
[5] I. M. Ong, S. E. Topper, D. Page, and V. Santos Costa, “Inferring regulatory networks from time series expression data and relational data via inductive logic programming,” in Inductive Logic Programming, 16th International Conference, ILP 2006, A Coruña, España, Proceedings, Lecture Notes in Artificial Intelligence, Springer, 2007. [ bib ]
[6] J. Davis, I. M. Ong, J. Struyf, E. S. Burnside, D. Page, and V. Santos Costa, “Change of representation for statistical relational learning.,” in IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007 (M. M. Veloso, ed.), pp. 2719-2726, 2007. [ bib | pdf ]
[7] V. Santos Costa, “Prolog performance on larger datasets.,” in Practical Aspects of Declarative Languages, 9th International Symposium, PADL 2007, Nice, France, January 14-15, 2007. (M. Hanus, ed.), vol. 4354 of Lecture Notes in Computer Science, pp. 185-199, Springer, 2007. [ bib ]
[8] K. Revoredo, A. Paes, G. Zaverucha, and V. Santos Costa, “Combinando invençao de predicados e revisao de teorias probabil+isticas de primeira-ordem,” in VI Encontro Nacional de Inteligência Artificial (ENIA-07), 2007. [ bib ]
[9] A. Paes, G. Zaverucha, and V. Santos Costa, “Revisando teorias lógicas de primeira-ordem a partir de exemplos usando busca local estocástica,” in VI Encontro Nacional de Inteligência Artificial (ENIA-07), 2007. [ bib ]
[10] A. Paes, K. Revoredo, G. Zaverucha, and V. Santos Costa, “PFORTE: Revising Probabilistic FOL Theories,” in Advances in Artificial Intelligence - IBERAMIA-SBIA 2006, 2nd International Joint Conference, 10th Ibero-American Conference on AI, 18th Brazilian AI Symposium, Ribeirao Preto, Brazil, October 23-27, 2006, Proceedings (J. S. Sichman, H. Coelho, and S. O. Rezende, eds.), vol. 4140 of Lecture Notes in Computer Science, pp. 441-450, Springer, 2006. [ bib ]
[11] N. A. Fonseca, F. Silva, V. Santos Costa, and R. Camacho, “A pipelined data-parallel algorithm for ILP,” in Proceedings of 2005 IEEE International Conference on Cluster Computing, (Boston, Massachusetts, USA), IEEE, September 2005. [ bib | html ]
[12] J. Davis, E. S. Burnside, I. de Castro Dutra, D. Page, and V. Santos Costa, “Knowledge discovery from structured mammography reports using inductive logic programming,” in American Medical Informatics Association 2005 Annual Symposium, pp. 86-100, 2005. [ bib ]
[13] J. Davis, E. S. Burnside, I. de Castro Dutra, D. Page, and V. Santos Costa, “An integrated approach to learning bayesian networks of rules,” in Machine Learning: ECML 2005, 16th European Conference on Machine Learning, Porto, Portugal, October 3-7, 2005, Proceedings (J. Gama, R. Camacho, P. Brazdil, A. Jorge, and L. Torgo, eds.), vol. 3720 of Lecture Notes in Computer Science, pp. 84-95, Springer, 2005. [ bib ]
[14] R. Rocha, N. Fonseca, and V. Santos Costa, “On applying tabling to inductive logic programming,” in Machine Learning: ECML 2005, 16th European Conference on Machine Learning, Porto, Portugal, October 3-7, 2005, Proceedings (J. Gama, R. Camacho, P. Brazdil, A. Jorge, and L. Torgo, eds.), vol. 3720 of Lecture Notes in Computer Science, pp. 707-714, Springer, 2005. [ bib ]
[15] I. M. Ong, I. de Castro Dutra, D. Page, and V. Santos Costa, “Mode directed path finding,” in Machine Learning: ECML 2005, 16th European Conference on Machine Learning, Porto, Portugal, October 3-7, 2005, Proceedings (J. Gama, R. Camacho, P. Brazdil, A. Jorge, and L. Torgo, eds.), vol. 3720 of Lecture Notes in Computer Science, pp. 673-681, Springer, 2005. [ bib ]
[16] R. Rocha, F. M. A. Silva, and V. Santos Costa, “Dynamic mixed-strategy evaluation of tabled logic programs.,” in Logic Programming, 21st International Conference, ICLP 2005, Sitges, Spain, October 2-5, 2005, Proceedings (M. Gabbrielli and G. Gupta, eds.), vol. 3668 of Lecture Notes in Computer Science, pp. 250-264, Springer, 2005. [ bib ]
[17] J. Davis, E. S. Burnside, I. Dutra, D. Page, R. Ramakrishnan, V. Santos Costa, and J. W. Shavlik, “View learning for statistical relational learning: With an application to mammography.,” in IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30-August 5, 2005 (L. P. Kaelbling and A. Saffiotti, eds.), pp. 677-683, Professional Book Center, 2005. [ bib ]
[18] A. Paes, K. Revoredo, G. Zaverucha, and V. Santos Costa, “Probabilistic first-order theory revision from examples.,” in Inductive Logic Programming, 15th International Conference, ILP 2005, Bonn, Germany, August 10-13, 2005, Proceedings (S. Kramer and B. Pfahringer, eds.), vol. 3625 of Lecture Notes in Computer Science, pp. 295-311, Springer, 2005. [ bib ]
[19] H. C. Bravo, D. Page, R. Ramakrishnan, J. W. Shavlik, and V. Santos Costa, “A framework for set-oriented computation in inductive logic programming and its application in generalizing inverse entailment.,” in Inductive Logic Programming, 15th International Conference, ILP 2005, Bonn, Germany, August 10-13, 2005, Proceedings (S. Kramer and B. Pfahringer, eds.), vol. 3625 of Lecture Notes in Computer Science, pp. 69-86, Springer, 2005. [ bib ]
[20] J. Davis, I. Dutra, D. Page, and V. Santos Costa, “Establishing identity equivalence in multi-relational domains,” in Proceedings of the 2005 International Conference on Intelligence Analysis, 2005. [ bib ]
[21] J. A. L. Sanches, P. K. Vargas, I. de Castro Dutra, V. Santos Costa, and C. F. R. Geyer, “Regs: user-level reliability in a grid environment,” in 5th International Symposium on Cluster Computing and the Grid (CCGrid 2005), 9-12 May, 2005, Cardiff, UK, pp. 718-725, IEEE Computer Society, 2005. [ bib ]
[22] R. Lopes and V. S. Costa, “Improving memory usage in the beam.,” in Practical Aspects of Declarative Languages, 7th International Symposium, PADL 2005, Long Beach, CA, USA, January 10-11, 2005, Proceedings (M. V. Hermenegildo and D. Cabeza, eds.), vol. 3350 of Lecture Notes in Computer Science, pp. 143-157, Springer, 2005. [ bib ]
[23] A. Paes, K. Revoredo, G. Zaverucha, and V. Santos Costa, “Revisao de teorias probabilísticas de primeira-ordem,” in V Encontro Nacional de Inteligência Artificial (ENIA-05), pp. 742-751, 2005. [ bib ]
[24] A. Paes, K. Revoredo, G. Zaverucha, and V. Santos Costa, “Comparaçao de funçoes de avaliaçao em revisao de teorias probabilísticas de primeira-ordem,” in VII Congresso Brasileiro de Redes Neurais (CBRN-05), pp. 932-941, 2005. [ bib ]
[25] R. Lopes, V. S. Costa, and F. Silva, “Pruning in the extended andorra model,” in Practical Aspects of Declarative Languages, 6th International Symposium, vol. 3057, (Dallas, Texas), pp. 120-134, June 2004. [ bib ]
[26] R. Rocha, F. M. A. Silva, and V. S. Costa, “Speculative computations in or-parallel tabled logic programs.,” in Logic Programming, 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings (B. Demoen and V. Lifschitz, eds.), vol. 3132 of Lecture Notes in Computer Science, pp. 254-268, Springer, 2004. [ bib ]
[27] R. Rocha, F. M. A. Silva, and V. S. Costa, “Concurrent table accesses in parallel tabled logic programs.,” in Euro-Par 2004 Parallel Processing, 10th International Euro-Par Conference, Pisa, Italy, August 31-September 3, 2004, Proceedings (M. Danelutto, M. Vanneschi, and D. Laforenza, eds.), vol. 3149 of Lecture Notes in Computer Science, pp. 662-670, Springer, 2004. [ bib ]
[28] N. Fonseca, V. S. Costa, F. M. A. Silva, and R. Camacho, “On avoiding redundancy in inductive logic programming.,” in Inductive Logic Programming, 14th International Conference, ILP 2004, Porto, Portugal, September 6-8, 2004, Proceedings (R. Camacho, R. D. King, and A. Srinivasan, eds.), vol. 3194 of Lecture Notes in Computer Science, pp. 132-146, Springer, 2004. [ bib ]
[29] R. Lopes, V. S. Costa, and F. Silva, “On deterministic computations in the extended andorra model,” in ICLP03, vol. 2916, (Mumbai, India), pp. 120-134, December 2003. [ bib ]
[30] N. Fonseca, V. Santos Costa, F. Silva, and R. Camacho, “Experimental Evaluation of a Caching Technique for ILP,” in Portuguese Conference on Artificial Intelligence (EPIA), vol. 2902 of Lecture Notes in Computer Science, (Beja, Portugal), pp. 151-155, Springer, December 2003. [ bib ]
[31] R. Lopes, V. Santos Costa, and F. Silva, “On The BEAM Implementation,” in Portuguese Conference on Artificial Intelligence (EPIA), vol. 2902 of Lecture Notes in Computer Science, (Beja, Portugal), pp. 131-135, Springer, December 2003. [ bib ]
[32] I. C. Dutra, D. Page, V. Santos Costa, J. W. Shavlik, and M. Waddell, “Towards automatic management of embarassingly parallel applications,” in Proceedings of Europar 2003, vol. 2790 of Lecture Notes in Computer Science, (Klagenfurt, Austria), pp. 509-516, Springer Verlag, August 2003. [ bib ]
[33] V. Santos Costa, D. Page, M. Qazi, and J. Cussens, “CLP(BN): Constraint Logic Programming for Probabilistic Knowledge,” in Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence (UAI03), (Acapulco, Mexico), pp. 517-524, August 2003. [ bib ]
[34] T. Trevisan, V. S. Costa, L. Whately, and C. Amorim, “Distributed Shared Memory in Kernel Mode,” in 14th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2002), (Vitória, ES, Brasil), pp. 159-168, IEEE Computer Society, October 2002. [ bib ]
[35] R. Lopes, L. F. Castro, and V. Santos Costa, “From Simulation to Practice: Cache Performance Study of a Prolog System,” in ACM SIGPLAN Workshop on Memory System Performance, Berlin, Germany, June 2002. SIGPLAN Notices vol 38(2), February 2003, pages 56-64. [ bib ]
[36] R. Rocha, F. Silva, and V. Santos Costa, “Achieving Scalability in Parallel Tabled Logic Programs,” in Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPPDPS02), Fort Lauderdale, Florida, USA, April 2002. [ bib ]
[37] I. de Castro Dutra, D. Page, V. S. Costa, and J. W. Shavlik, “An Empirical Evaluation of Bagging in Inductive Logic Programming,” in Inductive Logic Programming, 12th International Conference, vol. 2583 of Lecture Notes in Computer Science, (Sydney, Australia), pp. 48-65, Springer Verlag, 2002. [ bib ]
[38] M. Lobosco, V. S. Costa, and C. L. de Amorim, “Performance Evaluation of Fast Ethernet, Giganet, and Myrinet on a Cluster,” in Proceedings of the International Conference on Computer Science, ICCS, 2002, Amsterdam, Netherlands, 2002. [ bib ]
[39] L. F. Castro and V. Santos Costa, “Understanding Memory Management in Prolog Systems,” in Proceedings of Logic Programming, 17th International Conference, ICLP 2001, vol. 2237 of Lecture Notes in Computer Science, (Paphos, Cyprus), pp. 11-26, November 2001. [ bib ]
[40] R. Rocha, F. Silva, and V. Santos Costa, “On A Tabling Engine That Can Exploit Or-Parallelism,” in Proceedings of Logic Programming, 17th International Conference, ICLP 2001, vol. 2237 of Lecture Notes in Computer Science, (Paphos, Cyprus), pp. 43-58, November 2001. [ bib ]
[41] R. Lopes, V. S. Costa, and F. Silva, “A novel implementation of the extended andorra model,” in Proceedings of PADL01: The 2001 Conference on the Practical Aspects of Declarative Languages, vol. 1990, (Las Vegas, NV, USA), pp. 199-213, 2001. [ bib ]
[42] R. Rocha, F. Silva, and V. S. Costa, “A Tabling Engine for the Yap Prolog System,” in Proceedings of the APPIA-GULP-PRODE Joint Conference on Declarative Programming, (La Habana, Cuba), December 2000. [ bib ]
[43] R. Lopes and V. Santos Costa, “A Performance Analysis of the BEAM Memory Manager,” in Proceedings of APPIA-GULP-PRODE Joint Conference on Declarative Programming, (La Habana, Cuba), December 2000. [ bib ]
[44] V. Santos Costa, R. Rocha, and F. Silva, “Novel Models for Or-Parallel Logic Programs: A Performance Analysis,” in Proceedings of EuroPar2000, LNCS 1900, pp. 744-753, September 2000. [ bib ]
[45] I. C. Dutra, V. Santos Costa, and R. Bianchini, “The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems,” in Proceedings of CL'2000, LNAI 1861, pp. 1285-1299, July 2000. [ bib ]
[46] V. Santos Costa, A. Srinivasan, and R. Camacho, “A note on two simple transformations for improving the efficiency of an ILP system,” in Proceedings of ILP'2000, LNAI 1866, pp. 225-242, July 2000. [ bib ]
[47] V. Santos Costa, “Optimising bytecode emulation for prolog,” in LNCS 1702, Proceedings of PPDP'99, pp. 261-267, Springer-Verlag, September 1999. [ bib ]
[48] R. Rocha, F. Silva, and V. Santos Costa, “YapOr: an Or-Parallel Prolog System based on Environment Copying,” in LNAI 1695, Proceedings of EPPIA'99: The 9th Portuguese Conference on Artificial Intelligence, pp. 178-192, Springer-Verlag LNAI Series, September 1999. [ bib ]
[49] L. F. Castro, V. Santos Costa, C. F. Geyer, F. Silva, P. K. Vargas, and M. E. Correia, “LNCS 1685, DAOS - Scalable And-0r Parallelism,” in Proceedings of EuroPar99, pp. 899-908, Springer-Verlag, September 1999. [ bib ]
[50] R. Lopes and V. Santos Costa, “The BEAM: a first EAM Implementation,” in Proceedings of AGP99: The 1999 Joint Conference on Declarative Programming, pp. 425-439, September 1999. [ bib ]
[51] V. Santos Costa, “Cowl: Copy-on-write for logic programs,” in Proceedings of the IPPS/SPDP99, pp. 720-727, IEEE Computer Press, May 1999. [ bib ]
[52] M. G. Silva, I. C. Dutra, R. Bianchini, and V. Santos Costa, “LThe Influence of Computer Architectural Parameters on Parallel Logic Programming Systems,” in Workshop on Practical Aspects of Declarative Languages (PADL99), LNCS1551, pp. 122-136, Springer-Verlag, January 1999. Also available as Technical Report ES/477-98, COPPE Systems Engineering, Sep/98. [ bib ]
[53] R. Rocha, F. Silva, and V. Santos Costa, “Or-parallelism within tabling,” Lecture Notes in Computer Science, vol. 1551, pp. 137-151, 1999. [ bib ]
[54] N. Fonseca, I. C. Dutra, and V. Santos Costa, “VisAll: An Universal Tool to Visualise Parallel Execution of Logic Programs,” in Joint International Conference and Symposium on Logic Programming, (Manchester, UK), pp. 100-114, MIT Press, June 1998. [ bib ]
[55] K. Shen, V. Santos Costa, and A. King, “Distance: A New Metric for Controlling Granularity for Parallel Execution,” in Joint International Conference and Symposium on Logic Programming, (Manchester, UK), pp. 85-99, MIT Press, June 1998. [ bib ]
[56] V. Santos Costa and R. Bianchini, “Optimising Parallel Logic Programming Systems for Scalable Machines,” in LNCS 1470, Proceedings of Europar 1998, Southampton, UK, pp. 831-841, Springer-Verlag, 1998. [ bib ]
[57] M. E. Correia, F. Silva, and V. Santos Costa, “The SBA: Exploiting orthogonality in OR-AND Parallel Systems.,” in Logic Programming, Proceedings of the 1997 International Symposium, pp. 117-131, MIT Press, October 1997. Also published as Technical Report DCC-97-3, DCC - FC & LIACC, Universidade do Porto, April, 1997. [ bib ]
[58] V. Santos Costa, R. Bianchini, and I. C. Dutra, “Parallel Logic Programming Systems on Scalable Multiprocessors,” in Proceedings of the 2nd International Symposium on Parallel Symbolic Computation, PASCO'97, pp. 58-67, July 1997. [ bib ]
[59] V. Santos Costa, R. Bianchini, and I. C. Dutra, “Evaluating the impact of coherence protocols on parallel logic programming systems,” in Proceedings of the 5th EUROMICRO Workshop on Parallel and Distributed Processing, pp. 376-381, 1997. Also available as technical report ES-389/96, COPPE/Systems Engineering, May, 1996. [ bib ]
[60] V. Santos Costa, M. E. Correia, and F. Silva, “Performance of Sparse Binding Arrays for Or-Parallelism,” in Proceedings of the VIII Brazilian Symposium on Computer Architecture and High Performance Processing - SBAC-PAD, August 1996. [ bib ]
[61] G. Gupta, M. V. Hermenegildo, E. Pontelli, and V. Santos Costa, “ACE: And/Or-parallel Copying-based Execution of Logic Programs,” in Proc. ICLP'94, pp. 93-109, MIT Press, 1994. [ bib ]
[62] R. Yang, A. Beaumont, I. C. Dutra, V. Santos Costa, and D. H. D. Warren, “Performance of the Compiler-based Andorra-I System,” in Logic Programming, Proceedings of the Tenth International Conference on Logic Programming, pp. 150-166, MIT Press, June 1993. [ bib ]
[63] G. Gupta and V. Santos Costa, “A Systematic Approach to Exploiting Parallelism in Prolog,” in 26th Hawaii Int'l Conf on System Sciences, pp. 417-427, 1993. [ bib ]
[64] G. Gupta and V. Santos Costa, “Complete and Efficient Methods for Supporting Side-Effects and Cuts in And-Or Parallel Prolog,” in PDP '92, pp. 288-295, IEEE, November 1992. [ bib ]
[65] G. Gupta and V. Santos Costa, “And-Or Parallelism in Full Prolog with Paged Binding Arrays,” in LNCS 605, PARLE'92 Parallel Architectures and Languages Europe, pp. 617-632, Springer-Verlag, June 1992. [ bib ]
[66] G. Gupta, V. Santos Costa, R. Yang, and M. V. Hermenegildo, “IDIOM: Integrating Dependent and-, Independent and-, Or-parallelism,” in Logic Programming: Proceedings of the International Logic Programming Symposium, pp. 152-166, MIT Press, October 1991. [ bib ]
[67] V. Santos Costa, D. H. D. Warren, and R. Yang, “The Andorra-I Preprocessor: Supporting full Prolog on the Basic Andorra model,” in Logic Programming, Proceedings of the Eigth International Conference, pp. 443-456, MIT Press, June 1991. [ bib ]
[68] V. Santos Costa, D. H. D. Warren, and R. Yang, “The Andorra-I Engine: A parallel implementation of the Basic Andorra model,” in Logic Programming, Proceedings of the Eigth International Conference, pp. 825-839, MIT Press, June 1991. [ bib ]
[69] V. Santos Costa, D. H. D. Warren, and R. Yang, “Andorra-I: A Parallel Prolog System that Transparently Exploits both And- and Or-Parallelism,” in Third ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming PPOPP, pp. 83-93, ACM press, April 1991. SIGPLAN Notices vol 26(7), July 1991. [ bib ]
[70] M. Lobosco, A. F. d. Silva, V. Santos Costa, and C. Amorim, “TCP-IP versus VIA on Network of Workstations,” in 13 Symposium on Computer Architecture and High Performance Computing, SBAC-PAD, pp. 140-147, September 2001. [ bib ]
[71] Inês C. Dutra and Santos Costa, Vítor and J. L. V. Barbosa and C. F. R. Geyer, “Using Compile-Time Granularity Information to Support Dynamic Work Distribution in Parallel Logic Programming Systems,” in 11 Symposium on Computer Architecture and High Performance Computing, SBAC-PAD, pp. 248-254, October 1999. [ bib ]

Workshop papers and posters

[1] V. Santos Costa, “On Making Parallel Logic Programming Boring,” in Proceedings of DAMP2008: Workshop on Declarative Aspects of Multicore Programming (M. Hermenegildo, ed.), (San Francisco, CA, USA), January 2008. [ bib ]
[2] N. A. Fonseca, R. Rocha, R. Camacho, and V. Santos Costa, “ILP: Compute Once, Reuse Often,” in Proceedings of the 6th Workshop on Multi-Relational Data Mining (MRDM 2007) (D. Malerba, A. Appice, and M. Ceci, eds.), (Warsaw, Poland), pp. 34-45, September 2007. [ bib ]
[3] B. Demoen, P.-L. Nguyen, V. Santos Costa, and Z. Somogyi, “Dealing with large predicates: exo-compilation in the WAM and in Mercury,” in Proceedings of the Seventh Colloquium on the Implementation of Constraint and Logic Programming (CICLOPS 2007) (S. Abreu and V. Santos Costa, eds.), (Porto, Portugal), pp. 117-131, September 2007. [ bib ]
[4] R. Camacho, N. A. Fonseca, V. S. Costa, and R. Rocha, “ILP :- Just Trie It,” in Work-in-Progress Proceedings of the 2007 International Conference on Inductive Logic Programming, 2007. [ bib ]
[5] I. Ong, D. Page, and V. Santos Costa, “Inferring regulatory networks from time series expression data and relational data via inductive logic programming,” in In-Area Short Papers for 2006 International Conference on Inductive Logic Programming (S. Muggleton and R. Otero, eds.), 2006. [ bib ]
[6] K. Revoredo, A. Paes, G. Zaverucha, and V. S. Costa, “Combining predicate invention and revision of probabilistic fol theories,” in In-Area Short Papers for 2006 International Conference on Inductive Logic Programming (S. Muggleton and R. Otero, eds.), pp. 176-178, 2006. [ bib ]
[7] V. Santos Costa, “A Look Back and a Look Forward at Parallel Logic Programming,” in Declarative Programming Languages for Multicore Architectures, January 2006. [ bib ]
[8] A. F. da Silva and V. S. Costa, “The design and implementation of the yap compiler: An optimizing compiler for logic programming languages.,” in Logic Programming, 22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings (S. Etalle and M. Truszczynski, eds.), vol. 4079 of Lecture Notes in Computer Science, pp. 461-462, Springer, 2006. Presented at the Doctoral Symposium. [ bib ]
[9] R. Ligeiro, F. França, and V. Santos Costa, “Zos: The Same Machine, Just a Different Machine,” in Poster Session of LCTES, ACM SIGPLAN/SIGBED 2005 Conference on Languages, Compilers, and Tools for Embedded Systems, (Chicago, USA), August 2005. [ bib ]
[10] A. Paes, K. Revoredo, G. Zaverucha, and V. S. Costa, “Further results of probabilistic first-order revision of theories from examples,” in MRDM '05: Proceedings of the 4th international workshop on Multi-relational mining, (New York, NY, USA), pp. 59-59, ACM Press, 2005. [ bib | DOI ]
[11] I. M. Ong, D. Page, I. Dutra, and V. S. Costa, “Hyperpaths: extending pathfinding to moded languages,” in MRDM '05: Proceedings of the 4th international workshop on Multi-relational mining, (New York, NY, USA), pp. 57-57, ACM Press, 2005. [ bib | DOI ]
[12] J. Davis, E. Burnside, D. Page, I. Dutra, and V. S. Costa, “Learning bayesian networks of rules with sayu,” in MRDM '05: Proceedings of the 4th international workshop on Multi-relational mining, (New York, NY, USA), pp. 13-13, ACM Press, 2005. [ bib | DOI ]
[13] R. Rocha, R. Lopes, F. M. A. Silva, and V. S. Costa, “Impact: Innovative models for prolog with advanced control and tabling.,” in Logic Programming, 21st International Conference, ICLP 2005, Sitges, Spain, October 2-5, 2005, Proceedings (M. Gabbrielli and G. Gupta, eds.), vol. 3668 of Lecture Notes in Computer Science, pp. 416-417, Springer, 2005. (presented as poster). [ bib ]
[14] J. Davis, V. Santos Costa, I. M. Ong, D. Page, and I. C. Dutra, “Using Bayesian Classifiers to Combine Rules,” in 3rd Workshop on Multi-Relational Data Mining, (Seattle, USA), August 2004. [ bib ]
[15] R. Lopes, V. S. Costa, and F. Silva, “Exploiting parallelism in the extended andorra model,” in Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks (PDCN 2004) (M. Hamza, ed.), pp. 483-489, ACTA Press, February 2004. [ bib ]
[16] R. Rocha, F. Silva, and V. S. Costa, “A Tabling Engine Designed to Support Mixed-Strategy Evaluation,” in CICLOPS 2003: Colloquium on Implementation of Constraint and LOgic Programming Systems, (Mumbai, India), December 2003. [ bib ]
[17] R. Mooney, P. Melville, L. Tang, J. Shavlik, I. Dutra, D. Page, and V. Santos Costa, “Relational data mining with inductive logic programming for link discovery,” in Proceedings of the National Science Foundation Workshop on Next Generation Data Mining, Baltimore, MD, November 2002. [ bib ]
[18] V. Santos Costa, D. Page, and J. Cussens, “CLP(BN) in School: ILP and Bayesian Networks,” in Work In Progress (WIP) Session of ILP02, (Sydney, Australia), July 2002. [ bib ]
[19] L. F. Castro, V. Santos Costa, and R. Lopes, “On the Cache Performance of Prolog Systems,” in CICLOPS 2002: Colloquium on Implementation of Constraint and LOgic Programming Systems, Copenhagen, Denmark, July 2002. [ bib ]
[20] M. E. Correia and V. Santos Costa, “Independent And Parallelism Revisited,” in CICLOPS 2001: Colloquium on Implementation of Constraint and LOgic Programming Systems, 2001. [ bib ]
[21] R. Rocha, F. Silva, and V. Santos Costa, “YapTab: A Tabling Engine Designed to Support Parallelism,” in Proceedings of the 2nd Workshop on Tabulation in Parsing and Deduction, TAPD'2000, (Vigo, Spain), pp. 77-87, September 2000. [ bib ]
[22] R. Lopes, F. Silva, V. Santos Costa, and S. Abreu, “The RAINBOW: Towards a Parallel Beam,” in Workshop on Parallelism and Implementation Technology for (Constraint) Logic Languages, CL2000, pp. 38-54, July 2000. [ bib ]
[23] M. E. Correia and V. Santos Costa, “IAP for Dummies: The YAP Design,” in ParImp'99: Parallelism and Implementation Technology for (Constraint) Logic Programming, pp. 97-109, New Mexico State University, December 1999. [ bib ]
[24] R. Lopes and V. Santos Costa, “The YAIL: An Intermediate Language for Native Compilation of Prolog Programs,” in 3rd COMPULOG NET Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages, Bonn, September 1996. [ bib ]
[25] G. Gupta, V. Santos Costa, and E. Pontelli, “Shared Paged Binding Arrays: A Universal Data-structure for Parallel Logic Programming,” proc. NSF/ICOT Workshop on Parallel Logic Programming and its Environments, CIS-94-04, University of Oregon, Mar. 1994. [ bib ]
[26] V. Santos Costa, M. E. Correia, and F. Silva, “Aurora and Friends on the Sun (Extended Abstract),” in 2nd COMPULOG NET Workshop on Parallelism and Implementation Technologies, Madrid,, 1994. [ bib ]
[27] V. Santos Costa, M. E. Correia, and F. Silva, “Aurora, Andorra-I and Friends on the Sun,” in Proceedings of the Post-ILPS'94 Workshop on Design and Implementation of Parallel Logic Programming Systems, Ithaca, NY, USA,, 1994. [ bib ]
[28] G. Gupta, M. V. Hermenegildo, and V. S. Costa, “Generalized stack-copying for and-or parallel execution of full prolog,” in IJCSLP Workshop on Concurrent and Parallel Implementations, pp. 0-, 1992. [ bib ]

Other

[1] L. A. J. Marzulo, F. M. G. Fran�a, and V. Santos Costa, “Transactional wavecache: Towards speculative and out-of-order dataflow execution of memory operations,” CoRR, vol. abs/0712.1167, 2007. [ bib ]
[2] J. S. Bernardes, A. M. R. Dávila, V. Santos Costa, and G. Zaverucha, “A study of structural properties on profiles hmms,” CoRR, vol. abs/0704.2010, 2007. [ bib ]
[3] S. Abreu and V. Santos Costa, eds., Proceedings of the Seventh Colloquium on the Implementation of Constraint and Logic Programming (CICLOPS 2007). Universidade do Porto, 2007. [ bib ]
[4] V. S. Costa, “Performance issues in prolog applications,” in Progress in Artificial Intelligence, 11th Protuguese Conference on Artificial Intelligence, EPIA 2003, Beja, Portugal, December 4-7, 2003, Proceedings (F. Moura-Pires and S. Abreu, eds.), vol. 2902 of Lecture Notes in Computer Science, p. 8, Springer, 2003. [ bib ]
[5] V. Santos Costa, L. Damas, R. Reis, and R. Azevedo, YAP User's Manual, 2002. http://www.ncc.up.pt/˜vsc/Yap. [ bib ]
[6] E. Pontelli and V. Santos Costa, “Special Issue on Practical Aspects of Declarative Languages,” Journal of Functional and Logic Programming, vol. 2001, October 2001. [ bib ]
[7] V. Santos Costa, I. de Castro Dutra, F. França, M. Pereira, P. Vargas, C. Geyer, J. Barbosa, C. Costa, P. Lima, F. Dargan, A. Branco, J. M. Filho, G. Gupta, E. Pontelli, M. Correia, R. Lopes, R. Rocha, and F. Silva, Projects Evaluation Workshop ProTeM - CC 2001 - International Cooperation NSF/INRIA, ch. Towards Effective Parallel Logic Programming, pp. 243-265. CNPq - Conselho Nacional de Desenvolvimento Científico e Tecnológico, 2001. [ bib ]
[8] V. Santos Costa, E. Pontelli, and G. Gupta, “Special Issue on the Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages,” Journal of Functional and Logic Programming, vol. 1999, April 1999. [ bib ]
[9] I. de Castro Dutra, V. S. Costa, G. Gupta, E. Pontelli, M. Carro, and P. Kacsuk, “Preface,” Electr. Notes Theor. Comput. Sci., vol. 30, no. 3, 1999. [ bib ]
[10] V. Santos Costa, Compile-Time Analysis for the Parallel Execution of Logic Programs in Andorra-I. PhD thesis, University of Bristol, August 1993. [ bib ]
[11] R. Yang, I. C. Dutra, and V. Santos Costa, “Design of the Andorra-I System.” Internal Report, PEPMA Project, January 1991. [ bib ]
[12] V. Santos Costa, “Compile-time analysis for Andorra-I.” PEPMA Project workshop, University of Bristol, October 1990. [ bib ]
[13] V. Santos Costa, “Implementaçao de Prolog,” provas de aptidao pedagógica e capacidade científica, Universidade do Porto, Dezembro 1988. [ bib ]