Relevant bibliographies by topics / Executability

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers
  5. Reports

Academic literature on the topic 'Executability'

Author: Grafiati
Published: 5 June 2025
Last updated: 25 June 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Executability.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Executability"

1

Lorenz, Robert, Gabriel Juhás, Robin Bergenthum, Jörg Desel, and Sebastian Mauser. "Executability of scenarios in Petri nets." Theoretical Computer Science 410, no. 12-13 (2009): 1190–216. http://dx.doi.org/10.1016/j.tcs.2008.11.014.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ishida, Toru. "Analyzing Parallel Executability of Production Systems." Systems and Computers in Japan 20, no. 3 (2007): 85–97. http://dx.doi.org/10.1002/scj.4690200309.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ghosh, Satrajit S., Jean-Baptiste Poline, David B. Keator, et al. "A very simple, re-executable neuroimaging publication." F1000Research 6 (February 10, 2017): 124. http://dx.doi.org/10.12688/f1000research.10783.1.

Full text
Abstract:
Reproducible research is a key element of the scientific process. Re-executability of neuroimaging workflows that lead to the conclusions arrived at in the literature has not yet been sufficiently addressed and adopted by the neuroimaging community. In this paper, we document a set of procedures, which include supplemental additions to a manuscript, that unambiguously define the data, workflow, execution environment and results of a neuroimaging analysis, in order to generate a verifiable re-executable publication. Re-executability provides a starting point for examination of the generalizability and reproducibility of a given finding.
APA, Harvard, Vancouver, ISO, and other styles
4

Ghosh, Satrajit S., Jean-Baptiste Poline, David B. Keator, et al. "A very simple, re-executable neuroimaging publication." F1000Research 6 (June 15, 2017): 124. http://dx.doi.org/10.12688/f1000research.10783.2.

Full text
Abstract:
Reproducible research is a key element of the scientific process. Re-executability of neuroimaging workflows that lead to the conclusions arrived at in the literature has not yet been sufficiently addressed and adopted by the neuroimaging community. In this paper, we document a set of procedures, which include supplemental additions to a manuscript, that unambiguously define the data, workflow, execution environment and results of a neuroimaging analysis, in order to generate a verifiable re-executable publication. Re-executability provides a starting point for examination of the generalizability and reproducibility of a given finding.
APA, Harvard, Vancouver, ISO, and other styles
5

Abd El Fattah Ammar, Zakaria. "Smart materials between application difficulties and Executability." Arts and Architecture Journal 4, no. 1 (2023): 208–21. http://dx.doi.org/10.21608/aaj.2024.259047.1050.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kluge-Wilkes, Aline, Presley Demuner Reverdito, Stefanus Kohar, Amon Göppert, and Robert H. Schmitt. "Evaluating task executability of mobile robots with performance maps." Procedia CIRP 127 (2024): 38–43. http://dx.doi.org/10.1016/j.procir.2024.07.008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Baluda, Mauro, Pietro Braione, Giovanni Denaro, and Mauro Pezzè. "Enhancing structural software coverage by incrementally computing branch executability." Software Quality Journal 19, no. 4 (2011): 725–51. http://dx.doi.org/10.1007/s11219-011-9150-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Shi, Sheng Hui, Qun Xiong Zhu, and Zhi Qiang Geng. "Executable Program Slicing." Applied Mechanics and Materials 182-183 (June 2012): 1746–50. http://dx.doi.org/10.4028/www.scientific.net/amm.182-183.1746.

Full text
Abstract:
With the complexity of language structure, the problem of slice’s executability has gradually become people’s focus of attention. The research combines program slicing and path coverage according to their features, makes an attempt to propose the model of executable program slicing, and presents the executable slicing algorithm, which plays an important role in the automation of software analysis.
APA, Harvard, Vancouver, ISO, and other styles
9

Olz, Conny, and Pascal Bercher. "Eliminating Redundant Actions in Partially Ordered Plans — A Complexity Analysis." Proceedings of the International Conference on Automated Planning and Scheduling 29 (May 25, 2021): 310–19. http://dx.doi.org/10.1609/icaps.v29i1.3493.

