#### DMCA

## Integrating description logics and action formalisms: First results (2005)

### Cached

### Download Links

- [lat.inf.tu-dresden.de]
- [www.csc.liv.ac.uk]
- [www.aaai.org]
- [www.aaai.org]
- [lat.inf.tu-dresden.de]
- [www.cs.man.ac.uk]
- [lat.inf.tu-dresden.de]
- [www.informatik.uni-bremen.de]
- [www.informatik.uni-bremen.de]
- [www.informatik.uni-bremen.de]
- [www.cs.man.ac.uk]
- [lat.inf.tu-dresden.de]
- [www.computational-logic.org]
- [www.researchgate.net]
- [lat.inf.tu-dresden.de]
- [lat.inf.tu-dresden.de]
- [www.informatik.uni-bremen.de]
- [www.ceur-ws.org]
- [sunsite.informatik.rwth-aachen.de]
- [ceur-ws.org]
- [www.informatik.uni-bremen.de]
- [www.informatik.uni-bremen.de]
- [www.inf.unibz.it]
- [ftp.informatik.rwth-aachen.de]
- [www.inf.unibz.it]
- [lat.inf.tu-dresden.de]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05 |

Citations: | 99 - 25 self |

### Citations

705 | H.: Semantic Web Services
- McIlraith, Son, et al.
- 2001
(Show Context)
Citation Context ... agent) causes changes of the world (see e.g. [28, 34]). Thus, it is not surprising that theories developed in these comunities have been applied in the context of Semantic Web services. For example, =-=[20, 21]-=- use the situation calculus [28] and GOLOG [17] to formalize the dynamic aspects of Web services and to describe their composition. In [31], OWL-S process models are translated into the planning langu... |

628 | GOLOG: a logic programming language for dynamic domains’,
- Levesque, Reiter, et al.
- 1997
(Show Context)
Citation Context ...34]). Thus, it is not surprising that theories developed in these comunities have been applied in the context of Semantic Web services. For example, [20, 21] use the situation calculus [28] and GOLOG =-=[17]-=- to formalize the dynamic aspects of Web services and to describe their composition. In [31], OWL-S process models are translated into the planning language of the HTN planning system SHOP2 [22], whic... |

626 |
The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression.
- Reiter
- 1991
(Show Context)
Citation Context ...Association for Artificial Intelligence (www.aaai.org). All rights reserved. viewed as a fragment of the Situation Calculus and thus inherits SitCalc’s well-established solution of the frame problem (=-=Reiter 1991-=-). Concerning reasoning, we focus on the basic tasks of executability and projection, which are mutually polynomially reducible in our framework. We exhibit a close connection between projection in ou... |

613 | F.: From SHIQ and RDF to OWL: The making of a web ontology language
- Horrocks, Patel-Schneider, et al.
- 2003
(Show Context)
Citation Context ...omplexity of ALCQO with acyclic TBoxes 47 1s1 Introduction Description logics [2] play an important r^ole in the Semantic Web since they are the basis of the W3C-recommended Web ontology language OWL =-=[3, 12]-=-, which can be used to create semantic annotations describing the content of Web pages [33]. In addition to static information, the Web also offers services, which allow their users to effect changes ... |

381 | Adapting Golog for composition of semantic web-services.
- McIlraith, Son
- 2002
(Show Context)
Citation Context ... agent) causes changes of the world (see e.g. [28, 34]). Thus, it is not surprising that theories developed in these comunities have been applied in the context of Semantic Web services. For example, =-=[20, 21]-=- use the situation calculus [28] and GOLOG [17] to formalize the dynamic aspects of Web services and to describe their composition. In [31], OWL-S process models are translated into the planning langu... |

