7991 search results - page 570 / 1599 » Using More Reasoning to Improve |
240
click to vote
DLOG
2010
15 years 5 months ago
2010
Multiple distributed and modular ontology representation frameworks have recently appeared. They typically extend Description Logics (DL), with new constructs to represent relation...
219
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
214
click to vote
POPL
2012
ACM
14 years 2 months ago
2012
ACM
Separation Logic has witnessed tremendous success in recent years in reasoning about programs that deal with heap storage. Its success owes to the fundamental principle that one s...
186
click to vote
DAC
2005
ACM
16 years 8 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
206
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Computational trust and reputation models have been recognized as one of the key technologies required to design and implement agent systems. These models manage and aggregate the...