840 search results - page 82 / 168 » A low-complexity issue logic |
90
Voted
HICSS
2009
IEEE
15 years 7 months 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 ...
210
Voted
POPL
2004
ACM
16 years 27 days 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...
119
Voted
WISE
2005
Springer
15 years 6 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...
94
Voted
FPCA
1989
15 years 4 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...
114
Voted
FLAIRS
2007
15 years 2 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...