285 |
Reasoning about Action Using a Possible Models Approach. In:
- Winslett
- 1988
(Show Context)
Citation Context ...ive a straightforward semantics as in Definition 2. One possible way to obtain a semantics for actions with complex post-conditons is to adopt the possible models approach (PMA) initially proposed in =-=[18]-=-. The formal definition of such a semantics can be found in [2]. Unfortunately, adopting the PMA semantics results in two problems. The first problem is again of a semantic nature: using complex conce... |

284 | SHOP2: An HTN Planning System
- Nau, Au, et al.
(Show Context)
Citation Context ...GOLOG [17] to formalize the dynamic aspects of Web services and to describe their composition. In [31], OWL-S process models are translated into the planning language of the HTN planning system SHOP2 =-=[22]-=-, which is then used for automatic Web service composition. The approach used in this paper is in a similar vein. We are interested in the faithful description of the changes to the world induced by t... |

272 | Using an expressive description logic: FaCT or fiction
- Horrocks
- 1998
(Show Context)
Citation Context ...ds to semantic problems, while removing the second and third restriction leads to both semantic and computational problems. 4.1 Transitive Roles Transitive roles are offered by most modern DL systems =-=[10, 8]-=-, and also by the ontology languages OWL, DAML+OIL, and OIL [12, 11, 7]. They are added to ALCQIO by reserving a subset of roles NtR of NR such that all r 2 NtR are interpreted as transitive relations... |

267 | Oil: An ontology infrastructure for the semantic web.
- Fensel, Harmelen, et al.
- 2001
(Show Context)
Citation Context ...ction leads to both semantic and computational problems. 4.1 Transitive Roles Transitive roles are offered by most modern DL systems [10, 8], and also by the ontology languages OWL, DAML+OIL, and OIL =-=[12, 11, 7]-=-. They are added to ALCQIO by reserving a subset of roles NtR of NR such that all r 2 NtR are interpreted as transitive relations rI in all models I. We show that admitting the use of transitive roles... |

241 | State constraints revisited
- Lin, Reiter
- 1994
(Show Context)
Citation Context ...primitive concept names and role names. Concerning the (more natural) descriptive semantics, one may try to adopt the approaches developed for dealing with state constraints in the situation calculus =-=[6, 7, 15, 9]-=-. Details are left for future work. We also encounter semantic problems when removing the second restriction. In particular, admitting arbitrary concepts in post-conditions means that we can no longer... |

241 | The computational complexity of provability in systems of modal propositional logic - Ladner - 1977 |

215 | On the complexity of propositional knowledge base revision, updates, and counterfactuals.
- Eiter, Gottlob
- 1992
(Show Context)
Citation Context ... consider simple composite services, which are sequences of atomic services. The semantics of a service is defined using the possible models approach developed in the reasoning about action community =-=[38, 39, 40, 6, 9, 5]-=-, and is fully compatible with the usual DL semantics.. However, we will also show that this semantics can be viewed as an instance of Reiter's approach [27, 25, 16, 28] for taming the situation calcu... |

