Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
AbstractA workflow is an automation of a process, inwhich participants (people or programs) are involved inactivities for solving a set of tasks according to certainrules and constraints in order to attain a common goal.The concept of workflow appeared in business informatics.Currently the workflow techniques are used in manyother fields such as medical informatics, bioinformatics,automation of scientific research, computer-aided designand manufacturing, etc. An ontology is a formal description(in terms of concepts, entities, their properties and relationships)of knowledge for solving a given class of problems.In particular, ontologies can be used in problems relatedto workflows. In this paper, we introduce a formalismthat extends the language of the interval Allen’s logic,and show how this formalism can be applied to specifytemporal knowledge in ontologies for workflows. For theextended Allen’s logic, we construct a deduction systembased on the analytic tableaux method. We also show (byexamples) how to apply the deduction method to queryanswering over ontologies written in the extended Allen’slogic.
Open Computer Science – de Gruyter
Published: Jan 1, 2016
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.