4573 search results - page 374 / 915 » Automated Reasoning |
209
Voted
CADE
2007
Springer
16 years 7 months ago
2007
Springer
We bring together two recent trends in description logic (DL): lightweight DLs in which the subsumption problem is tractable and conservative extensions as a central tool for forma...
232
click to vote
DEON
2010
Springer
16 years 10 days ago
2010
Springer
Abstract. Privacy policies are often defined in terms of permitted messages. Instead, in this paper we derive dynamically the permitted messages from static privacy policies defi...
196
click to vote
KR
2010
Springer
16 years 9 days ago
2010
Springer
Of the common commutative binary logical connectives, only and and or may be used as operators that take arbitrary numbers of arguments with order and multiplicity being irrelevan...
216
click to vote
KR
2010
Springer
16 years 9 days ago
2010
Springer
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
214
Voted
KR
2010
Springer
16 years 9 days ago
2010
Springer
Preference logics and AI preference representation languages are both concerned with reasoning about preferences on combinatorial domains, yet so far these two streams of research...