840 search results - page 82 / 168 » A low-complexity issue logic |
140
click to vote
HICSS
2009
IEEE
16 years 22 days ago
2009
IEEE
As semantic web technologies are increasingly used to empower knowledge management systems (KMSs), there is a growing need for mechanisms and automated tools for checking content ...
271
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
187
click to vote
WISE
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
159
click to vote
FPCA
1989
15 years 10 months ago
1989
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
179
click to vote
FLAIRS
2007
15 years 8 months ago
2007
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented...