3793 search results - page 259 / 759 » Expressive Description Logics |
176
click to vote
JAIR
2008
15 years 6 months ago
2008
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
179
click to vote
ITA
2007
15 years 6 months ago
2007
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
186
click to vote
ICLP
2003
Springer
15 years 12 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
189
click to vote
ATAL
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We argue that none of the existing epistemic logics can adequately serve the needs of agent theories. We suggest a new concept of knowledge which generalizes both implici...
169
click to vote
IJCAI
2003
15 years 8 months ago
2003
Inconsistencies frequently occur in knowledge about the real-world. Some of these inconsistencies may be more significant than others, and some knowledgebases (sets of formulae) m...