Evolution and reactivity for the Web

Lecture Notes in Computer Science

Volumn 3564, Issue , 2005, Pages 134-172

  Alferes, José Júlio ^a   May, Wolfgang ^b  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

^b UNIVERSITY OF GÖTTINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; DATA COMMUNICATION SYSTEMS; FORMAL LANGUAGES; SEMANTICS;

DATA SOURCES; INFORMATION SYSTEMS; REACTIVE LANGUAGES; SEMANTIC WEB;

WORLD WIDE WEB;

EID: 26444610088     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11526988_4     Document Type: Conference Paper

References (65)

1. J. J. Alferes, J. Bailey, M. Berndtsson, F. Bry, J. Dietrich, A. Kozlenkov, W. May, P. L. Pǎtrânjan, A. Pinto, M. Schroeder, and G. Wagner. State-of-the-art on evolution and reactivity. Technical Report IST506779/Lisbon/I5-D1/D/PU/a1, REWERSE, September 2004.
2. J. J. Alferes, M. Berndtsson, F. Bry, M. Eckert, N. Henze, W. May, P. L. Pǎtrânjan, and M. Schroeder. Use-cases on evolution. Technical Report IST506779/Lisbon/I5-D2/D/PU/a1, REWERSE, September 2004.
3. James Bailey, Alexandra Poulovassilis, and Peter T. Wood. An event-conditionaction language for XML. In Int. WWW Conference, 2002.
4. C. Baral, M. Gelfond, and Alessandro Provetti. Representing actions: Laws, observations and hypotheses. Journal of Logic Programming, 31(1-3):201-243, April-June 1997.
5. M. Ben-Ari, Z. Manna, and A. Pnueli. The temporal logic of branching time. In 8th Annual ACM Symp. on Principles of Programming Languages, 1981.
6. J. A. Bergstra and J. W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 1(37):77-121, 1985.
7. Angela Bonifati, Daniele Braga, Alessandro Campi, and Stefano Ceri. Active XQuery. In Intl. Conference on Data Engineering (ICDE), pages 403-418, San Jose, California, 2002.
8. A. J. Bonner and M. Kifer. An overview of transaction logic. Theoretical Computer Science, 133(2): 205-265, 1994.
9. A. J. Bonner and M. Kifer. Concurrency and communication in transaction logic. In ICDT'95: Advances in Logic-Based Languages, 1995.
10. François Bry and Sebastian Schaffert. Towards a declarative query and transformation language for XML and semistructured data: Simulation unification. In Intl. Conf. on Logic Programming (ICLP), number 2401 in LNCS, pages 255-270, 2002.
11. François Bry, Paula Lavinia Pǎtrânjan, and Sebastian Schaffert. Xcerpt and XChange: Deductive Languages for Data Retrieval and Evolution on the Web. In Proc. of Workshop on Semantic Web Services and Dynamic Networks, Ulm, Germany, (22nd - 24th September 2004). GI, 2004.
12. François Bry and Sebastian Schaffert. Querying the Web Reconsidered: A Practical Introduction to Xcerpt. In Proc. of Extreme Markup Languages 2004, Montreal, Quebec, Canada, (2nd - 6th August 2004), 2004.
13. S. Chakravarthy, V. Krishnaprasad, E. Anwar, and S.-K. Kim. Composite events for active databases: Semantics, contexts and detection. In Proceedings of the 20th VLDB, pages 606-617, 1994.
14. Jianjun Chen, David J. deWitt, Feng Tian, and Yuang Wang. NiagaraCQ: A scalable continuous query system for internet databases. In ACM Intl. Conference on Management of Data (SIGMOD), pages 379-390, 2000.
15. Jan Chomicki. Efficient checking of temporal integrity constraints using bounded history encoding. ACM Transactions on Database Systems (TODS), 20(2): 149-186, 1995.
16. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. of the IBM Workshop on Logics of Programs, number 131 in Lecture Notes in Computer Science, 1981.
17. Document object model (DOM). http://www.w3.org/DOM/, 1998.
18. Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, and Axel Polleres. A Logic Programming Approach to Knowledge-State Planning: Semantics and Complexity. ACM Transactions on Computational Logic, 5(2):206-263, 2004.
19. Thomas Eiter, Wolfgang Faber, Gerald Pfeifer, and Axel Polleres. Declarative planning and knowledge representation in an action language. In Ioannis Vlahavas and Dimitris Vrakas, editors, Intelligent Techniques for Planning. Idea Group, Inc., 2004.
20. E. A. Emerson and C.-L. Lei. Modalities for model checking: Branching time strikes back. In 12th Annual ACM Symp. on Principles of Programming Languages, 1985.
21. eXist: an Open Source Native XML Database, http://exist-db.org/.
22. D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In ACM Symposium on Principles of Programming Languages, pages 163-173, 1980.
23. Dov Gabbay. The declarative past, and imperative future: Executable temporal logic for interactive systems. In B. Banieqbal, B. Barringer, and A. Pnueli, editors, Temporal Logic in Specification, number 398 in Lecture Notes in Computer Science, pages 409-448. Springer, 1989.
24. M. Gelfond and V. Lifschitz. Representing actions and change by logic programs. Journal of Logic Programming, 17:301-322, 1993.
25. M. Gelfond and V. Lifschitz. Action languages. Electronic Transactions on Artificial Intelligence, 2(3-4): 193-210, 1998.
26. E. Giunchiglia, G. Kartha, and V. Lifschitz. Representing actions: Indeterminacy and ramifications. Artificial Intelligence, 95:409-443, 1997.
27. E. Giunchiglia, J. Lee, V. Lifschitz, N. Mc Cain, and H. Turner. Representing actions in logic programs and default theories: a situation calculus approach. Journal of Logic Programming, 31:245-298, 1997.
28. E. Giunchiglia, J. Lee, V. Lifschitz, N. McCain, and H. Turner. Nonmonotonic causal theories. Artificial Intelligence, 153:49-104, 2004.
29. E. Giunchiglia and V. Lifschitz. An action language based on causal explanation: Preliminary report. In AAAI'98, pages 623-630, 1998.
30. Y. Gurevich. Logic and the challenge of computer science. In Current Trends in Theoretical Computer Science, pages 1-57. Computer Science Press, 1988.
31. Y. Gurevich. Evolving algebras 1993: Lipari guide. In E. Börger, editor, Specification and Validation Methods, pages 9-36. Oxford University Press, 1995.
32. D. Harel. First-Order Dynamic Logic. Number 68 in Lecture Notes in Computer Science. Springer, 1979.
33. D. Harel. Dynamic Logic. In D. Gabbay and F. Guenther, editors, Handbook of Philosophical Logic, Volume II - Extensions of Classical Logic, pages 497-604. Reidel Publishing Company, 1984.
34. D. Harel, D. Kozen, and R. Parikh. Process Logic: Expressiveness, decidability, completeness. Journal of Computer and System Sciences, 25(2): 144-170, 1982.
35. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
36. David B. Kemp, Kotagiri Ramamohanarao, and Peter J. Stuckey. ELS Programs and the Efficient Evaluation of Non-Stratified Programs by Transformation to ELS. In Tok Wang Ling, Alberto O. Mendelzon, and Laurent Vieille, editors, Intl. Conference on Deductive and Object-Oriented Databases (DOOD), number 1013 in Lecture Notes in Computer Science, pages 91-108, Singapore, 1995. Springer.
37. L. Lamport, 'sometimes' is sometimes 'not never'. In 7th Annual ACM Symp. on Principles of Programming Languages, 1980.
38. Georg Lausen, Bertram Ludäscher, and Wolfgang May. On logical foundations of active databases. In Jan Chomicki and Gunter Saake, editors, Logics for Databases and Information Systems, chapter 12, pages 389-422. Kluwer Academic Publishers, 1998.
39. Patrick Lehti. Design and Implementation of a Data Manipulation Processor for an XML Query Language (diploma thesis), August 2001. Technische Universität Darmstadt.
40. H.J. Levesque, R. Reiter, Y. Lesprance, F. Lin, and R. Scherl. Golog: A logic programming language for dynamic domains. Journal of Logic Programming, 31:59-83, 1997.
41. J. Lobo, R. Bhatia, and S.Naqvi. A policy description language. In National Conference on Artificial Intelligence (AAAI), 1999.
42. Wolfgang May, José Júlio Alferes, and François Bry. Towards generic query, update, and event languages for the Semantic Web. In Principles and Practice of Semantic Web Reasoning (PPSWR), number 3208 in Lecture Notes in Computer Science, pages 19-33. Springer, 2004.
43. John McCarthy. Formalizing Common Sense. Ablex, Norwood, 1990.
44. John McCarthy and P, J. Hayes. Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence, 4, 1969.
45. R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267-310, 1983.
46. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
47. R. Milner. Operational and algebraic semantics of concurrent processes. In J. v. Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 19, pages 1201-1242. Elsevier, 1990.
48. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Information and Computation, 1(100): 1-77, 1992.
49. George Papamarkos, Alexandra Poulovassilis, and Peter T. Wood. Event-condition-action rule languages for the semantic web. In Workshop on Semantic Web and Databases (SWDB'03), 2003.
50. E. Pednault. Exploring the middle ground between STRIPS and the Situation Calculus. In Proc. of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89), pages 324-332. Morgan Kaufmann Publishers Inc., 1989.
51. G. Plotkin. A structured approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, 1981.
52. V, R. Pratt. Semantical considerations on Floyd-Hoare Logic. In 17.th IEEE Symp. on Foundations of Computer Science, pages 109-121, 1976.
53. R. Reiter. Proving properties of states in the situation calculus. Artificial Intelligence, 64(2):337-351, 1993.
54. E. Sandewall. Features and Fluents: A Systematic Approach to the Representation of Knowledge about Dynamical Systems. Oxford University Press, 1994.
55. Munindar P. Singh. Semantical considerations on workflows: An algebra for intertask dependencies. In Intl. Workshop on Database Programming Languages, electronic Workshops in Computing, Gubbio, Italy, 1995. Springer.
56. A. Prasad Sistla and Ouri Wolfson. Temporal Conditions and Integrity Constraints in Active Database Systems. In Proceedings ACM SIGMOD International Conference on Management of Data (SIGMOD 1995), pages 269-280, 1995.
57. T. Son and C. Baral. Formalizing sensing actions - a transition function based approach. Artificial Intelligence, 125(1-2):19-91, 2001.
58. C. Stirling. Temporal logics for CCS. In Linear Time, Branching Time and Partial Order in Logics and Models of Concurrency, number 354 in Lecture Notes in Computer Science, pages 660-672. Springer, 1989.
59. Igor Tatarinov, Zachary G. Ives, Alon Halevy, and Daniel Weld. Updating XML. In ACM Intl. Conference on Management of Data (SIGMOD), pages 133-154, 2001.
60. Feng Tian, Berthold Reinwald, Hamid Pirahesh, Tobias Mayr, and Jussi Myllymaki. Implementing a scalable XML publish/subscribe system using relational database systems. In A CM Intl. Conference on Management of Data (SIGMOD), 2004.
61. J. van Benthem and J. Bergstra. Logic of transition systems. Journal of Logic, Language, and Information, 3:247-283, 1995.
62. World Wide Web Consortium, http://www.w3.org/TR/xpath. XML Path Language (XPath), Nov 1999.
63. World Wide Web Consortium, http://www.w3.org/TR/xquery/. XQuery: A Query Language for XML, Feb 2001.
64. XML:DB Initiative, http://xmldb-org.sourceforge.net/. XUpdate - XML Update Language, September 2000.
65. Carlo Zaniolo. A unified semantics for active and deductive databases. In N. W. Paton and M. W. Williams, editors, Proceedings of the 1st International Workshop on Rules in Database Systems, Workshops in Computing, pages 271-287. Springer-Verlag, 1994. ISBN 3-540-19846-6.