Full text
Abstract:
In this paper we study the computational complexity of postoptimizing partially ordered plans, i.e., we investigate the problem that is concerned with detecting and deleting unnecessary actions. For totally ordered plans it can easily be tested in polynomial time whether a single action can be removed without violating executability. Identifying an executable subplan, i.e., asking whether k plan steps can be removed, is known to be NP-complete. We investigate the same questions for partially ordered input plans, as they are created by many search algorithms or used by real-world applications – in particular time-critical ones that exploit parallelism of non-conflicting actions. More formally, we investigate the computational complexity of removing an action from a partially ordered solution plan in which every linearization is a solution in the classical sense while allowing ordering insertions afterwards to repair arising executability issues. It turns out that this problem is NP-complete – even if just a single action is removed – and thereby show that this reasoning task is harder than for totally ordered plans. Moreover, we identify the structural properties responsible for this hardness by providing a fixed-parameter tractability (FPT) result.
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Xueteng, Jiandong Wang, Mengyao Wei, and Yang Yue. "Entropy-Based Stochastic Optimization of Multi-Energy Systems in Gas-to-Methanol Processes Subject to Modeling Uncertainties." Entropy 27, no. 1 (2025): 52. https://doi.org/10.3390/e27010052.

Full text
Abstract:
In gas-to-methanol processes, optimizing multi-energy systems is a critical challenge toward efficient energy allocation. This paper proposes an entropy-based stochastic optimization method for a multi-energy system in a gas-to-methanol process, aiming to achieve optimal allocation of gas, steam, and electricity to ensure executability under modeling uncertainties. First, mechanistic models are developed for major chemical equipments, including the desulfurization, steam boilers, air separation, and syngas compressors. Structural errors in these models under varying operating conditions result in noticeable model uncertainties. Second, Bayesian estimation theory and the Markov Chain Monte Carlo approach are employed to analyze the differences between historical data and model predictions under varying operating conditions, thereby quantifying modeling uncertainties. Finally, subject to constraints in the model uncertainties, equipment capacities, and energy balance, a multi-objective stochastic optimization model is formulated to minimize gas loss, steam loss, and operating costs. The entropy weight approach is then applied to filter the Pareto front solution set, selecting a final optimal solution with minimal subjectivity and preferences. Case studies using Aspen Hysys-based simulations show that optimization solutions considering model uncertainties outperform the counterparts from a standard deterministic optimization in terms of executability.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Executability"

1

West, Margaret Mary. "Issues in validation and executability of formal specifications in the Z notation." Thesis, University of Leeds, 2002. http://etheses.whiterose.ac.uk/1305/.

Full text
Abstract:
The work considers issues in the execution of the Z notation in a logic programming language. A subset of Z which is capable of being animated is identified, together with the necessary theoretical foundations for the relationship of Z to its executable form. The thesis also addresses the transition from research results to potentially useful tools. The thesis has 4 major parts: Tools Survey: A survey of tools which support the animation of Z is presented and the advantages (and disadvantages) to be gained from an animating system which uses a logic programming language are discussed. Requirements, particularly correctness, are described and discussed and weaknesses in the current tools are identified. Correctness - Program Synthesis: If a program can be deduced directly from the specification, then it is partially correct with respect to the specification. This method of obtaining a program from a specification is one form of logic programming synthesis. We examine such formal links between a specification (in Z) and an executable form and also some translation techniques for synthesising a logic program from a Z specification. The techniques are illustrated by examples which reveal important shortcomings. Translation Rules to Godel: New techniques for the animation of Z utilising the Godel logic programming language are presented which circumvent these shortcomings. The techniques are realised via translation rules known as structure simulation . Two substantial case studies are examined as proof of concept. These indicate both the coverage of the Z notation by structure simulation and the practicality of the rules. Correctness - Abstract Approximation: Published criteria for correctness of an animation are compared and contrasted with the method of Abstract Interpretation (AI). In AI a concrete semantics is related to an approximate one that explicitly exhibits an underlying structure present in the richer concrete structure. In our case, the concrete semantics is Z associated with ZF set theory . The approximate semantics of the execution are the outputs of Z. The criteria are applied to a logic programming language (the original w as applied to a functional language). Formal arguments are presented which show that the structure simulation rules obey the criteria for correctness. Finally, areas of work which had been omitted by the original authors are presented explicitly.
APA, Harvard, Vancouver, ISO, and other styles
2

HUANG, YUAN-TING, and 黃源庭. "The Demand and Executability of ISO 50001 Verification System in Various Industries." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/z9m832.

