Sciweavers

282 search results - page 8 / 57
» Common knowledge in update logics
Sort
View
DLOG
2003
13 years 8 months ago
Computing Least Common Subsumers for FLE+
Transitive roles are important for adequate representation of knowledge in a range of applications. In this paper we present a first algorithm to compute least common subsumers i...
Sebastian Brandt, Anni-Yasmin Turhan
JANCL
2007
95views more  JANCL 2007»
13 years 7 months ago
Dynamic logic of preference upgrade
ABSTRACT. Statements not only update our current knowledge, but also have other dynamic effects. In particular, suggestions or commands ‘upgrade’ our preferences by changing th...
Johan van Benthem, Fenrong Liu
INFORMATICALT
2007
111views more  INFORMATICALT 2007»
13 years 7 months ago
Sequent Calculi for Branching Time Temporal Logics of Knowledge and Belief
In this paper we consider branching time temporal logics of knowledge and belief. These logics involve the discrete time linear temporal logic operators “next” and “until” ...
Jurate Sakalauskaite
TPLP
2002
117views more  TPLP 2002»
13 years 7 months ago
On Properties of Update Sequences Based on Causal Rejection
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
JELIA
2004
Springer
14 years 25 days ago
Computing the Least Common Subsumer w.r.t. a Background Terminology
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very e...
Franz Baader, Baris Sertkaya, Anni-Yasmin Turhan