199 |
Solving the frame problem.
- Shanahan
- 1997
(Show Context)
Citation Context ...-order axioms. We can show that, for actions without occlusions, our approach can be seen as an instance of Reiter’s action formalism. For actions with occlusions, related formalisms can be found in (=-=Shanahan 1997-=-). Suppose an ABox A, an acyclic TBox T , and a composite action α1, . . . , αk are given. First, we can get rid of the TBox by expanding it (i.e., recursively replacing defined concepts with their de... |

196 | Embracing causality in specifying the indirect effects of actions.
- Lin
- 1995
(Show Context)
Citation Context ...primitive concept names and role names. Concerning the (more natural) descriptive semantics, one may try to adopt the approaches developed for dealing with state constraints in the situation calculus =-=[6, 7, 15, 9]-=-. Details are left for future work. We also encounter semantic problems when removing the second restriction. In particular, admitting arbitrary concepts in post-conditions means that we can no longer... |

191 | HTN planning for Web Service composition using SHOP2,” - Sirin, Parsia, et al. - 2004 |

188 | Complexity results and practical algorithms for logics in knowledge representation
- Tobies
- 2001
(Show Context)
Citation Context ...an be done w.l.o.g. since the complexity of unsatisfiability in ALCIO (resp. ALCFIO) is already ExpTime-hard (resp. co-NExpTime-hard) if only a single nominal is available and TBoxes are not admitted =-=[1, 36, 37]-=-. We reserve a concept name O and a role name u that do not occur in C. Let rol(C) := fr; r\Gammasj r 2 NR used in Cg and let C[O=fng] denote the result of replacing the nominal fng in C with the conc... |

184 | Description Logics as Ontology Languages for the Semantic Web,” Mechanizing Mathematical Reasoning,
- Baader, Horrocks, et al.
- 2005
(Show Context)
Citation Context ...omplexity of ALCQO with acyclic TBoxes 47 1s1 Introduction Description logics [2] play an important r^ole in the Semantic Web since they are the basis of the W3C-recommended Web ontology language OWL =-=[3, 12]-=-, which can be used to create semantic annotations describing the content of Web pages [33]. In addition to static information, the Web also offers services, which allow their users to effect changes ... |

175 | On the relative expressiveness of description logics and predicate logics
- Borgida
- 1996
(Show Context)
Citation Context ...ation calculus, see [28, 16, 25]. The foundation for translating our service formalism into the situation calculus is provided by the standard translation of description logics into first order logic =-=[2, 4]-=-. For our purposes, this translation needs to be slightly modified: in the standard translation, concept names correspond to unary predicates, concepts correspond to firstoder formulae in one free var... |

170 | Terminological reasoning is inherently intractable
- Nebel
- 1990
(Show Context)
Citation Context ...initions, i.e., A I = C I holds for all A ≡ C in T . In the case of acyclic TBoxes, any interpretation of the primitive concepts and of the role names can uniquely be extended to a model of the TBox (=-=Nebel 1990-=-). An ABox assertion is of the form C(a), s(a, b) or ¬s(a, b), where a, b ∈ NI, C is a concept, and s a role name. 1 An ABox is a finite set of ABox assertions. The interpretation I is a model of the ... |

158 | Ramification and causality’,
- Thielscher
- 1997
(Show Context)
Citation Context ...primitive concept names and role names. Concerning the (more natural) descriptive semantics, one may try to adopt the approaches developed for dealing with state constraints in the situation calculus =-=[6, 7, 15, 9]-=-. Details are left for future work. We also encounter semantic problems when removing the second restriction. In particular, admitting arbitrary concepts in post-conditions means that we can no longer... |

152 | Reasoning with individuals for the description logic SHIQ - Horrocks, Sattler, et al. |

150 | Features and Fluents. - Sandewall - 1994 |

136 |
Updating Logical Databases.
- Winslett
- 1990
(Show Context)
Citation Context ... consider simple composite services, which are sequences of atomic services. The semantics of a service is defined using the possible models approach developed in the reasoning about action community =-=[38, 39, 40, 6, 9, 5]-=-, and is fully compatible with the usual DL semantics.. However, we will also show that this semantics can be viewed as an instance of Reiter's approach [27, 25, 16, 28] for taming the situation calcu... |

119 |
Some contributions to the metatheory of the situation calculus.
- Pirri, Reiter
- 1999
(Show Context)
Citation Context ...ng about action community [38, 39, 40, 6, 9, 5], and is fully compatible with the usual DL semantics.. However, we will also show that this semantics can be viewed as an instance of Reiter's approach =-=[27, 25, 16, 28]-=- for taming the situation calculus. In particular, our semantics solves the frame problem in precisely the same way. Then, we concentrate on two basic reasoning problems for (possibly composite) servi... |

113 |
Terminological cycles: Semantics and computational properties
- Nebel
- 1991
(Show Context)
Citation Context ...ive attempt to do this would lead to problems well-known in the reasoning about actions community (Lifschitz 1990). A more promising approach could be to adopt a fixpoint semantics for cyclic TBoxes (=-=Nebel 1991-=-). Under such a semantics, the interpretation of the defined concept names is still uniquely determined by the interpretation of the primitive concept names and role names. Semantic problems are also ... |

108 | Foundations for the situation calculus.
- Levesque, Pirri, et al.
- 1998
(Show Context)
Citation Context ...ng about action community [38, 39, 40, 6, 9, 5], and is fully compatible with the usual DL semantics.. However, we will also show that this semantics can be viewed as an instance of Reiter's approach =-=[27, 25, 16, 28]-=- for taming the situation calculus. In particular, our semantics solves the frame problem in precisely the same way. Then, we concentrate on two basic reasoning problems for (possibly composite) servi... |

105 |
Knowledge in Action.
- Reiter
- 2001
(Show Context)
Citation Context ...f our framework. Introduction Action formalisms such as the Situation Calculus (SitCalc) use full first-order logic for describing the state of the world, and the pre- and post-conditions of actions (=-=Reiter 2001-=-). Consequently, reasoning in such formalisms is undecidable. In contrast, the propositional variants of these formalisms enjoy decidability, but are rather restricted in expressive power. This dichot... |

102 |
Frames in the Space of Situations.
- Lifschitz
- 1990
(Show Context)
Citation Context ...s). One could try to modify Definition 2 such that it also deals with defined concepts. However, a naive attempt to do this would lead to problems well-known in the reasoning about actions community (=-=Lifschitz 1990-=-). A more promising approach could be to adopt a fixpoint semantics for cyclic TBoxes (Nebel 1991). Under such a semantics, the interpretation of the defined concept names is still uniquely determined... |

93 | High Performance Reasoning with Very Large Knowledge Bases.
- Haarslev, Moller
- 2000
(Show Context)
Citation Context ...ds to semantic problems, while removing the second and third restriction leads to both semantic and computational problems. 4.1 Transitive Roles Transitive roles are offered by most modern DL systems =-=[10, 8]-=-, and also by the ontology languages OWL, DAML+OIL, and OIL [12, 11, 7]. They are added to ALCQIO by reserving a subset of roles NtR of NR such that all r 2 NtR are interpreted as transitive relations... |

88 | A road-map on complexity for hybrid logics.
- Areces, Blackburn, et al.
- 1999
(Show Context)
Citation Context ...Point 1); ffl ALCQO w.r.t. acyclic TBoxes is in PSpace, which is proved in Appendix A (yields upper bounds of Point 1); ffl ALCIO w.r.t. acyclic TBoxes is ExpTime-complete, as follows from results in =-=[1]-=- (yields Points 2 and 3); ffl ALCQIO is co-NExpTime-complete as follows from results in [36] and [24] (yields Points 4 and 5). The bounds for executability are then obtained by the reductions of execu... |

77 | The complexity of reasoning with cardinality restrictions and nominals in expressive description logics.
- Tobies
- 2000
(Show Context)
Citation Context ...ds upper bounds of Point 1); ffl ALCIO w.r.t. acyclic TBoxes is ExpTime-complete, as follows from results in [1] (yields Points 2 and 3); ffl ALCQIO is co-NExpTime-complete as follows from results in =-=[36]-=- and [24] (yields Points 4 and 5). The bounds for executability are then obtained by the reductions of executability to projection and vice versa. o In Section 3.3, we prove matching lower bounds for ... |

55 | Introduction to the Fluent Calculus.
- Thielscher
- 1998
(Show Context)
Citation Context ...e OWL. In AI, the notion of an action is used both in the planning and the reasoning about action communities to denote an entity whose execution (by some agent) causes changes of the world (see e.g. =-=[28, 34]-=-). Thus, it is not surprising that theories developed in these comunities have been applied in the context of Semantic Web services. For example, [20, 21] use the situation calculus [28] and GOLOG [17... |

52 | Embracing causality in specifying the indeterminate effects of actions
- Lin
- 1996
(Show Context)
Citation Context ...concepts in post-conditions under PMA results in massive non-determinism. Such nondeterminism requires special mechanisms to be used meaningfully, e.g. based on notions of causality (Thielscher 2000; =-=Lin 1996-=-). It seems unlikely that a suitable mechanism can be found for the case of arbitrary concepts as postconditions. Second, we now also have algorithmic problems: the basic reasoning tasks are not decid... |

32 | Complexity results for first-order two-variable logic with counting
- Pacholski, Szwast, et al.
(Show Context)
Citation Context ...ed with counting quantifiers. This way, projection is reduced to satisfiability in C2. We obtain a simpler reduction, but less sharp complexity results since satisfiability in C2 is NExpTime-complete =-=[24, 26]-=-, and thus quite costly from a computational perspective. However, there are two exceptional cases where we obtain a tight upper bound using the second translation, but not the first: ALCQI and ALCQIO... |

28 | The generation of DAML+OIL
- Horrocks, Patel-Schneider
- 2001
(Show Context)
Citation Context ...ction leads to both semantic and computational problems. 4.1 Transitive Roles Transitive roles are offered by most modern DL systems [10, 8], and also by the ontology languages OWL, DAML+OIL, and OIL =-=[12, 11, 7]-=-. They are added to ALCQIO by reserving a subset of roles NtR of NR such that all r 2 NtR are interpreted as transitive relations rI in all models I. We show that admitting the use of transitive roles... |

25 | The PMA revisited
- Herzig
- 1996
(Show Context)
Citation Context ... consider simple composite services, which are sequences of atomic services. The semantics of a service is defined using the possible models approach developed in the reasoning about action community =-=[38, 39, 40, 6, 9, 5]-=-, and is fully compatible with the usual DL semantics.. However, we will also show that this semantics can be viewed as an instance of Reiter's approach [27, 25, 16, 28] for taming the situation calcu... |

24 | An axiomatic solution to the ramification problem (sometimes).
- McIlraith
- 2000
(Show Context)
Citation Context |

24 | Semantic Web Services: description requirements and current technologies
- Lara, Lausen, et al.
(Show Context)
Citation Context ...ity. To describe their functionality, services are viewed as processes that (among other things) have preconditions and effects. A similar approach is taken by the Web service modelling ontology WSMO =-=[15]-=-. However, the faithful representation of the dynamic behaviour of processes (what changes of the world they cause) is beyond the scope of a static ontology language like OWL. In AI, the notion of an ... |

8 |
Nondeterministic actions in the fluent calculus: Disjunctive state update axioms
- Thielscher
(Show Context)
Citation Context ...ransitivity of has-partI. In the area of reasoning about actions, it is well-known that non-determinism of this kind requires extra effort to obtain sensible consequences of action/service executions =-=[19, 35]-=-. In the above example, it is unlikely that both outcomes of the service application are equally desirable. Thus, we need a mechanism for eliminating unwanted outcomes or preferring the desired ones. ... |

7 |
Epistemic aspects of databases
- Winslett
- 1995
(Show Context)
Citation Context |

2 |
How to do things with worlds
- Brewka, Hertzberg
- 1993
(Show Context)
Citation Context |

2 |
Counting quantifiers and the stellar fragment. Available at The Mathematics Preprint Server, www.mathpreprints.com
- Pratt-Hartmann
- 2003
(Show Context)
Citation Context ...ed with counting quantifiers. This way, projection is reduced to satisfiability in C2. We obtain a simpler reduction, but less sharp complexity results since satisfiability in C2 is NExpTime-complete =-=[24, 26]-=-, and thus quite costly from a computational perspective. However, there are two exceptional cases where we obtain a tight upper bound using the second translation, but not the first: ALCQI and ALCQIO... |