Odnośniki

References

  • [Amb03] Ambroszkiewicz, S. enTish: An Approach to service Description and Composition. ICS PAS, Ordona 21, 01-237 Warsaw, 2003.
  • [Apa11] http://ode.apache.org, 2011.
  • [BCC+99] Biere, A., Cimatti, A., Clarke, E., Fujita, M., Zhu, Y. Symbolic Model Checking Using SAT Procedures Instead of BDDs. In Proc. of the ACM/IEEE Design Automation Conference (DAC), 317-320, 1999.
  • [Bell08] M. Bell. Introduction to Service-Oriented Modeling. John Wiley & Sons, 2008.
  • [BFu97] Blum, A., Furst, M. L. Fast planning through planning graph analysis. In Journal of Artificial Intelligence, Vol. 90, pp 281–300, 1997.
  • [BLa99] Blum, A., Langford, J. Probabilistic planning in the graphplan framework. In Proc. Of the 5th European Conference on Planning, LNCS, Vol. 1809, pp 319–332, Springer, ISBN 3-540-67866-2, 1999.
  • [BGe01] Bonet, B., Geffner, H. Planning as heuristic search. Artificial Intelligence, 129(1–2):5–33, 2001.
  • [BKZ+05] S. Bahadori, S. Kafi, K. Zamani far, M. R. Khayyambashi. Optimal Web Service Composition Using Hybrid GA-Tabu Search, Journal of Theoretical and Applied Information Technology, pp.10-15, 2005.
  • [Bry86] Bryant, R. E. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677–691, 1986.
  • [CDP+05] Canfora, G., Di Penta, M., Esposito, R.et al. An approach for QoS-aware service composition based on genetic algorithms. In Genetic and Evolutionary Computation Conference (GECCO), vol. 1, Washington DC, USA, pp.1069–1075, 2005,
  • [Daml03] DAML-S (and OWL-S) 0.9 draft release. http://www.daml.org/services/daml-s/0.9/, 2003.
  • [DHJ+10] D. Doliwa, W. Horzelski, M. Jarocki, A. Niewiadomski, W. Penczek, A. Polrola, M. Szreter, A. Zbrzezny, Web Service Composition Toolset,In Proc. of the Concurrency, Specification and Programming (CS&P’2010), Informatik-Berichte 237(1), pp. 131-141, Humboldt University, Berlin, 2010.
  • [EHe00] Edelkamp, S., Helmert, M. The implementation of Mips. (2000).
  • [ESo04] Een, N., Sorensson, N. An Extensible SAT-solver, In Proc. of 6th International Conference on Theory and Applications of Satisfiability Testing, 502-518, LNCS 2919, Springer-Verlag, 2004.
  • [Fis00] Fissgus, U. Scheduling using genetic algorithms. In Proceedings of 20th IEEE International Conference on Distributed Computing Systems, pp. 662-669, 2000.
  • [GPB03] Glass, C. A., Prügel-Bennett, A. Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao’s Algorithm, Journal of Combinatorial Optimization, Vol. 7, Number 3, pp.229-236, 2003.
  • [GSe02] Gerevini, A., Serina, I. LPG: A planner based on local search for planning graphs with action costs. In AIPS, pages 13–22, 2002.
  • [GSS06] Gerevini, A., Saetti, A., Serina, I. An approach to temporal planning and scheduling in domains with predictable exogenous events. J. Artif. Int. Res., 25 (1):187–231, ISSN 1076-9757, 2006.
  • [HSt00] Hoelldobler, S., Stoerr, H.-P. Solving the entailment problem in the fluent calculus using binary decision diagrams. In Workshop on Model Theoretic Approaches to Planning at AIPS2000. Beckenridge, 2000.
  • [JNP+10a] M. Jarocki, A. Niewiadomski, W. Penczek, A. Polrola, M. Szreter, Towards Automatic Composition of Web Services: Abstract Planning Phase, SOA Infrastructure Tools. Concepts and Methods. Poznan University of Economics Press, pp. 181-210, ISBN 978-83-7417-544-9, 2010.
  • [JNP+10b] Jarocki, A. Niewiadomski, W. Penczek, A. Polrola, M. Szreter, A Formal Approach to Composing Abstract Scenarios of Web Services, Intelligent Information Systems, ISBN 978-83-7051-580-5, pp. 3–22, 2010.
  • [Joh07] Johnson C. G., Genetic Programming with Fitness Based on Model Checking, LNCS Vol. 4445/2007, pp. 114-124, Springer, 2007.
  • [JVe00] Jensen, R., Veloso, M. M. OBDD-based universal planning for synchronized agents in non-deterministic domains. Journal of Artificial Intelligence Research, 13:189–226, 2000.
  • [KGS05] Klusch, A. Geber, M. Schmidt. Semantic web service composition planning with OWLS-XPlan. In Proc. of the 1st Int. AAAI Fall Symposium on Agents and the Semantic Web, number FS-05-01. AAAI Press, 2005.
  • [KLN+06] M. Kacprzak, A. Lomuscio, A. Niewiadomski, M. Szreter, W. Penczek, F. Raimondi. Comparing BDD and SAT based techniques for model checking Chaum’s Dining Cryptographers Protocol, Fundamenta Informaticae Vol 72(1-3), str. 215 – 234, 2006.
  • [KNN+08] M. Kacprzak, W. Nabialek, A. Niewiadomski, W. Penczek, A. Polrola, M. Szreter, B. Wozna, A. Zbrzezny. VerICS 2007 – a Model Checker for Knowledge and Real-Time, Fundamenta Informaticae 85 (1-4) 2008, pp. 313-328
  • [KNP+10] M. Knapik, A. Niewiadomski, W. Penczek, A. Pólrola, M. Szreter, A. Zbrzezny, Parametric Model Checking with VerICS, Transactions on Petri Nets and Other Models of Concurrency IV. LNCS 6550/2010, pp. 98-120, Springer, ISBN 978-3-642-18221-1, 2010.
  • [Koz03] Koza, J. R., Human-competitive applications of genetic programming. Advances in Evolutionary Computing: Theory and Applications, pp. 663–682, Springer, 2003.
  • [KPe05] M. Kacprzak, W. Penczek. Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic, Autonomous Agents and Multi-Agent Systems, Springer Science+Business Media B.V., Formerly Kluwer Academic Publishers B.V, Vol.11(1), str. 69 – 89, 2005.
  • [KPe08] Katz G., Peled D., Model Checking-Based Genetic Programming with an Application to Mutual Exclusion, in Proceedings of TACAS’2008. pp.141-156, 2008.
  • [KPe11] Katz G., Peled D., Synthesizing Solutions to the Leader Election Problem using Model Checking and Genetic Programming, LNCS, Vol. 6405/2011, pp. 117-132, Springer, 2011.
  • [KPS+10] Knapik, M., Penczek, W., Szreter, M., Półrola, A. Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics. Fundamenta Informaticae (101): 9-27, 2010
  • [KSe92] Kautz, H. and Selman, B. Planning as satisfiability. In ECAI ’92: Proceedings of the 10th European conference on Artificial intelligence, pages 359–363. John Wiley & Sons, Inc., 1992.
  • [KSe98] Kautz, H., Selman, B. Blackbox: A new approach to the application of theorem proving to problem solving.
  • [LJB+03] Z. Liang-Jie, L.Bing, C. Tian, et al. On demand web services-based business process composition. In IEEE International Conference on System, Man, and Cybernetics (SMC’03), Washington, USA, pp. 4057–4064, 2003.
  • [MGH+98] McDermott, D., Ghallab, M., Howe, A., Knoblock, C., Ram, A., Veloso, M., Weld, D., Wilkins, D. PDDL- the Planning Domain Definition Language – version 1.2. Technical Report TR-98-003, Yale Center for Computational Vision and Control, 1998.
  • [NOT06] Nieuwenhuis, R., Oliveras, A., Tinelli, C. Solving SAT and SAT Modulo Theories: From an abstract Davis–Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM 53, 6, 937-977, 2006.
  • [NPP+10] A. Niewiadomski, W. Penczek, A. Polrola, M. Szreter, and A. Zbrzezny, Towards Automatic Composition of Web Services: SAT-Based Concretisation of Abstract Scenarios, In Proc. of the Concurrency, Specification and Programming (CS&P’2010), Informatik-Berichte 237(2), pp. 231-242, Humboldt University, Berlin, 2010.
  • [NPS09] A. Niewiadomski, W. Penczek, and M. Szreter, A new approach to model checking of UML state machines, Fundamenta Informaticae, 93 (1-3) 2009, pp. 289-303
  • [NPS10] A. Niewiadomski, W. Penczek, and M. Szreter, Towards Checking Parametric Reachability for UML State Machines, Perspectives of Systems Informatics, LNCS 5947/2010, pp. 319-330, Springer, 2010
  • [PBK10] Protopapas M. K., Battaglia F., Kosmatopoulos E. B., Coevolutionary Genetic Algorithms for Establishing Nash Equilibrium in Symmetric Cournot Games, In Advances in Decision Sciences, pp. 1-18, 2010.
  • [PDa07] Pipatsrisawat, K., Darwiche, A. RSat 2.0: SAT Solver Description. Technical Report D-153, Automated Reasoning Group, Computer Science Department, UCLA, 2007.
  • [PFo02] S. R. Ponnekanti, A. Fox. SWORD: A developer toolkit for web service composition. In Proc. of the 11st Int. World Wide Web Conference (WWW’02), pages 83–107, 2002.
  • [PPo06] W. Penczek, A. Półrola. Advances in Verification of Time Petri Nets and Timed Automata. A Temporal Logic Approach. Series: Studies in Computational Intelligence, Springer-Verlag, Vol. 20, XXXII, 257 pages, 124 illustrations, 2006.
  • [Rao04] J. Rao. Semantic Web Service Composition via Logic-Based Program Synthesis. PhD thesis, Dept. of Comp. and Inf. Sci., Norwegian University of Science and Technology, 2004.
  • [Rdf04] Resource Description Framework: Concepts and Abstract Syntax. http://www.w3.org/TR/2004/REC-rdf-concepts-20040210/ , 2004.
  • [RIP07] D. Redavid, L. Iannone, T. Payne. OWL-S atomic services composition with SWRL rules. In Proc. of the 4th Italian Semantic Web Workshop: Semantic Web Applications and Perspectives (SWAP 2007), 2007.
  • [RKM04] J. Rao, P. Küngas, M. Matskin. Logic-based web services composition: From service description to process model. In Proc. of the IEEE Int. Conf. on Web Services (ICWS’04), pages 599–608. IEEE Computer Society, 2004.
  • [RSu04] J. Rao, X. Su. A survey of automated web service composition methods. In Proc. of the 1st Int. Workshop on Semantic Web Services and Web Process Composition (SWSWPC 2004), pages
  • 43–54, 2004.
  • [SHP03] Sirin, E., Hendler, J., Parsia, B. Semi-automatic compositions of web services using semantic description. In Proc. of the Int. Workshop ’Web Services: Modeling, Architecture and Infrastructure’ (ICEIS), 93–123, 2003.
  • [SJF03] Sheshagiri, M., desJardins, M., and Finin, T. A Planner for Composing Service Described in DAML-S. In Workshop on Planning for Web Services, International Conference on Automated Planning and Scheduling, 2003
  • [SKo03] B. Srivastava, J. Koehler. Web service composition – current solutions and open problems. In Proc. of Int. Workshop on Planning for Web Services (at ICAPS 2003), pages 28–35, 2003.
  • [SND+10] Skaruz J., Nowacki J. P., Drabik A., Seredynski F., Bouvry P., Soft Computing Techniques for Intrusion Detection of SQL-based Attacks, The 2nd Asian Conference on Intelligent Information and Database Systems, Vietnam, 2010, Springer, LNCS, Vol. 5990/2010, pp. 33-42
  • [Soap07] SOAP version 1.2. http://www.w3.org/TR/soap, 2007.
  • [SS07] Skaruz J., Seredyński F., Recurrent neural networks towards detection of SQL attacks, In the proceedings of IEEE International Parallel & Distributed Processing Symposium – NIDISC workshop, 2007
  • [SS07a] Skaruz J, Seredyński F., Recurrent neural networks on duty of anomaly detection in databases. In Advances in Neural Networks – ISSN 2007, Springer LNCS Vol. 4493, pp. 85-94, 2007.
  • [SS07b] Skaruz J., Seredyński F., Recurrent Neural Networks in the Context of SQL Attacks, Annales UMCS, Section AI Informatica Vol. VI, pp. 37-48, 2007.
  • [SS07c] Skaruz J., Seredyński F., Preventing SQL Attacks via Neural Networks, Polish Journal of Environmental Studies Vol. 16, No. 4A, pp. 295-299, 2007.
  • [SS08] Skaruz J., Seredynski F., Some Issues on Intrusion Detection in Web Application, The Eighth International Conference on Artificial Intelligence and Soft Computing, Springer, LNAI Vol. 5097, 2008
  • [SS09] Skaruz J., Seredyński F., Anomaly Detection In Web Applications Using Gene Expression Programming, In the Proceedings of Intelligent Information Systems, Cracow, 2009, pp. 1-10
  • [SS09a] Skaruz J., Seredyński F., Web Application Security Through Gene Expression Programming, EvoCOMNET Workshop: Telecommunication networks and other Parallel and Distributed Systems, Springer, LNCS Vol. 5489,, Germany, 2009, pp. 1-10
  • [SS09b] Skaruz J., Seredynski F., Detecting Web Application Attacks With Use of Gene Expression Programming. In the Proceedings of IEEE Congres on Evolutionary Computation, pp. 2029-2035, Norway, 2009.
  • [SSG05] Skaruz J., Seredyński F., Gamus M., Nature-inspired algorithms for the TSP. In the Proceedings of Intelligent Information Processing and Web Mining, Advances in Soft Computing, pp.319-329, Springer, 2005.
  • [SSP07] Skaruz J., Seredyński F., Bouvry P., Recurrent Neural Networks Approach to the Detection of SQL Attacks, In the proceedings of 9th International Conference on Enterprise Information Systems – ICEIS, Portugal, pp. 191-198, 2007.
  • [SSP08] Skaruz J, Seredynski F., Bouvry P., Tracing SQL Attacks via Neural Networks, Parallel Processing and Applied Mathematics, Springer, LNCS Vol. 4967, 2008
  • [Uddi05] Universal Description, Discovery and Integration v3.0.2 (UDDI). http://www.oasis-open.org/committees/uddi-spec /doc/spec/v3/uddi-v3.0.2-20041019.htm, 2005.
  • [Wsbp07] Web Services Business Process Execution Language v2.0. http://docs.oasis-open.org/wsbpel/2.0/OS/wsbpel-v2.0-OS.html, 2007.
  • [Wsdl01] Web Services Description Language (WSDL) 1.1. http://www.w3.org/TR/2001/NOTE-
  • wsdl-20010315, 2001.
  • [Wsmo04] Web Service Modelling Ontology. http://www.wsmo.org/2004/d2/v1.0/ , 2004.