2649 search results - page 187 / 530 » Temporal Theories of Reasoning |
186
click to vote
AIR
2006
15 years 6 months ago
2006
Abstract Storing and retrieving time-related information are important, or even critical, tasks on many areas of Computer Science (CS) and in particular for Artificial Intelligence...
172
click to vote
CADE
2008
Springer
16 years 7 months ago
2008
Springer
Satisfiability Modulo Theories (SMT) solvers have proven highly scalable, efficient and suitable for integrated theory reasoning. The most efficient SMT solvers rely on refutationa...
165
click to vote
ESWS
2005
Springer
16 years 4 days ago
2005
Springer
There is an ongoing discussion whether reasoning in the Semantic Web should be monotonic or not. It seems however that the problem concerns not only the reasoning over knowledge bu...
182
Voted
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
166
click to vote
LICS
1991
IEEE
15 years 10 months ago
1991
IEEE
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...