Full text
Abstract:
碩士<br>國立臺中教育大學<br>科學教育與應用學系環境教育及管理碩士班<br>107<br>Since the Industrial Revolution, greenhouse gas has been accumulating in the atmosphere, resulting in global warming and frequent extreme climate that imposed serious threat on the living environment of humans. The UN established the UN Intergovernmental Panel on Climate Change to persuade countries into signing Paris Agreement, regulating the use of energy and greenhouse gas emission by countries and enterprises all over the world. As an export-oriented economy with limited resources, Taiwan must immediately respond to the challenges caused by the potential requirements of importers that export products be produced with efficient or renewable energy. The industry should attach importance to the international trend of environmental protection and energy conservation by monitoring and reducing greenhouse gas emission, managing supply chain in a low-carbon manner and decarbonizing the supply chain, and building a complete energy system in line with international standard. Against this backdrop, this study uses the items of ISO 50001 to formulate survey questionnaires, and intends to verify whether the internal energy efficiency of enterprises imported by ISO 50001 can be improved, and whether the energy consumption and cost of enterprises can be reduced to live up fulfill the green commitment of energy conservation and carbon reduction. This study intends to adopt the indicators of the ISO 50001 management system to illustrate the importance and feasibility of the four major industries in Taiwan. Firstly, survey questionnaires reviewed by experts were formulated according to the indicators of the ISO 50001 management system, and a questionnaire survey was conducted through on four major industries: light industry, heavy industry, high-tech industry and service industry. A total of 740 questionnaires were sent out, 276 of which collected and 263 were valid ones, with a recovery rate of valid questionnaire up to 35.5% and the Cronbach α for 0.983. The main objectives of this study are as follows: (1) To understand the application of the indicators of the ISO 50001 management system to Taiwanese enterprises, including their importance and feasibility. (2) To understand the differences of the adaptability of the four industries to the ISO 50001. (3) To use IPA analysis method to understand what indicators of the energy management system should be prioritized and what should be suspended in different industries? The necessity of energy certification in light industry, heavy industry, high-tech industry and service industry is discussed, and the difficulty of imposing energy certification on enterprises is explored. Questionnaire survey method is adopted to understand and analyze the importance and feasibility of each dimension and item when ISO 50001 is imposed on enterprises for energy certification. The importance and feasibility of the major dimensions of ISO 50001 are summarized in a chart, and interview method is used to understand the results analysis of energy certification. According to the ISO 50001 evaluation, there are seven aspects for the analysis of importance and feasibility. It is found that "management responsibility" gets the highest score of 4.50 for the importance of overall evaluation, followed by "general requirements" for 4.28, "management review" for 4.21 and "implementation and operation" for 3.97, the dimension with the lowest score. Nearly all these dimensions go beyond the satisfaction degree. In the overall evaluation of feasibility, "energy policy" gets the highest score of 3.16, followed by "management review" of 3.04, "general requirements" of 3.01 and "implementation and operation" of 2.75, the dimension with the lowest score. These dimensions mostly fall around the normal degree. The feasibility of the dimension of ISO 50001 is still facing difficulty. According to IPA analysis, "general requirements", "management responsibility" and "management review" score the highest in terms of the feasibility of seven dimensions. They all fall in the first quadrant and are indicators that should be prioritized for implementation; the two indicators of "energy planning" and "implementation and operation" fall in the third quadrant, which should not be prioritized for implementation. If the items of dimensions of each industry are distributed in the first quadrant, enterprises can give priority to these items, including item 1 of “general requirements”, items 1 and 3 of “management responsibility”, items 2, 3 and 4 of “energy policy”, items 3, 4 and 6 of “energy planning”, items 2, 6 and 12 of “performance evaluation” and items 1, 2 and 3 of “management review”. If the items of dimensions of each industry are distributed in the third quadrant, enterprises can suspend the implementation of these items, including items 10, 11, 12, 14 of “energy planning”, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11 of “implementation and operation”, and 3, 4 of “performance evaluation”.
APA, Harvard, Vancouver, ISO, and other styles
3

Chiu, Tzu-Hao, and 邱子豪. "The Research on the Acquaintance and Executability of Green Wedding Reception in Terms of Wedding Potential Consumers and Suppliers." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/g875g7.

