1544 search results - page 175 / 309 » Automated Evaluation of Description Logic Reasoning Systems |
178
click to vote
DEON
2008
Springer
15 years 8 months ago
2008
Springer
The security policy of an information system may include a wide range of different requirements. The literature has primarily focused on access and information flow control require...
265
click to vote
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
Answer Set Programming (ASP) is a powerful paradigm of logic programming for non-monotonic reasoning. However, the restriction of “grounded range-restricted function-free normal ...
189
click to vote
CADE
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
170
click to vote
LPAR
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...
188
click to vote
LICS
2008
IEEE
16 years 25 days ago
2008
IEEE
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...