Runtime verification of agent properties

References (376)

1. J. Coplien and D. Schmidt. Pattern Languages of Program Design. Addison-Wesley, 1995.
2. T. Swift and D.S. Warren. XSB: Extending the power of prolog using tabling, 2009. available at www.cs.sunysb.edu/ tswift.
3. Terrance Swift pa(ri(book),i(book,t),d_(0,1)):-light(f). pa(ri(book),i(book,t),d_(0,1)):-light(t),tv(t). pa(ri(book),i(book,t),d_(6,10)):-light(t),tv(f),lr(t),lw(t),thsty(t). pa(ri(book),i(book,t),d_(65,100)):-light(t),tv(f),lr(t),lw(t),thsty(f). pa(ri(book),i(book,t),d_(7,10)):-light(t),tv(f),lr(t),lw(f),thsty(t). pa(ri(book),i(book,t),d_(8,10)):-light(t),tv(f),lr(t),lw(f),thsty(f). pa(ri(book),i(book,t),d_(1,10)):-light(t),tv(f),lr(f),lw(t). pa(ri(book),i(book,t),d_(4,10)):-light(t),tv(f),lr(f),lw(f).
4. For i(drink): pa(ri(drink),i(drink,t),d_(0,1)) :-light(f). pa(ri(drink),i(drink,t),d_(9,10)) :-light(t), thsty(t). pa(ri(drink),i(drink,t),d_(1,10)) :-light(t), thsty(f). For i(rem): pa(ri(rem),i(rem,t),d_(0,1)):-light(f). pa(ri(rem),i(rem,t),d_(8,10)):-light(t),tv(t). pa(ri(rem),i(rem,t),d_(4,10)):-light(t),tv(f),lw(t),lr(t),thsty(t). pa(ri(rem),i(rem,t),d_(5,10)):-light(t),tv(f),lw(t),lr(t),thsty(f). pa(ri(rem),i(rem,t),d_(6,10)):-light(t),tv(f),lw(t),lr(f),thsty(t). pa(ri(rem),i(rem,t),d_(9,10)):-light(t),tv(f),lw(t),lr(f),thsty(f). pa(ri(rem),i(rem,t),d_(1,10)):-light(t),tv(f),lw(f),lr(t),thsty(t). pa(ri(rem),i(rem,t),d_(2,10)):-light(t),tv(f),lw(f),lr(t),thsty(f). pa(ri(rem),i(rem,t),d_(0,1)):-light(t),tv(f),lw(f),lr(f),thsty(t). pa(ri(rem),i(rem,t),d_(3,10)):-light(t),tv(f),lw(f),lr(f),thsty(f). For i(switch): pa(ri(switch),i(switch,t),d_(1,1)) :-light(f). pa(ri(switch),i(switch,t),d_(1,100)) :-light(t).
5. Luis Moniz Pereira and Anh Han The References
6. L. M. Pereira, H. T. Anh. Intention Recognition via Causal Bayes Networks plus Plan Gen- eration, Procs. 14th Portuguese Conf. on AI (EPIA'09), Springer LNAI, October 2009 (to appear).
7. L. M. Pereira, H. T. Anh. Evolution Prospection, in: K. Nakamatsu (ed.), Procs. Intl. Sympo- sium on Intelligent Decision Technologies (KES-IDT'09), pages 51-63, Springer Studies in Computational Intelligence 199, 2009.
8. L. M. Pereira, H. T. Anh. Evolution Prospection in Decision Making. Intl. Journal of Intelli- gent Decision Technologies, IOS Press (to appear in 2009).
9. C. Baral, M. Gelfond, and N. Rushton. Probabilistic reasoning with answer sets. In Procs. Logic Programming and Nonmonotonic Reasoning (LPNMR 7), pages 21-33, Springer LNAI 2923, 2004.
10. H. T. Anh, C. K. Ramli, C. V. Damásio. An implementation of extended P-log using XASP. In Procs. Intl. Conf. Logic Programming, Springer LNCS 5366, 2008.
11. C. Baral, M. Gelfond, N. Rushton. Probabilistic reasoning with answer sets. Theory and Prac- tice of Logic Programming, 9(1): 57-144, January 2009.
12. L. Castro, T. Swift, and D. S. Warren. XASP: Answer set programming with xsb and smodels. Accessed at http://xsb.sourceforge.net/packages/xasp.pdf
13. A. Cesta, F. Pecora. The Robocare Project: Intelligent Systems for Elder Care. AAAI Fall Symposium on Caring Machines: AI in Elder Care, USA 2005.
14. A. Mileo, D. Merico, R. Bisiani. A Logic Programming Approach to Home Monitoring for Risk Prevention in Assisted Living . In Procs. Intl. Conf. Logic Programming, Springer LNCS 5366, 2008.
15. M. V. Giuliani, M. Scopelliti, F. Fornara. Elderly people at home: technological help in everyday activities. IEEE International Workshop on In Robot and Human Interactive Com- munication, pp. 365-370, 2005.
16. Luis Moniz Pereira and Anh Han The
17. C. Heinze. Modeling Intention Recognition for Intelligent Agent Systems, Doctoral Thesis, the University of Melbourne, Australia, 2003. Online available: http : //www.dsto.def ence.gov.au/publications/scientif ic record.php?record = 3367
18. K. A. Tahboub. Intelligent Human-Machine Interaction Based on Dynamic Bayesian Net- works Probabilistic Intention Recognition. J. Intelligent Robotics Systems, vol. 45, no. 1, pages 31-52, 2006.
19. O. C. Schrempf, D. Albrecht, U. D. Hanebeck. Tractable Probabilistic Models for Intention Recognition Based on Expert Knowledge, In Procs. 2007 IEEE/RSJ Intl. Conf. on Intelligent Robots and Systems (IROS 2007), pages 1429-1434, 2007.
20. H. A. Kautz and J. F. Allen. Generalized plan recognition. In Procs. 1986 Conf. of the Amer- ican Association for Artificial Intelligence, AAAI 1986: 32-37, 1986.
21. T. Eiter, W. Faber, N. Leone, G. Pfeifer, A. Polleres. A Logic Programming Approach to Knowledge State Planning, II: The DLV K System. Artificial Intelligence 144(1-2): 157-211, 2003.
22. P. H. Tu, T. C. Son, C. Baral. Reasoning and Planning with Sensing Actions, Incomplete Information, and Static Causal Laws using Answer Set Programming. Theory and Practice of Logic Programming, 7(4): 377-450, July 2007.
23. C. Glymour. The Mind's Arrows: Bayes Nets and Graphical Causal Models in Psychology. MIT Press, 2001.
24. J. Pearl. Causality: Models, Reasoning, and Inference. Cambridge U.P., 2000.
25. J. J. Alferes, A. Brogi, J. A. Leite, L.M. Pereira. Evolving logic programs. Procs. 8th Euro- pean Conf. on Logics in AI (JELIA'02), pages 50-61, Springer LNAI 2424, 2002.
26. J. J. Alferes, F. Banti, A. Brogi, J. A. Leite. The Refined Extension Principle for Semantics of Dynamic Logic Programming , Studia Logica 79(1): 7-32, 2005.
27. J. J. Alferes, J. A. Leite, L. M. Pereira, H. Przymusinska, T. C. Przymusinski. Dynamic updates of non-monotonic knowledge bases. J. Logic Programming, 45(1-3):4370, 2000.
28. I. Niemelä, P. Simons. Smodels: An implementation of the stable model and well-founded se- mantics for normal logic programs. 4th Intl. Conf. on Logic Programming and Nonmonotonic Reasoning, Springer LNAI 1265, pages 420-429, 1997.
29. T. Swift. Tabling for non-monotonic programming. Annals of Mathematics and Artificial Intelligence, 25(3-4):201-240, 1999.
30. The XSB System Version 3.0 Vol. 2: Libraries, Interfaces and Packages. July 2006. References
31. Lange, K., Du, G.: A formal approach t o designing forming sequences for cold forging. Trans. of the NAMRI/SME (1989) 17{22
32. Takata, O., Nakanishi, K., Yamazaki, T.: Forming-sequence design expert sys- tem for multistage cold forging: Forest-d. I n : P r o c . o f P acic Rim International Conference on Articial Intelligence '90. (1990) 101{113
33. Sevenler, K., Raghupathi, P.S., Altan, T.: Forming-sequence design for multistage cold forging. J. of Mechanical Working Technology 14 (1987) 121{135
34. Mahmood, T., Lengyel, B., Husband, T.M.: Expert system for process planning in the cold forging of steel. Expert Planning Systems 322 (1990) 141{146
35. Kim, H.S., Im, Y.T.: An expert system for cold forging process design based on a depth-rst search. Journal of Materials Processing Technology 95 (1999) 262{274
36. Kumar, S., Singh, R.: A low cost knowledge base system framework for progressive die design. Journal of Materials Processing Technology 153 (2004) 958{964
37. Xuewen, C., Siyu, Z., Jun, C., Xueyu, R.: Research of knowledge-based hammer forging design support system. The International Journal of Advanced Manufac- turing Technology 27 (2005) 25{32
38. Masanobu Umeda and Yuji Mure References
39. F. Rossi, P. Van Beek, and T. Walsh. Handbook of constraint programming. Elsevier Science, 2006.
40. K.R. Apt. Principles of constraint programming. Cambridge Univ Pr, 2003.
41. Christian Schulte. Programming Constraint Services, volume 2302 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 2002.
42. D. Diaz and P. Codognet. Design and implementation of the gnu prolog system. Journal of Functional and Logic Programming, 6(2001):542, 2001.
43. M. Carlsson, G. Ottosson, and B. Carlson. An open-ended finite domain constraint solver. Lecture notes in computer science, pages 191-206, 1997.
44. C. Schulte and P.J. Stuckey. Speeding up constraint propagation. Lecture Notes in Computer Science, 3258:619-633, 2004.
45. Gecode/R Team. Gecode/R: Constraint Programming in Ruby. Available from http://gecoder.org/.
46. M. Correia and P. Barahona. Overview of the CaSPER* Constraint Solvers. Third International CSP Solver Competition, page 15, 2008.
47. A. Van Deursen and J. Visser. Domain-specific languages: An annotated bibliog- raphy. ACM Sigplan Notices, 35(6):26-36, 2000.
48. Alemendros-Jiménez et al., 2007] Almendros-Jiménez, J.M., Becerra-Terón, A., Enciso- Baños, F.J. (2007) Integrating XQUERY and Logic Programming. Proc. 17th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2007) and 21st Workshop on (Constraint) Logic Programming (WLP 2007), 136-147.
49. Baral, 2004] Baral, C., Chancellor, K., Tran, N., Tran, N.L., Joy, A., Berens, M. (2004) A knowledge based approach for representing and reasoning about signaling networks, Bioin- formatics, 20 (Suppl. 1), i15-i22.
50. Bardwell, 2005] Bardwell, L. (2005) A walk-through of the yeast mating pheromone response pathway. Peptides, 26 (2), 339-350.
51. Bratko, 2001] Bratko, I. (2001) PROLOG-Programming for Artificial Intelligence, 3rd Edition, Addison-Wesley, 2001.
52. Clocksin & Mellish, 2003] Clocksin, W. F., Mellish, C. S. (2003) Programming in PROLOG. 5th Edition, Springer, 2003.
53. Consortium, 2008] Consortium, G. O. (2008) The Gene Ontology project in 2008. Nucleic Acids Res., 36, D440-444.
54. Duan et al., 2002] Duan, X. J., Xenarios, I. & Eisenberg, D. (2002) Describing biological pro- tein interactions in terms of protein states and state transitions: the LiveDIP database. Mol Cell Proteomics, 1 (2), 104-116.
55. Fages et al., 2004] Fages, F., Soliman, S., Chabrier, N. (2004) Modelling and querying interac- tion networks in the biochemical abstract machine BIOCHAM, Journal of Biological Physics and Chemistry, 4, 64-73.
56. Grafahrend-Belau et al., 2008] Grafahrend-Belau, E., Schreiber, F., Heiner, M., Sackmann, A., Junker, B. H., Grunwald, S., Speer, A., Winder, K. & Koch, I. (2008) Modularization of bio- chemical networks based on classification of Petri net t-invariants. BMC Bioinformatics, 9, 90. [Hermjakob et al., 2004] Hermjakob, H., Montecchi-Palazzi, L., Bader, G., Wojcik, J., Salwin- ski, L., Ceol, A., Moore, S., Orchard, S., Sarkans, U., von Mering, C., Roechert, B., Poux, S., Jung, E., Mersch, H., Kersey, P., Lappe, M., Li, Y., Zeng, R., Rana, D., Nikolski, M., Husi, H., Brun, C., Shanker, K., Grant, S. G. N., Sander, C., Bork, P., Zhu, W., Pandey, A., Brazma, A., Jacq, B., Vidal, M., Sherman, D., Legrain, P., Cesareni, G., Xenarios, I., Eisenberg, D., Steipe, B., Hogue, C. & Apweiler, R. (2004) The HUPO PSI's molecular interaction format -a com- munity standard for the representation of protein interaction data. Nat. Biotechnology, 22 (2), 177-183. Dietmar Seipel and Jörg Schultz [Hucka et al., 2003] Hucka, M., Finney, A., Sauro, H., Bolouri, H., Doyle, J., Kitano, H., Arkin, A., Bornstein, B., Bray, D., Cornish-Bowden, A., Cuellar, A., Dronov, S., Gilles, E., Ginkel, M., Gor, V., Goryanin, I., Hedley, W., Hodgman, T., Hofmeyr, J.-H., Hunter, P., Juty, N., Kasberger, J., Kremling, A., Kummer, U., Novà ĺre, N. L., Loew, L., Lucio, D., Mendes, P., Minch, E., Mjolsness, E., Nakayama, Y., Nelson, M., Nielsen, P., Sakurada, T., Schaff, J., Shapiro, B., Shimizu, T., Spence, H., Stelling, J., Takahashi, K., Tomita, M., Wagner, J., Wang, J. & Forum, S. (2003) The systems biology markup language (SBML): a medium for representation and exchange of biochemical network models. Bioinformatics, 19 (4), 524-531.
57. Karp, 2001] Karp, P. (2001) Pathway databases: a case study in computational symbolic theo- ries. Science, 293 (5537), 2040-2044.
58. Keseler et al., 2009] Keseler, I. M., Bonavides-Martínez, C., Collado-Vides, J., Gama-Castro, S., Gunsalus, R. P., Johnson, D. A., Krummenacker, M., Nolan, L. M., Paley, S., Paulsen, I. T., Peralta-Gil, M., Santos-Zavaleta, A., Shearer, A. G. & Karp, P. D. (2009) EcoCyc: a compre- hensive view of Escherichia coli biology. Nucleic Acids Research, 37, D464-470.
59. O'Shea et al., 2002] O'Shea, J. J., Gadina, M. & Schreiber, R. D. (2002) Cytokine signaling in 2002: new surprises in the Jak/Stat pathway. Cell, 109 Suppl., S121-131.
60. Ratsch et al., 2003] Ratsch, E., Schultz, J., Saric, J., Lavin, P., Wittig, U., Reyle, U. & Rojas, I. (2003) Developing a protein-interactions ontology. Comparative and Functional Genomics, 4, 85-89. [Regev et al., 2001] Regev, A., Silverman, W. & Shapiro, E. (2001) Representation and simula- tion of biochemical processes using the π-calculus process algebra. In Pacific Symposium on Biocomputing, 459-470.
61. Rzhetsky et al., 2000] Rzhetsky, A., Koike, T., Kalachikov, S., Gomez, S., Krauthammer, M., Kaplan, S., Kra, P., Russo, J. & Friedman, C. (2000) A knowledge model for analysis and simulation of regulatory networks. Bioinformatics, 16 (12), 1120-1128.
62. Saunders et al., 2008] Saunders, B., Lyon, S., Day, M., Riley, B., Chenette, E., Subramaniam, S. & Vadivelu, I. (2008) The Molecule Pages database. Nucleic Acids Research, 36, D700-706.
63. Schacherer et al., 2001] Schacherer, F., Choi, C., Götze, U., Krull, M., Pistor, S. & Wingender, E. (2001) The TRANSPATH signal transduction database: a knowledge base on signal trans- duction networks. Bioinformatics, 17 (11), 1053-1057.
64. Seipel, 2002] Seipel, D. (2002) Processing XML-documents in PROLOG. In Proc. 17th Work- shop on Logic Programming (WLP 2002).
65. Spellman et al., 2002] Spellman, P. T., Miller, M., Stewart, J., Troup, C., Sarkans, U., Chervitz, S., Bernhart, D., Sherlock, G., Ball, C., Lepage, M., Swiatek, M., Marks, W., Goncalves, J., Markel, S., Iordan, D., Shojatalab, M., Pizarro, A., White, J., Hubley, R., Deutsch, E., Senger, M., Aronow, B. J., Robinson, A., Bassett, D., Stoeckert, C. J. & Brazma, A. (2002) Design and implementation of microarray gene expression markup language (MAGE-ML). Genome Biology, 3 (9), RESEARCH0046.
66. Wang & Dohlman, 2004] Wang, Y. & Dohlman, H. G. (2004) Pheromone signaling mecha- nisms in yeast: a prototypical sex machine. Science, 306 (5701), 1508-1509.
67. Wielemaker, 2009] Wielemaker, J. (2009) SWI-PROLOG 5.0 Reference Manual and Wielemaker, J., Anjewierden, A. (2009) Programming in XPCE/PROLOG, http://www.swi-prolog.org/ [Zheng et al., 2008] Zheng, S., Sheng, J., Wang, C., Wang, X., Yu, Y., Li, Y., Michie, A., Dai, J., Zhong, Y., Hao, P., Liu, L. & Li, Y. (2008) MPSQ: a web tool for protein-state searching. Bioinformatics, 24, 2412-2413.
68. Salvador Abreu. Isco: A practical language for heterogeneous information system construction. In Proceedings of INAP'01, Tokyo, Japan, October 2001. Prolog As- sociation of Japan.
69. Salvador Abreu and Daniel Diaz. Objective: in Minimum Context. In Catuscia Palamidessi, editor, Logic Programming, 19th International Conference, ICLP 2003, Mumbai, India, December 9-13, 2003, Proceedings, volume 2916 of Lecture Notes in Computer Science, pages 128-147. Springer-Verlag, 2003. ISBN 3-540-20642-6.
70. Salvador Abreu and Vitor Nogueira. Using a Logic Programming Language with Persistence and Contexts. In Osamu Takata, Masanobu Umeda, Isao Nagasawa, Naoyuki Tamura, Armin Wolf, and Gunnar Schrader, editors, Declarative Program- ming for Knowledge Management, 16th International Conference on Applications of Declarative Programming and Knowledge Management, INAP 2005, Fukuoka, Japan, October 22-24, 2005. Revised Selected Papers., volume 4369 of Lecture Notes in Computer Science, pages 38-47. Springer, 2006.
71. ISO/IEC JTC1/SC22/WG17. Information technology -Programming languages - Prolog -Part 2: Modules. Technical Report DIS 13211, ISO, 2000.
72. Ger Koole. Performance analysis and optimization in customer contact centers. In QEST, pages 2-5. IEEE Computer Society, 2004.
73. Pierre L'Ecuyer. Modeling and optimization problems in contact centers. In QEST, pages 145-156. IEEE Computer Society, 2006.
74. Dale Miller. A logical analysis of modules in logic programming. The Journal of Logic Programming, 6(1 and 2):79-108, January/March 1989.
75. L. Monteiro and A Porto. Contextual logic programming. In Giorgio Levi and Maurizio Martelli, editors, Proceedings of the Sixth International Conference on Logic Programming, pages 284-299, Lisbon, 1989. The MIT Press.
76. Panos Vassiliadis, Alkis Simitsis, and Spiros Skiadopoulos. Conceptual modeling for etl processes. In DOLAP '02: Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP, pages 14-21, New York, NY, USA, 2002. ACM.
77. setof(X,Goal,Bag) :-post_it(X,Goal), gather([],Bag).
78. post_it(X,Goal) :-call(Goal), asserta(data999(X)), fail. 19. post_it(_,_).
79. gather(B,Bag) :-data999(X), retract(data999(X)), gather([X|B],Bag), distinct(Bag), !.
80. dist(X,L) :-not member(X,L).
81. distinct([X|L]) :-dist(X,L), distinct(L).
82. neigh(X,C,L) :-setof(Y,arc(X,Y),S), vrm_dupl(S, L), length(L,C).
83. bound(X,e(N1,N2)) :-neigh(X,Nc,Nb), Nc>1, member(N1,Nb), member(N2,Nb), not N1=N2, arc(N1,N2).
84. node(X,Nc,Nb,Ts,Bs) :-setof(e(N1,N2), bound(X,e(N1,N2)),TBs), neigh(X,Nc,Nb), rm_dupl(TBs,Bs), length(Bs,Ts).
85. rm_dupl([X|T],L2) :-symmem(X,T), rm_dupl(T,L2).
86. rm_dupl([X|T],[X|T1]) :-\+ symmem(X,T), rm_dupl(T,T1).
87. symmem(X,S) :-member(X,S).
88. symmem(e(X,Y),S) :-member(e(Y,X),S).
89. vrm_dupl([X|T],L2) :-member(X,T), vrm_dupl(T,L2).
90. vrm_dupl([X|T],[X|T1]) :-\+ member(X,T), vrm_dupl(T,T1).
91. vertices(L) :-setof(X,arc(X,Y),S), vrm_dupl(S,L), !.
92. recurse([H|R]) :-recurse(R), node(H,Nc,Nb,Ts,Bs), write(node(H,Nc,Nb,Ts,Bs)), write('.\n').
93. transform :-vertices(R), recurse(R).
94. JIP:-transform.
95. Yes 42. node(d,4,[c,b,a,e],3,[e(b,c),e(a,b),e(e,c)]).
96. Graph Benchmark Database. http://amalfi.dis.unina.it/graph/.
97. L. Chen and S. Bhowmick. In the search of nectars from evolutionary trees. In DASFAA, pages 714-729, 2009.
98. L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. An improved algorithm for matching large graphs. In 3rd IAPR-TC15 Workshop on Graph-based Representa- tions in Pattern Recognition, pages 149-159, Cuen, 2001.
99. J. E. Hopcroft and J. K. Wong. Linear time algorithm for isomorphism of planar graphs. In ACM Symposium on Theory of Computing, pages 172-184, 1974.
100. Y. Jia, J. Hoberock, M. Garland, and J. C. Hart. On the visualization of social and other scale-free networks. IEEE Trans. Vis. Comput. Graph., 14(6):1285-1292, 2008.
101. M. Koyuturk, Y. Kim, S. Subramanium, W. Szpankowski, and A. Grama. De- tecting conserved interaction patterns in biological networks. JCB, 3(7):12991322, 2006.
102. E. M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. In IEEE FOCS, pages 42-49, 1980.
103. B. D. McKay. Practical graph isomorphism. Congressus Numerantium, 30:45-87, 1981.
104. E. Rich and K. Knight, editors. Artificial Intelligence. McGraw Hill Higher Edu- cation; 2nd edition, 1991.
105. S. Saito, S. Aburatani, and K. Horimoto. Network evaluation from the consistency of the graph structure with the measured data. BMC Systems Biology, 2(84), October 2008.
106. J. Scott, T. Ideker, R. M. Karp, and R. Sharan. Efficient algorithms for detecting signaling pathways in protein interaction networks. J Comput Biol, 13(2):133-144, March 2006.
107. N. Shrivastava, A. Majumder, and R. Rastogi. Mining (social) network graphs to detect random link attacks. In ICDE, pages 486-495, 2008.
108. J. R. Ullmann. An algorithm for subgraph isomorphism. Journal of ACM, 23(1):31-42, 1976.
109. G. Valiente. Algorithms on Trees and Graphs. Springer-Verlag, Berlin, 2002.
110. H. Wang, J. Li, J. Luo, and H. Gao. Hash-based subgraph query processing method for graph-structured xml documents. PVLDB, 1(1):478-489, 2008.
111. H. Wang, J. Li, W. Wang, and X. Lin. Coding-based join algorithms for structural queries on graph-structured xml document. World Wide Web, 11(4):485-510, 2008.
112. S. P. Abney. Parsing by chunks. In Robert C. Berwick, Steven P. Abney, and Carol Tenny, editors, Principle-Based Parsing: Computation and Psycholinguistics, pages 257-278. Kluwer, Dordrecht, 1991. 2
113. Salvador Abreu and Daniel Diaz. Objective: In minimum context. In Catuscia Palamidessi, editor, ICLP, volume 2916 of Lecture Notes in Computer Science, pages 128-147. Springer, 2003. 1
114. Salvador Abreu and Vitor Nogueira. Using a Logic Programming Language with Persistence and Conte xts. In Osamu Takata, Masanobu Umeda, Isao Nagasawa, Naoyuki Tamura, Armin Wolf, and Gunnar Schrader, editors, Declarative Program- ming for Knowledge Management, 16th Internatio nal Conference on Applications of Declarative Programming and Knowledge Manageme nt, INAP 2005, Fukuoka, Japan, October 22-24, 2005. Revised Selected Papers., volume 4369 of Lecture Notes in Computer Science, pages 38-47. Springer, 2006. 1
115. I. Androutsopoulos, G. Ritchie, and P. Thanisch. Masque/sql: An efficient and portable natural language query interface for relational databases. In Proc. of the Sixth International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems IEA/AIE-93, pages 327-330, Edinburgh, Scotland, 1993. Gordon and Breach. 1
116. Ion Androutsopoulos and Graeme Ritchie. Database interfaces. In R. Dale, H. Moisl, and H. Somers, editors, Handbook of Natural Language Processing, pages 209-240. Marcel Dekker Inc., 2000. 1
117. Antonio Badia. Question answering and database querying: Bridging the gap with generalized quantification. J. Applied Logic, 5(1):3-19, 2007. 1, 3, 4
118. Marco De Boni. An analysis of clarification dialogue for question answering, 2003. 1
119. D. Diaz. http://www.gnu.org/software/prolog, 1999. 1
120. J. Ginzburg. Clarifying utterances, 1998. 1
121. Haiqing Hu, Fuji Ren, Shingo Kuroiwa, and Shuwu Zhang. A question answer- ing system on special domain and the implementation of speech interface. In Alexander F. Gelbukh, editor, CICLing, volume 3878 of Lecture Notes in Com- puter Science, pages 458-469. Springer, 2006. 1
122. Zsolt Tivadar Kardkovács. On the transformation of sentences with genitive re- lations to sql queries. In Andrés Montoyo, Rafael Muñoz, and Elisabeth Métais, editors, NLDB, volume 3513 of Lecture Notes in Computer Science, pages 10-20. Springer, 2005. 1, 1
123. Irene Rodrigues, Luis Quintano and Lígia Silva Ferreira
124. B. Katz, S. Felshin, D. Yuret, A. Ibrahim, J. Lin, G. Marton, A. McFarland, and B. Temelkuran. Omnibase: Uniform access to heterogeneous data for question answering, 2002. 1
125. Boris Katz and Jimmy J. Lin. Start and beyond, 2002. 1, 1
126. Michael F. McTear. Spoken dialogue technology: enabling the conversational user interface. ACM Comput. Surv., 34(1):90-169, 2002. 1
127. Diego Mollá and José Luis Vicedo. Question answering in restricted domains: An overview. Comput. Linguist., 33(1):41-61, 2007. 1
128. H. Kautz O. Etzioni and A. Popescu. Towards a theory of natural language inter- faces to databases. In Intelligent User Interfaces (IUI), 2003. 1, 1
129. Matthew Purver, Jonathan Ginzburg, and Patrick Healey. On the means for clar- ification in dialogue. In R. Smith and J. van Kuppevelt, editors, Current and New Directions in Discourse and Dialogue, volume 22 of Text, Speech and Language Technology, pages 235-255. Kluwer Academic Publishers, 2003. 1
130. Luis Quintano and Irene Pimenta Rodrigues. Using a logic programming frame- work to control database query dialogues in natural language. In Sandro Etalle and Miroslaw Truszczynski, editors, ICLP, volume 4079 of Lecture Notes in Computer Science, pages 406-420. Springer, 2006. 1, 3, 5
131. Luis Quintano and Irene Pimenta Rodrigues. Question/answering clarification dialogues. In Alexander F. Gelbukh and Eduardo F. Morales, editors, MICAI, volume 5317 of Lecture Notes in Computer Science, pages 155-164. Springer, 2008. 1, 3, 5
132. Sharon Small, Nobuyuki Shimizu, Tomek Strzalkowski, and Ting Liu. Hitiqa: A data driven approach to interactive question answering: A preliminary report. In Mark T. Maybury, editor, New Directions in Question Answering, pages 94-104. AAAI Press, 2003. 1
133. Ellen M. Voorhees and Lori P. Buckland, editors. Proceedings of The Seventeenth Text REtrieval Conference, TREC 2008, Gaithersburg, Maryland, USA, November 18-21, 2008, volume Special Publication 500-277. National Institute of Standards and Technology (NIST), 2008. 1
134. Rules (Schema): ------------- books(bookstype(Book, [
135. NBooks,1,Doc) :- book(Book, [NBook|NBooks],2,Doc). book(booktype(Author, Title, Review, [year=Year]),NBook ,2,Doc) :- author(Author, [NAu|NBook],3,Doc), title(Title, [NTitle|NBook],3,Doc), review(Review, [NRe|NBook],3,Doc), year(Year, NBook,3,Doc). review(reviewtype(Un,Em,[
136. NReview,3,Doc):- unlabeled(Un,[NUn|NReview],4,Doc), em(Em,[NEm|NReview],4,Doc). review(reviewtype(Em,[
137. NReview,3,Doc):- em(Em,[NEm|NReview],5,Doc). em(emtype(Unlabeled,Em,[
138. NEms,5,Doc) :- unlabeled(Unlabeled,[NUn|NEms],6,Doc), em(Em, [NEm|NEms],6,Doc). Facts (Document): -------------- year('2003', [1, 1], 3,"books.xml"). author('Abiteboul', [1, 1, 1], 3,"books.xml"). author('Buneman', [2,1, 1], 3,"books.xml"). author('Suciu', [3,1,1], 3,"books.xml"). title('Data on the Web', [4, 1, 1], 3,"books.xml"). unlabeled('A', [1, 5, 1, 1], 4,"books.xml"). em('fine', [2, 5, 1, 1], 4,"books.xml"). unlabeled('book.', [3, 5, 1, 1], 4,"books.xml"). year('2002', [2, 1], 3,"books.xml"). author('Buneman', [1, 2, 1], 3,"books.xml"). title('XML in Scottland', [2, 2, 1], 3,"books.xml"). unlabeled('The', [1, 1, 3, 2, 1], 6,"books.xml"). em('best', [2, 1, 3, 2, 1], 6,"books.xml"). unlabeled('ever!', [3, 1, 3, 2, 1], 6,"books.xml").
139. J. M. Almendros-Jiménez. An RDF Query Language based on Logic Programming. Electronic Notes in Theoretical Computer Science, 200(3), 2008.
140. J. M. Almendros-Jiménez. An Encoding of XQuery in Prolog. In Proceedings of the Sixth International XML Database Symposium XSym'09, LNCS 5679, pages 145-155. Springer, 2009.
141. J. M. Almendros-Jiménez. A Query Language for OWL based on Logic Program- ming. In 5th Int'l Workshop on Automated Specification and Verification of Web Systems, WWv'09, pages 69-84, 2009.
142. J. M. Almendros-Jiménez, A. Becerra-Terón, and F. J. Enciso-Baños. Integrating XQuery and Logic Programming. In Proceedings of INAP-WLP'07, pages 117-135, Heidelberg, Germany, 2009. Springer LNAI, 5437.
143. J. M. Almendros-Jiménez, A. Becerra-Terón, and Francisco J. Enciso-Baños. Querying XML documents in logic programming. Journal of Theory and Prac- tice of Logic Programming, 8(3):323-361, 2008.
144. James Bailey, Franois Bry, Tim Furche, and Sebastian Schaffert. Web and Semantic Web Query Languages: A Survey. In Proc. of Reasoning Web, First International Summer School, pages 35-133, Heidelberg, Germany, 2005. Springer LNCS 3564.
145. Tim Berners-Lee. N3QL-RDF Data Query Language. Technical report, Online only, 2004.
146. P. Boncz, T. Grust, M. van Keulen, S. Manegold, J. Rittinger, and J. Teubner. MonetDB/XQuery: a fast XQuery processor powered by a relational engine. In Proceedings of the 2006 ACM SIGMOD international conference on Management of data, pages 479-490. ACM New York, NY, USA, 2006.
147. Peter A. Boncz, Torsten Grust, Maurice van Keulen, Stefan Manegold, Jan Rit- tinger, and Jens Teubner. Pathfinder: XQuery -The Relational Way. In Proc. of the International Conference on Very Large Databases, pages 1322-1325, New York, USA, 2005. ACM Press.
148. Alex Borgida. On the relative expressiveness of Description Logics and Predicate Logics. Artificial Intelligence, 82(1-2):353-367, 1996.
149. D. Chamberlin, Denise Draper, Mary Fernández, Michael Kay, Jonathan Robie, Michael Rys, Jerome Simeon, Jim Tivy, and Philip Wadler. XQuery from the Experts. Addison Wesley, Boston, USA, 2004.
150. I. Davis. RDF Template Language 1.0. Technical report, Online only, September 2003.
151. Jos de Bruijn, Rubén Lara, Axel Polleres, and Dieter Fensel. OWL DL vs. OWL Flight: conceptual modeling and reasoning for the semantic Web. In WWW '05: Proceedings of the 14th International Conference on World Wide Web, pages 623- 632, New York, NY, USA, 2005. ACM Press.
152. Cristian Pérez de Laborda and Stefan Conrad. Bringing Relational Data into the Semantic Web using SPARQL and Relational OWL. In Procs. of ICDEW'06, page 55, Los Alamitos, CA, USA, 2006. IEEE Computer Society.
153. Tim Furche, François Bry, and Oliver Bolzer. Marriages of Convenience: Triples and Graphs, RDF and XML in Web Querying. In Proceedings of Third Work- shop on Principles and Practice of Semantic Web Reasoning, pages 72-84, Heidel- berg,Germany, 2005. REWERSE, Springer LNCS 3703.
154. Benjamin N. Grosof, Ian Horrocks, Raphael Volz, and Stefan Decker. Description Logic Programs: Combining Logic Programs with Description Logic. In Proc. of the International Conference on World Wide Web, pages 48-57, USA, 2003. ACM Press.
155. Volker Haarslev and Ralf Möller. Racer system description. In IJCAR '01: Proceed- ings of the First International Joint Conference on Automated Reasoning, pages 701-706, London, UK, 2001. Springer-Verlag.
156. Peter Haase, Jeen Broekstra, Andreas Eberhart, and Raphael Volz. A Compar- ison of RDF query languages. In Sheila A. McIlraith, Dimitris Plexousakis, and Frank van Harmelen, editors, Proceedings of the Third International Semantic Web Conference, pages 502-517, Heidelberg, Germany, November 2004. Springer LNCS 3298.
157. Ullrich Hustadt, Boris Motik, and Ulrike Sattler. Reasoning in Description Logics by a Reduction to Disjunctive Datalog. J. Autom. Reasoning, 39(3):351-384, 2007.
158. Gregory Karvounarakis, Sofia Alexaki, Vassilis Christophides, Dimitris Plex- ousakis, and Michel Scholl. RQL: a declarative query language for RDF. In WWW '02: Proceedings of the 11th international conference on World Wide Web, pages 592-603, New York, NY, USA, 2002. ACM Press.
159. H. Katz. XsRQL: an XQuery-style Query Language for RDF. Technical report, Online only, 2004.
160. Markus Krötzsch, Sebastian Rudolph, and Pascal Hitzler. Description Logic Rules. In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI- 08). IOS Press, 2008.
161. G. Lukacsy, P. Szeredi, and B. Kadar. Prolog Based Description Logic Reasoning. In Proceedings of the 24th International Conference on Logic Programming, pages 455-469. Springer, 2008.
162. A. Marian and J. Simeon. Projecting XML Documents. In Proc. of International Conference on Very Large Databases, pages 213-224, Burlington, USA, 2003. Mor- gan Kaufmann.
163. Libby Miller, Andy Seaborne, and Alberto Reggiori. Three Implementations of SquishQL, a Simple RDF Query Language. In ISWC '02: Proceedings of the First International Semantic Web Conference on The Semantic Web, pages 423-435, Heidelberg,Germany, 2002. Springer.
164. Jonathan Robie, Lars Marius Garshol, Steve Newcomb, Michel Biezunski, Matthew Fuchs, Libby Miller, Dan Brickley, Vassilis Christophides, and Gregorius Kar- vounarakis. The Syntactic Web: Syntax and Semantics on the Web. Markup Languages: Theory & Practice, 4(3):411-440, 2002.
165. S. Schaffert and F. Bry. A Gentle Introduction to Xcerpt, a Rule-based Query and Transformation Language for XML. In Proc. of International Workshop on Rule Markup Languages for Business Rules on the Semantic Web, page 22 pages, Aachen, Germany, 2002. CEUR Workshop Proceedings 60.
166. Michael Sintek and Stefan Decker. TRIPLE -A Query, Inference, and Transfor- mation Language for the Semantic Web. In ISWC '02: Proceedings of the First International Semantic Web Conference on The Semantic Web, pages 364-378, Heidelberg, Germany, 2002. Springer.
167. Evren Sirin, Bijan Parsia, Bernardo C. Grau, Aditya Kalyanpur, and Yarden Katz. Pellet: A practical OWL-DL reasoner. Web Semantics: Science, Services and Agents on the World Wide Web, 5(2):51-53, June 2007.
168. Adam Souzis. RxPath: a mapping of RDF to the XPath Data Model. In Extreme Markup Languages, 2006.
169. D. Tsarkov and I. Horrocks. FaCT++ Description Logic Reasoner: System De- scription. In Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR 2006), pages 292-297, Heidelberg,Germany, 2006. Springer LNAI 4130.
170. Raphael Volz. Web Ontology Reasoning with Logic Databases. PhD thesis, Uni- versität Fridericiana zu Karlsruhe, 2004.
171. W3C. RDF Vocabulary Description Language 1.0: RDF Schema. Technical report, www.w3.org, 2004.
172. W3C. Resource Description Framework (RDF). Technical report, www.w3.org, 2004.
173. W3C. XML Path Language (XPath) 2.0. Technical report, www.w3.org, 2007.
174. W3C. XML Query Working Group and XSL Working Group, XQuery 1.0: An XML Query Language. Technical report, www.w3.org, 2007.
175. W3C. OWL 2 Web Ontology Language. Technical report, www.w3.org, 2008.
176. Norman Walsh. RDF Twig: Accessing RDF Graphs in XSLT. In Proceedings of Extreme Markup Languages, 2003.
177. BOEHM, A. M., SEIPEL, D., SICKMANN, A., WETZKA, M.: Squash: A Tool for Analyzing, Tuning and Refactoring Relational Database Applications. Proc. 17th International Confer- ence on Declarative Programming and Knowledge Management, INAP 2007, pp. 113-124
178. CHAMBERLIN, D.: XQuery: a Query Language for XML. Proc. ACM International Confer- ence on Management of Data, SIGMOD 2003. ACM Press, 2003, pp. 682-682
179. CHESS, B., MCGRAW, G.: Static Analysis for Security. IEEE Security & Privacy 2(6). 2004, pp. 76-79
180. CLOCKSIN, W. F.; MELLISH, C. S.: Programming in PROLOG. 5th Edition, Springer, 2003
181. CORBETT, J. C.; DWYER, M. B.; HATCLIFF, J.; LAUBACH, S.; PASAREANU, C. S.; ZHENG, R. H.: Bandera: Extracting Finite State Models From Java Source Code. Proc. International Conference on Software Engineering, ICSE 2000, pp. 439-448
182. DUCASSE, S., LANZA, M., BERTULI, R.: High-Level Polymetric Views of Condensed Run- Time Information. Proc. 8th European Conference on Software Maintenance and Reengi- neering, CSMR 2004, pp. 309-318
183. VAN EMDEN, E.; MOONEN, L.: Java Quality Assurance by Detecting Code Smells. Proc. 9th Working Conference on Reverse Engineering, WCRE 2002. IEEE Computer Society, pp. 97-108
184. EVANS, D., LAROCHELLE, D.: Improving Security Using Extensible Lightweight Static Analysis. IEEE Software 19(1). 2002, pp. 42-51
185. FISCHER, D.; LUSIARDI, J.: JAML: XML Representation of Java Source Code. Technical Report, University of Würzburg, Department of Computer Science. 2008
186. HOLZMANN, G. J.; SMITH, M. H.; Extracting Verification Models by Extracting Verification Models. Proc. Joint International Conference on Formal Description Techniques, FORTE 1999, and Protocol Specification, Testing, and Verification, PSTV 1999, Kluwer, pp. 481- 497
187. JBOSS; RED HAT: Hybernate. https://www.hibernate.org/
188. INTERNATIONAL ORGANIZATION FOR STANDARDIZATION: ISO/IEC 9075-14:2003 In- formation Technology -Database Languages -SQL -Part 14: XML Related Specifications (SQL/XML). 2003
189. MARINESCU, R.: Detection Strategies: Metrics-Based Rules for Detecting Design Flaws. Proc. 20th IEEE International Conference on Software Maintenance, ICSM 2004, pp. 350- 359
190. RAMAKRISHNAN, R.; GEHRKE, J.: Database Management Systems. 3rd Edition, McGraw- Hill, 2003
191. REN, X.; SHAH, F.; TIP, F.; RYDER, B. G.; CHESLEY, O.: Chianti: A Tool for Change Impact Analysis of Java Programs. ACM SIGPLAN Notices 39(10). 2004, pp. 432-448
192. SEIPEL, D.: Processing XML Documents in PROLOG. Proc. 17th Workshop on Logic Pro- grammierung, WLP 2002
193. SEIPEL, D.; BAUMEISTER, J.; HOPFNER, M.: Declarative Querying and Visualizing Knowl- edge Bases in XML. Proc. 15th International Conference on Declarative Programming and Knowledge Management, INAP 2004, pp. 140-151
194. SYSTÄ, T.; YU, P.; MÜLLER, H.: Analyzing Java Software by Combining Metrics and Pro- gram Visualization. Proc. 4th European Conference on Software Maintenance and Reengi- neering, CSMR 2000, IEEE Computer Society, pp. 199-208
195. WIELEMAKER, J.: An Overview of the SWI-PROLOG Programming Environment. Proc. 13th International Workshop on Logic Programming Environments, WLPE 2003, pp. 1-16
196. WIELEMAKER, J.: SWI-PROLOG. Version: 2007. http://www.swi-prolog.org/ Reference Model and Perspective Schemata References
197. Imhoff, C., Galemmo, N., Geiger, J.G.: Mastering Data Warehouse Design -Rela- tional and Dimensional Techniques. Wiley Publishing (2003)
198. Geiger, J.G.: Why build a data model? Information Management Magazine (June 2009)
199. Moody, D.L.: From enterprise models to dimensional models: A methodology for data warehouse and data mart design. In: Proc. of the Intl. Workshop on Design and Management of Data Warehouses. (2000)
200. Pequeno, V.M., Pires, J.C.G.M.: Using perspective schemata to model the ETL process. In: ICMIS 2009 :Intl. Conf. on Management Information Systems, France (June 2009)
201. Halevy, A.Y., Rajaraman, A., Ordille, J.J.: Data integration: The teenage years. In: VLDB. (2006) 9-16
202. Stumptner, M., Schrefl, M., Grossmann, G.: On the road to behavior-based in- tegration. In: APCCM: First Asia-Pacific Conf. on Conceptual Modelling. (2004) 15-22
203. Louie, B., Mork, P., Martin-Sanchez, F., Halevy, A., Tarczy-Hornoch, P.: Data integration and genomic medicine. Journal of Biomedical Informatics 40 (2007) 5-13
204. Naidu, P.G., Palakal, M.J., Hartanto, S.: On-the-fly data integration models for biological databases. In: SAC'07: Proc. of the 2007 ACM symp. on Applied com- puting, USA, ACM (2007) 118-122
205. Yoakum-Stover, S., Malyuta, T.: Unified architecture for integrating intelligence data. In: DAMA: Europe Conf., UK (2008)
206. Vidal, V.M.P., Lóscio, B.F., Salgado, A.C.: Using correspondence assertions for specifying the semantics of XML-based mediators. In: Workshop on Information Integration on the Web. (2001) 3-11
207. Ives, Z.G., Knoblock, C.A., Minton, S., Jacob, M., Talukdar, P.P., Tuchinda, R., Ambite, J.L., Muslea, M., Gazen, C.: Interactive data integration through smart copy & paste. In: CIDR:4th Biennial Conference on Innovative Data Systems Research, www.crdrdb.org (2009)
208. Mccann, R., Doan, A., Varadarajan, V., Kramnik, E.: Building data integration systems via mass collaboration. In: WebDB: Intl. Workshop on the Web and Databases, USA (2003)
209. Berger, S., Schrefl, M.: From federated databases to a federated data warehouse system. In: HICSS'08: 41st Annual Hawaii Intl. Conf. on System Sciences, USA, IEEE Computer Society (2008) 394
210. Dori, D., Feldman, R., Sturm, A.: From conceptual models to schemata: An object- process-based data warehouse construction method. Inf. Syst. 33(6) (2008) 567- 593
211. Malinowski, E., Zimányi, E.: A conceptual model for temporal data warehouses and its transformation to the ER and the object-relational models. Data knowl. eng. 64(1) (2008) 101-133
212. Pérez, J.M., Berlanga, R., Aramburu, M.J., Pedersen, T.B.: A relevance-extended multi-dimensional model for a data warehouse contextualized with documents. In: DOLAP'05: Proc. of the 8th ACM Intl. Workshop on Data Warehousing and OLAP, USA, ACM (2005) 19-28
213. Golfarelli, M., Maniezzo, V., Rizzi, S.: Materialization of fragmented views in multidimensional databases. Data Knowl. Eng. 49(3) (2004) 325-351
214. Husemann, B., Lechtenborger, J., Vossen, G.: Conceptual data warehouse model- ing. In: DMDW: Design and Management of Data Warehouses. (2000) 6
215. Rizzi, S.: Conceptual modeling solutions for the data warehouse. In Data Ware- housing and Mining: Concepts, Methodologies, Tools, and Applications (2008) 208-227 copyright 2008 by Information Science Reference, formerly known as Idea Group Reference (an imprint of IGI Global).
216. Wrembel, R.: On a formal model of an object-oriented database with views sup- porting data materialisation. In: Proc. of the Conf. on Advances in Databases and Information Systems. (1999) 109-116
217. Franconi, E., Kamble, A.: A data warehouse conceptual data model. In: SS- DBM'04: Proc. of the 16th Intl. Conf. on Scientific and Statistical Database Man- agement, USA, IEEE Computer Society (2004) 435-436
218. Kamble, A.S.: A conceptual model for multidimensional data. In: APCCM'08: Proc. of the 15th on Asia-Pacific Conf. on Conceptual Modelling, Australia, Aus- tralian Computer Society, Inc. (2008) 29-38
219. Sapia, C., Blaschka, M., Höfling, G., Dinter, B.: Extending the E/R model for the multidimensional paradigm. In: Proc. of the Workshops on Data Warehousing and Data Mining. (1999) 105-116
220. Tryfona, N., Busborg, F., Christiansen, J.G.B.: starER: a conceptual model for data warehouse design. In: DOLAP'99: Proc. of the 2nd ACM Intl. Workshop on Data warehousing and OLAP, USA, ACM (1999) 3-8
221. Luján-Mora, S., Trujillo, J., Song, I.Y.: A UML profile for multidimensional mod- elling in data warehouses. Data Knowl. Eng. 59(3) (2005) 725-769
222. Nguyen, T.B., Tjoa, A.M., Wagner, R.: An object oriented multidimensional data model for OLAP. In: Web-Age Inf. Management. (2000) 69-82
223. Trujillo, J., Palomar, M., Gómez, J.: Applying object-oriented conceptual modeling techniques to the design of multidimensional databases and OLAP applications. In: WAIM'00: Proc. of the 1st Intl. Conf. on Web-Age Information Management, UK, Springer-Verlag (2000) 83-94
224. Skoutas, D., Simitsis, A.: Designing ETL processes using semantic web technolo- gies. In: DOLAP'06: Proceedings of the 9th ACM international workshop on Data warehousing and OLAP, USA, ACM (2006) 67-74
225. Calvanese, D., Dragone, L., Nardi, D., Rosati, R., Trisolini, S.M.: Enterprise mod- eling and data warehousing in TELECOM ITALIA. Inf. Syst. 31(1) (2006) 1-32
226. Codd, E.F.: A relational model of data for large shared data banks. In: Commu- nications of the ACM. (1970) 377-387
227. Cattell, R.G., Barry, D., eds.: The Object Database Standard ODMG 3.0. Morgan Kaufmann Publishers (2000)
228. Pequeno, V.M., Pires, J.C.G.M.: A formal object-relational data warehouse model. Technical report, Universidade Nova de Lisboa (November 2007)
229. Pequeno, V.M., Pires, J.C.G.M.: Using perspective schemata to model the ETL process. Technical report, Universidade Nova de Lisboa (2009)
230. Elmasri, R., Navathe, S.B.: Fundamentals of database systems. 5th edn. Addison Wesley (2006)
231. Pequeno, V.M., Pires, J.C.G.M.: Reference model and perspective schemata in- ference for enterprise data integration. Technical report, Universidade Nova de Lisboa (2009)
232. Abreu, S., Nogueira, V.: Using a logic programming language with persistence and contexts. In: INAP'05: 16th Intl. Conf. on applications of declarative programming and knowledge management. Volume 4369 of Lecture Notes in Computer Science., Springer (2006) 38-47 (Revised Selected Papers).
233. Wiederhold, G.: Mediators in the architecture of future information systems. Com- puter 25(3) (1992) 38-49
234. Pequeno, V.M., Abreu, S., Pires, J.C.G.M.: Using contextual logic programming language to acess data in warehousing systems. In: 14th Portuguese Conference on Artificial Intelligence, Portugal (October 2009) (to appear). References
235. Chen, W., Warren, D.S.: Tabled Evaluation with Delaying for General Logic Pro- grams. Journal of the ACM 43(1) (1996) 20-74
236. Sagonas, K., Swift, T.: An Abstract Machine for Tabled Execution of Fixed-Order Stratified Logic Programs. ACM Transactions on Programming Languages and Systems 20(3) (1998) 586-634
237. Ramakrishnan, I.V., Rao, P., Sagonas, K., Swift, T., Warren, D.S.: Efficient Access Mechanisms for Tabled Logic Programs. Journal of Logic Programming 38(1) (1999) 31-54
238. Aït-Kaci, H.: Warren's Abstract Machine -A Tutorial Reconstruction. The MIT Press (1991)
239. Rocha, R., Silva, F., Santos Costa, V.: On applying or-parallelism and tabling to logic programs. Theory and Practice of Logic Programming 5(1 & 2) (2005) 161-205
240. Bachmair, L., Chen, T., Ramakrishnan, I.V.: Associative Commutative Discrimi- nation Nets. In: International Joint Conference on Theory and Practice of Software Development. Number 668 in LNCS, Springer-Verlag (1993) 61-74
241. Fonseca, N.A., Camacho, R., Rocha, R., Costa, V.S.: Compile the hypothesis space: do it once, use it often. Fundamenta Informaticae 89(1) (2008) 45-67
242. Kimmig, A., Costa, V.S., Rocha, R., Demoen, B., Raedt, L.D.: On the Efficient Ex- ecution of ProbLog Programs. In: International Conference on Logic Programming. Number 5366 in LNCS, Springer-Verlag (2008) 175-189
243. J. J. Alferes, L. M. Pereira, and T. Swift. Abduction in well-founded semantics and gener- alized stable models via tabled dual programs. Theory and Practice of Logic Programming, 4(4):383-428, July 2004.
244. H. Christiansen and V. Dahl. Hyprolog: A new logic programming language with assump- tions and abduction. In M. Gabbrielli and G. Gupta, editors, ICLP, volume 3668 of LNCS, pages 159-173. Springer, 2005.
245. S. Citrigno, T. Eiter, W. Faber, G. Gottlob, C. Koch, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. The dlv system: Model generator and advanced frontends (system description). In 12th Workshop on Logic Programming, 1997.
246. M. Denecker and D. De Schreye. Sldnfa: An abductive procedure for normal abductive programs. In Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 686-700, Washington, USA, 1992. The MIT Press.
247. T. Eiter, G. Gottlob, and N. Leone. Abduction from logic programs: semantics and complex- ity. Theoretical Computer Science, 189(1-2):129-177, 1997.
248. T. H. Fung and R. Kowalski. The iff proof procedure for abductive logic programming. J. Log. Prog., 33(2):151 -165, 1997.
249. A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. J. of ACM, 38(3):620-650, 1991.
250. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In ICLP/SLP, pages 1070-1080. MIT Press, 1988.
251. K. Inoue and C. Sakama. A fixpoint characterization of abductive logic programs. Journal of Logic Programming, 27(2):107-136, 1996.
252. Luis Moniz Pereira and Alexandre Miguel Pinto
253. A. Kakas, R. Kowalski, and F. Toni. The role of abduction in logic programming. In Hand- book of Logic in AI and LP, volume 5, pages 235-324. Oxford University Press, 1998.
254. I. Niemelä and P. Simons. Smodels -an implementation of the stable model and well- founded semantics for normal logic programs. In Procs. 4th Intl. Conf. Logic Programming and Nonmonotonic Reasoning, volume 1265 of LNAI, pages 420-429, July 1997.
255. F. Sadri and F. Toni. Abduction with negation as failure for active and reactive rules. In E. Lamma and P. Mello, editors, AI*IA, volume 1792 of LNCS, pages 49-60. Springer, 1999.
256. T. Swift and D. S. Warren. An abstract machine for slg resolution: Definite programs. In Symp. on Logic Programming, pages 633-652, 1994.
257. L. Castro, T. Swift, and D. S. Warren. XASP: Answer Set Programming with XSB and Smod- els. http://xsb.sourceforge.net/packages/xasp.pdf.
258. S. Citrigno, T. Eiter, W. Faber, G. Gottlob, C. Koch, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. The dlv system: Model generator and advanced frontends (system description). In Workshop in Logic Programming, 1997.
259. C.V. Damásio and L. M. Pereira. Default negated conclusions: Why not? In R. Dyckhoff et al, editor, Extensions of Logic Programming, ELP'96, volume 1050 of LNAI, pages 103- 118. Springer-Verlag, 1996.
260. J. Dix. A Classification-Theory of Semantics of Normal Logic Programs: I, II. Fundamenta Informaticae, XXII(3):227-255, 257-288, 1995.
261. J. Dix, G. Gottlob, V.W. Marek, and C. Rauszer. Reducing disjunctive to non-disjunctive semantics by shift-operations. Fundamenta Informaticae, 28:87-100, 1996.
262. A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. J. of ACM, 38(3):620-650, 1991.
263. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In ICLP/SLP, pages 1070-1080. MIT Press, 1988.
264. M. Gelfond, H. Przymusinska, V. Lifschitz, and M. Truszczynski. Disjunctive defaults. In KR-91, pages 230-237, 1991.
265. I. Niemelä and P. Simons. Smodels -an implementation of the stable model and well- founded semantics for normal logic programs. In Procs. LPNMR'97, LNAI 1265, pages 420-429, 1997.
266. L.M. Pereira and A.M. Pinto. Layered models top-down querying of normal logic programs. In Procs. PADL'09, volume 5418 of LNCS, pages 254-268. Springer, January 2009.
267. Luís Moniz Pereira and Alexandre Miguel Pinto. Layer supported models of logic programs. In E. Erdem, F. Lin, and T. Schaub, editors, Procs. 10th LPNMR, LNAI. Springer, September 2009. http://centria.di.fct.unl.pt/∼lmp/publications/online-papers/LSMs.pdf (long version).
268. T.C. Przymusinski. Perfect model semantics. In ICLP/SLP, pages 1081-1096, 1988.
269. T. Swift. Tabling for non-monotonic programming. AMAI, 25(3-4):201-240, 1999.
270. R. Tarjan. Depth-first search and linear graph algorithms. SIAM J. Computing, 1(2):146-160, 1972. References
271. Martin Brain, Richard Watson, and Marina De Vos. An interactive approach to answer set programming. In Answer Set Programming, volume 142 of CEUR Workshop Proceedings. CEUR-WS.org, 2005.
272. Marco Cadoli, Giovambattista Ianni, Luigi Palopoli, Andrea Schaerf, and Domenico Vasile. NP-SPEC: an executable specification language for solving all problems in NP. Comput. Lang., 26(2-4):165-195, 2000.
273. Niklas Eén and Niklas Sörensson. An extensible sat-solver. In Enrico Giunchiglia and Armando Tacchella, editors, SAT, volume 2919 of Lecture Notes in Computer Science, pages 502-518. Springer, 2003.
274. Herbert B. Enderton. A Mathematical Introduction To Logic. Academic Press, 1972.
275. Maria Fox, Alfonso Gerevini, Derek Long, and Ivan Serina. Plan stability: Replan- ning versus plan repair. In Derek Long, Stephen F. Smith, Daniel Borrajo, and Lee McCluskey, editors, ICAPS, pages 212-221. AAAI, 2006.
276. Chu Min Li, Felip Manyà, and Jordi Planes. New inference rules for max-sat. J. Artif. Intell. Res. (JAIR), 30:321-359, 2007.
277. Victor W. Marek and Mirek Truszczyński. Stable models and an alternative logic programming paradigm. In K.R. Apt, V. Marek, M. Truszczyński, and D.S. War- ren, editors, The Logic Programming Paradigm: a 25 Years Perspective, pages pp. 375-398. Springer-Verlag, 1999.
278. Maarten Mariën, Johan Wittocx, Marc Denecker, and Bruynooghe Maurice. SAT(ID): Satisfiability of propositional logic extended with inductive definitions. In Proceedings of the 11th conference on Theory and Applications of Satisfiabil- ity Testing, SAT 2008, volume 4996 of Lecture Notes in Computer Science, pages 211-224. Springer, 2008.
279. David Mitchell and Eugenia Ternovska. A framework for representing and solving NP search problems. In AAAI'05, pages 430-435. AAAI Press/MIT Press, 2005.
280. David G. Mitchell. A SAT-solver primer. Bulletin of the EATCS, 85:112-132, 2005.
281. Ilkka Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241-273, 1999.
282. Murray Patterson, Yongmei Liu, Eugenia Ternovska, and Arvind Gupta. Ground- ing for model expansion in k-guarded formulas with inductive definitions. In Manuela M. Veloso, editor, IJCAI, pages 161-166, 2007.
283. Simona Perri, Francesco Scarcello, Gelsomina Catalano, and Nicola Leone. En- hancing DLV instantiator by backjumping techniques. Annals of Mathematics and Artificial Intelligence, 51(2-4):195-228, 2007.
284. Knot Pipatsrisawat and Adnan Darwiche. Clone: Solving weighted max-sat in a reduced search space. In Mehmet A. Orgun and John Thornton, editors, Australian Conference on Artificial Intelligence, volume 4830 of Lecture Notes in Computer Science, pages 223-233. Springer, 2007.
285. Bart Selman, Henry Kautz, and Bram Cohen. Local search strategies for satisfiabil- ity testing. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 521-532, 1993.
286. Johan Wittocx, Maarten Mariën, and Marc Denecker. GidL: A grounder for FO + . In Michael Thielscher and Maurice Pagnucco, editors, NMR'08, pages 189-198, 2008. References
287. Abr01. Salvador Abreu. Isco: A practical language for heterogeneous information system construction. In Proceedings of INAP'01, Tokyo, Japan, October 2001. Prolog Association of Japan.
288. Abr02. Salvador Abreu. Modeling Role-Based Access Control in ISCO. In Lgia Maria Ribeiro and Jos Marques dos Santos, editors, The 8th Inter- national Conference of European University Information Systems. FEUP Edies, June 2002. ISBN 972-752-051-0.
289. AD03. Salvador Abreu and Daniel Diaz. Objective: In minimum context. In Catus- cia Palamidessi, editor, ICLP, volume 2916 of Lecture Notes in Computer Science, pages 128-147. Springer, 2003.
290. Salvador Abreu, Daniel Diaz, and Vitor Nogueira. Organizational informa- tion systems design and implementation with contextual constraint logic programming. In IT Innovation in a Changing World -The 10 th Interna- tional Conference of European University Information Systems, Ljubljana, Slovenia, June 2004.
291. Cor05. Oracle Corportation. Oracle database 10g workspace manager overview. Oracle White Paper, May 2005.
292. Frü96. Thom W. Frühwirth. Temporal annotated constraint logic programming. J. Symb. Comput., 22(5/6):555-583, 1996.
293. MP93. Luís Monteiro and António Porto. A Language for Contextual Logic Pro- gramming. In K.R. Apt, J.W. de Bakker, and J.J.M.M. Rutten, editors, Logic Programming Languages: Constraints, Functions and Objects, pages 115-147. MIT Press, 1993.
294. NA07a. Vitor Nogueira and Salvador Abreu. Temporal Annotations for a Contex- tual Logic Programming Language. In José Neves, Manuel Santos, and José Machado, editors, Progress in Artificial Intelligence, 13th Portuguese Conference on Artificial Intellige nce, EPIA 2007, Universidade do Minho, 2007. NA07b. Vitor Nogueira and Salvador Abreu. Temporal contextual logic program- ming. Electr. Notes Theor. Comput. Sci., 177:219-233, 2007.
295. Por03. António Porto. An integrated information system powered by prolog. In Verónica Dahl and Philip Wadler, editors, PADL, volume 2562 of Lecture Notes in Computer Science, pages 92-109. Springer, 2003.
296. TCG + 93. Abdullah Uz Tansel, James Clifford, Shashi Gadia, Sushil Jajodia, Arie Segev, and Richard Snodgrass, editors. Temporal databases: theory, design, and implementation. Benjamin-Cummings Publishing Co., Inc., Redwood City, CA, USA, 1993. color(Color) :- parameter(3, Color). area(Area) :- this(ellipse(Rx, Ry, _)), Area is Rx*Ry*pi.
297. -object(circle(Radius, Color), % circles are ellipses extends(ellipse(Radius, Radius, Color
298. % where Rx = Ry :-public(r/1). r(Radius) :- parameter(1, Radius).
299. -end_object. Processes may depend on other processes. These dependency relations can be described using a list of parametric object identifiers. For example: :-object(b(_), implements(process_description)). domain([a(A)], (B #>= A, B #=< 3)) :- parameter(1, B).
300. -object(c(_), implements(process_description)). domain([a(A), b(B)], (C #= B + 1, C #= A + 1)) :- parameter(1, C).
301. Moura, P.: Logtalk 2.6 Documentation. Technical Report DMI 2000/1, University of Beira Interior, Portugal (July 2000)
302. Moura, P.: Logtalk -Design of an Object-Oriented Logic Programming Language. PhD thesis, Department of Computer Science, University of Beira Interior, Portu- gal (September 2003)
303. Moura, P.: Logtalk 2.37.2 User and Reference Manuals. (June 2009)
304. Swedish Institute for Computer Science: SICStus Prolog 4.0 User Manual. (April 2009)
305. Clocksin, W.F., Mellish, C.S.: Programming in Prolog. Springer-Verlag, New York (1987)
306. McCabe, F.G.: Logic and Objects. Series in Computer Science. Prentice Hall (1992)
307. Igler, M., Joblonski, S.: ESProNa -Engine for Semantic Process Navigation. http://www.ai4.uni-bayreuth.de/ (2009)
308. Fromherz, M.: OL(P): Object Layer for Prolog. ftp://parcftp.xerox.com/ftp/ pub/ol/ (1993)
309. Kino, N.: Logical assignment of Prolog terms. http://www.kprolog.com/en/ logical_assignment/ (2005)
310. Moura, P., Marchetti, V.: Logtalk Processing of STEP Part 21 Files. In Etalle, S., Truszczyński, M., eds.: Proceedings of the 22nd International Conference on Logic Programming. Number 4079 in Lecture Notes in Computer Science, Berlin Heidelberg, Springer-Verlag (August 2006) 453-454
311. Moura, P., Dias, A.M.: L-FLAT: Logtalk Toolkit for Formal Languages and Au- tomata. http://code.google.com/p/lflat/ (2009)
312. Wermelinger, M., Dias, A.M.: A Prolog Toolkit for Formal Languages and Au- tomata. In: ITiCSE '05: Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, New York, NY, USA, ACM (2005) 330-334
313. Alferes, J. J., Brogi, A., Leite, J. A., and Pereira, L. M. Evolving logic programs. In S. Flesca et al., editor, JELIA, volume 2424 of LNCS, pages 50-61. Springer, 2002.
314. Alferes, J. J., Damásio, C. V., and Pereira, L. M. (1994). SLX -A top-down derivation proce- dure for programs with explicit negation. In Bruynooghe, M., editor, Proc. Int. Symp. on Logic Programming. The MIT Press.
315. Alferes, J. J. and Pereira, L. M. (1996). Reasoning with Logic Programming, volume 1111 of LNAI. Springer-Verlag.
316. Baral, C., Gelfond, M., and Rushton, J. Nelson. Probabilistic reasoning with answer sets. In Vladimir Lifschitz and Ilkka Niemelä, editors, LPNMR, volume 2923 of Lecture Notes in Computer Science, pages 21-33. Springer, 2004.
317. Baral, C. and Gelfond, M. (1994). Logic programming and knowledge representation. Journal of Logic Programming, 19/20:73-148.
318. Damásio, C. V., Nejdl, W., and Pereira, L. M. (1994). REVISE: An extended logic program- ming system for revising knowledge bases. In Doyle, J., Sandewall, E., and Torasso, P., editors, Knowledge Representation and Reasoning, pages 607-618. Morgan Kaufmann.
319. Damásio, C. V. and Pereira, L. M. Default Negated Conclusions: Why Not?. In ELP'96, pages 103-117. Springer, 1996
320. De Raedt, L. and Bruynooghe, M. (1989). Towards friendly concept-learners. In Procs. of the 11th Intl. Joint Conf. on Artificial Intelligence, pages 849-856. Morgan Kaufmann.
321. De Raedt, L. and Bruynooghe, M. (1990). On negation and three-valued logic in interactive concept learning. In Procs. of the 9th European Conf. on Artificial Intelligence.
322. De Raedt, L. and Bruynooghe, M. (1992). Interactive concept learning and constructive induction by analogy. Machine Learning, 8(2):107-150.
323. Dung, P. M. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell., 77(2):321-358, 1995.
324. Esposito, F., Ferilli, S., Lamma, E., Mello, P., Milano, M., Riguzzi, F., and Semeraro, G. (1998). Cooperation of abduction and induction in logic programming. In Flach, P. A. and Kakas, A. C., editors, Abductive and Inductive Reasoning, Pure and Applied Logic. Kluwer.
325. Gelfond, M. and Lifschitz, V. (1988). The stable model semantics for logic programming. In Kowalski, R. and Bowen, K. A., editors, Procs. of the 5th Int. Conf. on Logic Programming, pages 1070-1080. MIT Press.
326. Gordon, D. and Perlis, D. (1989). Explicitly biased generalization. Computational Intelli- gence, 5(2):67-81.
327. Green, D.M., and Swets, J.M. (1966). Signal detection theory and psychophysics. New York: John Wiley and Sons Inc.. ISBN 0-471-32420-5.
328. Greiner, R., Grove, A. J., and Roth, D. (1996). Learning active classifiers. In Procs. of the Thirteenth Intl. Conf. on Machine Learning (ICML96).
329. Inoue, K. (1998). Learning abductive and nonmonotonic logic programs. In Flach, P. A. and Kakas, A. C., editors, Abductive and Inductive Reasoning, Pure and Applied Logic. Kluwer.
330. Inoue, K. and Kudoh, Y. (1997). Learning extended logic programs. In Procs. of the 15th Intl. Joint Conf. on Artificial Intelligence, pages 176-181. Morgan Kaufmann.
331. Koza, J.R. (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection MIT Press
332. Jean Baptiste Lamarck: http://www.ucmp.berkeley.edu/history/lamarck.html
333. Grefenstette, J. J., (1991). Lamarckian learning in multi-agent environments
334. Lamma, E., Riguzzi, F., and Pereira, L. M. (1988). Learning in a three-valued setting. In Procs. of the Fourth Intl. Workshop on Multistrategy Learning.
335. Lamma, E., Pereira, L. M., and Riguzzi, F. Belief revision via lamarckian evolution. New Generation Computing, 21(3):247-275, August 2003.
336. Lamma, E., Riguzzi, F., and Pereira, L. M. Strategies in combined learning via logic pro- grams. Machine Learning, 38(1-2):63-87, January 2000.
337. Lapointe, S. and Matwin, S. (1992). Sub-unification: A tool for efficient induction of recur- sive programs. In Sleeman, D. and Edwards, P., editors, Procs. of the 9th Intl. Workshop on Machine Learning, pages 273-281. Morgan Kaufmann.
338. Lavrač, N. and Džeroski, S. (1994). Inductive Logic Programming: Techniques and Appli- cations. Ellis Horwood.
339. Pazzani, M. J., Merz, C., Murphy, P., Ali, K., Hume, T., and Brunk, C. (1994). Reducing misclassification costs. In Procs. of the Eleventh Intl. Conf. on Machine Learning (ML94), pages 217-225.
340. Pereira, L. M. and Pinto, A. M. Revised stable models -a semantics for logic programs. In G. Dias et al., editor, Progress in AI, volume 3808 of LNCS, pages 29-42. Springer, 2005.
341. Pereira, L. M. and Pinto, A. M. Reductio ad absurdum argumentation in normal logic programs. In Argumentation and Non-monotonic Reasoning (ArgNMR'07) workshop at LP- NMR'07, pages 96-113, 2007.
342. Pereira, L. M. and Pinto, A. M. Approved Models for Normal Logic Programs. In LPAR, pages 454-468. Springer, 2007.
343. Pinto, A. M. Explorations in revised stable models -a new semantics for logic programs. Master's thesis, Universidade Nova de Lisboa, February 2005.
344. Provost, F. J. and Fawcett, T. (1997). Analysis and visualization of classifier performance: Comparison under imprecise class and cost distribution. In Procs. of the Third Intl. Conf. on Knowledge Discovery and Data Mining (KDD97). AAAI Press.
345. Quinlan, J. (1990). Learning logical definitions from relations. Machine Learning, 5:239- 266.
346. Vere, S. A. (1975). Induction of concepts in the predicate calculus. In Procs. of the Fourth Intl. Joint Conf. on Artificial Intelligence (IJCAI75), pages 281-287.
347. Whitley, D., Rana, S., and Heckendorn, R.B. (1998) The Island Model Genetic Algorithm: On Separability, Population Size and Convergence Luis Moniz Pereira and Alexandre Miguel Pinto References
348. Costantini, S., Tocchio, A.: About declarative semantics of logic-based agent languages. In Baldoni, M., Torroni, P., eds.: Declarative Agent Languages and Technologies. LNAI 3904. 106-123
349. Alferes, J.J., Brogi, A., Leite, J.A., Pereira, L.M.: Evolving logic programs. In: Logics in Artificial Intelligence, Proc. of the 8th Europ. Conf., JELIA 2002. LNAI 2424, Springer- Verlag, Berlin (2002) 50-61
350. Costantini, S., Tocchio, A., Toni, F., Tsintza, P.: A multi-layered general agent model. In: AI*IA 2007: Artificial Intelligence and Human-Oriented Computing, 10th Congress of the Italian Association for Artificial Intelligence. LNCS 4733, Springer-Verlag, Berlin (2007)
351. Costantini, S., Dell'Acqua, P., Pereira, L.M.: A multi-layer framework for evolving and learning agents. In M. T. Cox, A.R., ed.: Proceedings of Metareasoning: Thinking about thinking workshop at AAAI 2008, Chicago, USA. (2008)
352. Fisher, M., Bordini, R.H., Hirsch, B., Torroni, P.: Computational logics and agents: a road map of current technologies and future trends. Computational Intelligence Journal 23(1) (2007) 61-91
353. Clarke, E.M., Lerda, F.: Model checking: Software and beyond. Journal of Universal Com- puter Science 13(5) (2007) 639-649
354. Barringer, H., Rydeheard, D., Gabbay, D.: A logical framework for monitoring and evolving software components. In: TASE '07: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering, Washington, DC, USA, IEEE Computer Society (2007) 273-282
355. Barringer, H., Fisher, M., Gabbay, D., Gough, G., Owens, R.: MetateM: A framework for programming in temporal logic. In: Proceedings of REX Workshop on Stepwise Refine- ment of Distributed Systems: Models, Formalisms, Correctness. LNCS 430, Springer-Verlag (1989)
356. Fisher, M.: Metatem: The story so far. In Bordini, R.H., Dastani, M., Dix, J., Fallah- Seghrouchni, A.E., eds.: PROMAS. LNCS 3862, Springer (2005) 3-22
357. Costantini, S., Tocchio, A.: The DALI logic programming agent-oriented language. In: Logics in Artificial Intelligence, Proc. of the 9th European Conference, Jelia 2004. LNAI 3229, Springer-Verlag, Berlin (2004)
358. Apt, K.R., Bol, R.: Logic programming and negation: A survey. The Journal of Logic Programming 19-20 (1994) 9-71
359. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Logic Programming, Proc. of the Fifth Joint Int. Conf. and Symposium, MIT Press (1988) 1070- 1080
360. Barklund, J., Dell'Acqua, P., Costantini, S., Lanzarone, G.A.: Reflection principles in com- putational logic. J. of Logic and Computation 10(6) (2000) 743-786
361. J.Alferes, J., Brogi, A., Leite, J.A., Pereira, L.M.: An evolvable rule-based e-mail agent. In: Procs. of the 11th Portuguese Intl.Conf. on Artificial Intelligence (EPIA'03). LNAI 2902, Springer-Verlag, Berlin (2003) 394-408
362. Bracciali, A., Demetriou, N., Endriss, U., Kakas, A., Lu, W., Mancarella, P., Sadri, F., Stathis, K., Terreni, G., Toni, F.: The KGP model of agency: Computational model and prototype implementation. In: Global Computing: IST/FET International Workshop, Revised Selected Papers. LNAI 3267. Springer-Verlag, Berlin (2005) 340-367
363. Kakas, A.C., Mancarella, P., Sadri, F., Stathis, K., Toni, F.: The KGP model of agency. In: Proc. ECAI-2004. (2004)
364. Stathis, K., Toni, F.: Ambient Intelligence using KGP Agents. In Markopoulos, P., Eggen, B., Aarts, E.H.L., Crowley, J.L., eds.: Proceedings of the 2nd European Symposium for Ambient Intelligence (EUSAI 2004). LNCS 3295, Springer Verlag (2004) 351-362
365. Tocchio, A.: Multi-Agent systems in computational logic. PhD thesis, Dipartimento di Informatica, Università degli Studi di L'Aquila (2005)
366. Costantini, S., Tocchio, A.: A logic programming language for multi-agent systems. In: Logics in Artificial Intelligence, Proc. of the 8th Europ. Conf.,JELIA 2002. LNAI 2424, Springer-Verlag, Berlin (2002)
367. Costantini, S., Tocchio, A.: Memory-driven dynamic behavior checking in logical agents. In: Electr. Proc. of CILC'06, Italian Conference of Computational Logic. (2006) URL: http://cilc2006.di.uniba.it/programma.html.
368. Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Verifiable agent interaction in abductive logic programming: The SCIFF framework. ACM Trans. Comput. Log. 9(4) (2008)
369. Montali, M., Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Veri- fication from declarative specifications using logic programming. In Banda, M.G.D.L., Pon- telli, E., eds.: 24th Int. Conf. on Logic Programming (ICLP). LNCS 5366, Udine, Italy, Springer Verlag (December 2008) 440-454
370. Baier, J., Bacchus, F., McIlraith, S.: A heuristic search approach to planning with temporally extended preferences. In: Proc. 20th Int. J. Conf. on Artificial Intelligence (IJCAI-07). (2007) 1808-1815
371. Baier, J.A., Fritz, C., Bienvenu, M., McIlraith, S.: Beyond classical planning: Procedural control knowledge and preferences in state-of-the-art planners. In: Proc. 23rd AAAI Conf. on Artificial Intelligence (AAAI), Nectar Track. (2008) 1509-1512
372. Fritz, C., McIlraith, S.A.: Monitoring policy execution. In: Proc. 3rd Workshop on Planning and Plan Execution for Real-World Systems. (2007) (at ICAPS07).
373. Bauer, A., Leucker, M., Schallhart, C.: Runtime verification for LTL and TLTL. Techni- cal Report TUM-I0724, Institut für Informatik, Technische Universität München (December 2007)
374. Bauer, A., Leucker, M., Schallhart, C.: Monitoring of real-time properties. In Arun-Kumar, S., Garg, N., eds.: Proc. 26th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). LNCS 4337, Berlin, Heidelberg, Springer-Verlag (2006)
375. Raskin, J.F.: Logics, Automata and Classical Theories for Deciding Real Time. PhD thesis, Institut d'Informatique, FUNDP, Namur, Belgium (1999)
376. D'Souza, D.: A logical characterisation of event clock automata. Int. J. Found. Comput. Sci. 14(4) (2003) 625-640