Full text
Abstract:
碩士<br>國立中興大學<br>景觀與遊憩碩士學位學程<br>101<br>Environmental Protection Administration (EPA) in 2012 promoted “a hundred- year couples of low-carbon wedding activity” to raise the citizen’s, wedding suppliers’, catering traders’, and wedding adviser companies’ cognitions toward the low-carbon wedding started in the wedding waves of Centennial. To encourage the newly weds to elaborate creations, the government prepares a low-carbon wedding guidebook for the healthy and environmental low-carbon wedding. Recently, some newly weds also incorporated environmental protection, social care and green consumption into the wedding. 　　According to some researches, the largest amount of spending money in operating wedding process is the wedding reception (Zhou, 2008). The wedding reception has a great significance for Chinese on the traditional concepts. It become especially important for the newly wed’s parents to compare the wealth and magnificence (Liu, 2000). Nontheless, many creative thoughts have been gradually influenced by the time changes and environmental consciousness. Thus, the purpose of this study is to discuss the wedding consumers and wedding suppliers toward the conceptual cognitions and performing recognitions of “green wedding receptions”. 　　This study develops the questions from the low-carbon wedding guidebook published by EPA, and then chooses nine wedding suppliers to have a deep interview, at the same time produces a questionnaire to survey the latent wedding consumers. The study shows that only part of wedding reception suppliers have cognitions about the green wedding reception. However, if the government can promote the concept powerfully, provide the performing plan and the consumers are willing to support the green wedding reception, the suppliers will have a highly performing recognition. Also, through our survey shows that the actual and most important descision makers of the wedding consuming place are newly weds’ parents, and the newly couples come in second. Therefore, the concept of green wedding reception should be greatly promulgated to the newly weds’ parents. The latent consumers feel highly cognitions and recognitions to the partial content of implementing the guided green wedding receptions, but they cannot be fully carry out in the implementation. It is said the reason may be the civil wedding reception suppliers cannot provide the supporting green wedding reception for consumers to choose. 　　Although vegetable food can lower the carbon emission, through the research studies, we can know that green wedding reception is not a vegetarian diet but a focus on the productions of food origin, the growing quality, and cooking ways to lower the impact toward the environment. To strength the call for the healthy diet for the modern people and attain the supply and demand balancing protection for the earth and eco-environment, the green wedding reception will be accepted and carried out by the public.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Executability"

1

Cerexhe, Timothy, and Maurice Pagnucco. "Executability in the Situation Calculus." In AI 2011: Advances in Artificial Intelligence. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25832-9_69.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rasconi, Riccardo, Nicola Policella, and Amedeo Cesta. "SEaM: Analyzing Schedule Executability Through Simulation." In Advances in Applied Artificial Intelligence. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11779568_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Luttik, Bas, and Fei Yang. "On the Executability of Interactive Computation." In Pursuit of the Universal. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40189-8_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Muller, Pierre-Alain, Franck Fleurey, and Jean-Marc Jézéquel. "Weaving Executability into Object-Oriented Meta-languages." In Model Driven Engineering Languages and Systems. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11557432_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hussain, Sardar, Richard O. Sinnott, and Ron Poet. "Service-Oriented Workflow Executability from a Security Perspective." In Security, Privacy, and Anonymity in Computation, Communication, and Storage. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-49148-6_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Navarre, David, Philippe Palanque, Rémi Bastide, and Ousmane Sy. "Structuring Interactive Systems Specifications for Executability and Prototypability." In Interactive Systems Design, Specification, and Verification. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44675-3_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tanaka, Masahiro, and Toru Ishida. "Predicting and Learning Executability of Composite Web Services." In Service-Oriented Computing – ICSOC 2007. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89652-4_48.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yao, Yuan, Lavindra de Silva, and Brian Logan. "Reasoning About the Executability of Goal-Plan Trees." In Engineering Multi-Agent Systems. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-50983-9_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Stoyenko, Alexander D., and Wolfgang A. Halang. "Analysing PEARL Programs for Timely Schedulability and Executability." In Prozeßrechensysteme ’91. Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-76501-8_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

von der Beeck, Michael. "Improving Structured Analysis — Achieving Preciseness, Executability, and Real-Time Specification." In Berichte des German Chapter of the ACM. Vieweg+Teubner Verlag, 1993. http://dx.doi.org/10.1007/978-3-322-94703-1_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Executability"

1

