4617 search results - page 399 / 924 » Automation of Diagrammatic Reasoning |
190
click to vote
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...
183
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
Abstract. Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for ...
207
click to vote
DEON
2010
Springer
15 years 11 months 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...
176
click to vote
KR
2010
Springer
15 years 11 months 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...
191
click to vote
KR
2010
Springer
15 years 11 months 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...