1268 search results - page 78 / 254 » One Logic to Use Them All |
88
Voted
AGILE
2007
Springer
15 years 7 months ago
2007
Springer
Using qualitative reasoning with geographic information, contrarily, for instance, with robotics, looks not only fastidious (i.e.: encoding knowledge Propositional Logics PL), but ...
119
Voted
ISMVL
2000
IEEE
15 years 5 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
103
click to vote
UAI
2003
15 years 2 months ago
2003
This paper examines a number of solution methods for decision processes with non-Markovian rewards (NMRDPs). They all exploit a temporal logic specification of the reward functio...
210
Voted
POPL
2004
ACM
16 years 1 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...
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...