Bradford, Robert W., and Denise Harrison. "Execution and executability." In SPIE Optical Engineering + Applications, edited by Mark A. Kahan. SPIE, 2015. http://dx.doi.org/10.1117/12.2196251.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Greer, Donald R., Laura J. Black, Suellen Eslinger, Daniel X. Houston, and Richard J. Adams. "Assessing executability in large complex programs." In 2009 IEEE Aerospace conference. IEEE, 2009. http://dx.doi.org/10.1109/aero.2009.4839718.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Barbier, Franck, and Eric Cariou. "Component Design based on Model Executability." In 2008 34th Euromicro Conference Software Engineering and Advanced Applications (SEAA). IEEE, 2008. http://dx.doi.org/10.1109/seaa.2008.16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Breton, Erwan, and Jean Bézivin. "Towards an understanding of model executability." In the international conference. ACM Press, 2001. http://dx.doi.org/10.1145/505168.505176.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Planas, Elena, Jordi Cabot, Cristina Gomez, Esther Guerra, and Juan de Lara. "Lightweight Executability Analysis of Graph Transformation Rules." In 2010 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC). IEEE, 2010. http://dx.doi.org/10.1109/vlhcc.2010.26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Giunchiglia, Eleonora, Michele Colledanchise, Lorenzo Natale, and Armando Tacchella. "Conditional Behavior Trees: Definition, Executability, and Applications." In 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC). IEEE, 2019. http://dx.doi.org/10.1109/smc.2019.8914358.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mirhosseini, Samim, and Chris Parnin. "Docable: evaluating the executability of software tutorials." In ESEC/FSE '20: 28th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering. ACM, 2020. http://dx.doi.org/10.1145/3368089.3409706.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gong, Ping, Jian Min Jiang, Shi Zhang, and Zhi Qin Chen. "Executability Analysis for Semantically Annotated Process Model." In 2012 IEEE Asia-Pacific Services Computing Conference (APSCC). IEEE, 2012. http://dx.doi.org/10.1109/apscc.2012.25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Islam, Md Anaytul, Muhammad Asaduzzman, and Shaowei Wang. "On the Executability of R Markdown Files." In MSR '24: 21st International Conference on Mining Software Repositories. ACM, 2024. http://dx.doi.org/10.1145/3643991.3644931.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bourgeois, Julien, Vaidy Sunderam, Jaroslaw Slawinski, and Bogdan Cornea. "Extending Executability of Applications on Varied Target Platforms." In Communication (HPCC). IEEE, 2011. http://dx.doi.org/10.1109/hpcc.2011.41.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Executability"

1

Doerr, Jeremy, Conrad Bock, and Raphael Barbau. Verifying Executability of SysML Behavior Models Using Alloy Analyzere. National Institute of Standards and Technology, 2022. http://dx.doi.org/10.6028/nist.ir.8388.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bock, Conrad. Verifying Executability of SysML Behavior Models Using Alloy Analyzer. National Institute of Standards and Technology, 2024. http://dx.doi.org/10.6028/nist.ir.8388-upd1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Barbau, Raphael, and Conrad Bock. Verifying executability of SysML behavior models using satisfiability modulo theory solvers. National Institute of Standards and Technology, 2020. http://dx.doi.org/10.6028/nist.ir.8283.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Baader, Franz, Carsten Lutz, Maja Miličić, Ulrike Sattler, and Frank Wolter. Integrating Description Logics and Action Formalisms for Reasoning about Web Services. Aachen University of Technology, 2004. http://dx.doi.org/10.25368/2022.145.

Full text
Abstract:
Motivated by the need for semantically well-founded and algorithmically managable formalism that is based on description logics (DLs), but is also firmly grounded on research in the reasoning about action community. Our main contribution is an analysis of how the choice of the DL influences the complexity of standard reasoning tasks such as projection and executability, which are important for Web service discovery and composition.
APA, Harvard, Vancouver, ISO, and other styles
5

Baader, Franz, Carsten Lutz, Maja Miličić, and Frank Wolter. Integrating Description Logics and Action Formalisms for Reasoning about Web Services. Technische Universität Dresden, 2005. http://dx.doi.org/10.25368/2010.145.

Full text
Abstract:
Motivated by the need for semantically well-founded and algorithmically managable formalism that is based on description logics (DLs), but is also firmly grounded on research in the reasoning about action community. Our main contribution is an analysis of how the choice of the DL influences the complexity of standard reasoning tasks such as projection and executability, which are important for Web service discovery and composition.
APA, Harvard, Vancouver, ISO, and other styles
6

Koopmann, Patrick. Actions with Conjunctive Queries: Projection, Conflict Detection and Verification. Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.243.

Full text
Abstract:
Description Logic actions specify adaptations of description logic interpretations based on some preconditions defined using a description logic. We consider DL actions in which preconditions can be specified using DL axioms as well as using conjunctive queries, and combinatiosn thereof. We investigate complexity bounds for the executability and the projection problem for these actions, which respectively ask whether an action can be executed on models of an interpretation, and which entailments are satisfied after an action has been executed on this model. In addition, we consider a set of new reasoning tasks concerned with conflicts and interactions that may arise if two action are executed at the same time. Since these problems have not been investigated before for Description Logic actions, we investigate the complexity of these tasks both for actions with conjunctive queries and without those. Finally, we consider the verification problem for Golog programs formulated over our famility of actions. Our complexity analysis considers several expressive DLs, and we provide tight complexity bounds for those for which the exact complexity of conjunctive query entailment is known.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Executability' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography