Results 11  20
of
51
LTL over description logic axioms
 In Proceedings of DL08, CEUR Workshop Proceedings. CEURWS.org
, 2008
"... In many applications of Description Logics (DLs) [7], such as the use of DLs as ontology languages or conceptual modeling languages, being able to represent dynamic aspects of the application domain would be quite useful. This is, for instance, the case if one wants to use DLs as conceptual modeling ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
In many applications of Description Logics (DLs) [7], such as the use of DLs as ontology languages or conceptual modeling languages, being able to represent dynamic aspects of the application domain would be quite useful. This is, for instance, the case if one wants to use DLs as conceptual modeling languages
Temporalising Tableaux
 STUDIA LOGICA
, 2004
"... As a remedy for the bad computational behaviour of firstorder temporal logic (FOTL), it has recently been proposed to restrict the application of temporal operators to formulas with at most one free variable thereby obtaining socalled monodic fragments of FOTL. In this paper, we are concerned with ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
As a remedy for the bad computational behaviour of firstorder temporal logic (FOTL), it has recently been proposed to restrict the application of temporal operators to formulas with at most one free variable thereby obtaining socalled monodic fragments of FOTL. In this paper, we are concerned with constructing tableau algorithms for monodic fragments based on decidable fragments of firstorder logic like the twovariable fragment or the guarded fragment. We present a general framework that shows how existing decision procedures for firstorder fragments can be used for constructing a tableau algorithm for the corresponding monodic fragment of FOTL.
A Proposal for Describing Services with DLs
 In Proc. of DL 2002
, 2002
"... Motivated by the semantic web application, we present a generic extension of description logics to describe actions. These actions can then be chained to service descriptions. A web page providing a service can be annotated with a description of this service, which can then be taken into account by ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
Motivated by the semantic web application, we present a generic extension of description logics to describe actions. These actions can then be chained to service descriptions. A web page providing a service can be annotated with a description of this service, which can then be taken into account by agents searching for a web service. Besides syntax and semantics of this extension of DLs, we de ne and discuss inference problems which are useful to annotate web pages with a description of the service they provide.
Ontological Overhearing
, 2001
"... The collaboration between two intelligent agents can be greatly enhanced if a third agent, who has some understanding of the communication between the first two, intervenes giving appropriate information or acting helpfully without having been explicitly involved. The behavior of this third agent ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
The collaboration between two intelligent agents can be greatly enhanced if a third agent, who has some understanding of the communication between the first two, intervenes giving appropriate information or acting helpfully without having been explicitly involved. The behavior of this third agent, quite common in human interaction, is called overhearing. We present an agent architecture modeling this behavior. In particular, we focus on overhearing based on ontological reasoning; that is, the overhearer semantically selects pieces of communication according to his own knowledge (ontologically organized) and goals. In our
The Product of Converse PDL and Polymodal K
 Journal of Logic and Computation
"... The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form F G such that F and G validate L1 and L2, respectively. This paper proves the decidability of the product of converse PDL and polymodal K. Decidability results for products of modal logics of k ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form F G such that F and G validate L1 and L2, respectively. This paper proves the decidability of the product of converse PDL and polymodal K. Decidability results for products of modal logics of knowledge as well as temporal logics and polymodal K are discussed. All those products form rather expressive but still decidable fragments of modal predicate logics. Based on the equivalence of polymodal K and the description logic ALC we shall discuss the obtained fragments, extend the expressive power a bit, and compare them with other modal description logics. 1
Applications of Description Logics: State of the Art and Research Challenges
 Proc. of the 13th Int. Conf. on Conceptual Structures (ICCSâ€™05), number 3596 in Lecture Notes in Artificial Intelligence
, 2005
"... Abstract. Description Logics (DLs) are a family of class based knowledge representation formalisms characterised by the use of various constructors to build complex classes from simpler ones, and by an emphasis on the provision of sound, complete and (empirically) tractable reasoning services. They ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Abstract. Description Logics (DLs) are a family of class based knowledge representation formalisms characterised by the use of various constructors to build complex classes from simpler ones, and by an emphasis on the provision of sound, complete and (empirically) tractable reasoning services. They have a range of applications, but are mostly widely known as the basis for ontology languages such as OWL. The increasing use of DL based ontologies in areas such as eScience and the Semantic Web is, however, already stretching the capabilities of existing DL systems, and brings with it a range of challenges for future research. 1
A Simplified Clausal Resolution Procedure for Propositional LinearTime Temporal Logic
 In Tableaux 2002, Proceedings
, 2002
"... The clausal resolution method for propositional lineartime temporal logics is well known and provides the basis for a number of temporal provers. The method is based on an intuitive clausal form, called SNF, comprising three main clause types and a small number of resolution rules. In this paper ..."
Abstract

Cited by 12 (8 self)
 Add to MetaCart
The clausal resolution method for propositional lineartime temporal logics is well known and provides the basis for a number of temporal provers. The method is based on an intuitive clausal form, called SNF, comprising three main clause types and a small number of resolution rules. In this paper, we show how the normal form can be radically simplified and, consequently, how a simplified clausal resolution method can be defined for this important variety of logic.
TRP ++ : A temporal resolution prover
 In Collegium Logicum
, 2002
"... this paper. 2 Basics of PLTL Let P be a set of propositional variables. The set of formulae of propositional linear time logic PLTL (over P) is inductively defined as follows: (i) ? is a formula of PLTL, (ii) every propositional variable of P is a formula of PLTL, (iii) if ' and / are formulae of ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
this paper. 2 Basics of PLTL Let P be a set of propositional variables. The set of formulae of propositional linear time logic PLTL (over P) is inductively defined as follows: (i) ? is a formula of PLTL, (ii) every propositional variable of P is a formula of PLTL, (iii) if ' and / are formulae of PLTL, then :' and (' /) are formulae of PLTL, and (iv) if ' and / are formulae of PLTL, then #' (in the next moment of time ' is true), 3' (sometimes in the future ' is true), 2' (always in the future ' is true), (' U /) (' is true until / is true), and (' W /) (' is true unless / is true) are formulae of PLTL. Other Boolean connectives including ?, , !, and $ are defined using ?, :, and